{"id":"https://openalex.org/W3197565376","doi":"https://doi.org/10.4230/lipics.esa.2021.15","title":"Lyndon Words Accelerate Suffix Sorting","display_name":"Lyndon Words Accelerate Suffix Sorting","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3197565376","doi":"https://doi.org/10.4230/lipics.esa.2021.15","mag":"3197565376"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:14596","doi":null,"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2021.15","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol204-esa2021/LIPIcs.ESA.2021.15/LIPIcs.ESA.2021.15.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol204-esa2021/LIPIcs.ESA.2021.15/LIPIcs.ESA.2021.15.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5035605605","display_name":"Nico Bertram","orcid":"https://orcid.org/0009-0003-0549-5874","observed_orcids":["https://orcid.org/0009-0003-0549-5874"]},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Bertram, Nico","raw_affiliation_strings":["Department of Computer Science, Technische Universit\u00e4t Dortmund, Germany","TU Dortmund University, Dortmund, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Technische Universit\u00e4t Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]},{"raw_affiliation_string":"TU Dortmund University, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035566443","display_name":"Jonas Ellert","orcid":"https://orcid.org/0000-0003-3305-6185","observed_orcids":["https://orcid.org/0000-0003-3305-6185"]},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Ellert, Jonas","raw_affiliation_strings":["Department of Computer Science, Technische Universit\u00e4t Dortmund, Germany","TU Dortmund University, Dortmund, Germany"],"raw_orcid":"https://orcid.org/0000-0003-3305-6185","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Technische Universit\u00e4t Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]},{"raw_affiliation_string":"TU Dortmund University, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055443993","display_name":"Johannes Fischer","orcid":"https://orcid.org/0000-0002-3384-597X","observed_orcids":["https://orcid.org/0000-0002-3384-597X"]},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Fischer, Johannes","raw_affiliation_strings":["Department of Computer Science, Technische Universit\u00e4t Dortmund, Germany","TU Dortmund University, Dortmund, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Technische Universit\u00e4t Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]},{"raw_affiliation_string":"TU Dortmund University, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I200332995"],"apc_list":null,"apc_paid":null,"fwci":1.1478,"has_fulltext":true,"cited_by_count":11,"citation_normalized_percentile":{"value":0.74001699,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":97},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T13664","display_name":"Genome Rearrangement Algorithms","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/suffix-sorting","display_name":"suffix sorting","score":0.9890000224113464},{"id":"https://openalex.org/keywords/lyndon-words","display_name":"Lyndon words","score":0.996999979019165},{"id":"https://openalex.org/keywords/string-algorithms","display_name":"string algorithms","score":0.7160000205039978},{"id":"https://openalex.org/keywords/parallel-algorithms","display_name":"parallel algorithms","score":0.546999990940094}],"concepts":[{"id":"https://openalex.org/C2779804580","wikidata":"https://www.wikidata.org/wiki/Q102047","display_name":"Suffix","level":2,"score":0.8996714353561401},{"id":"https://openalex.org/C2779259728","wikidata":"https://www.wikidata.org/wiki/Q281472","display_name":"Suffix array","level":3,"score":0.8028858304023743},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.7859367728233337},{"id":"https://openalex.org/C100903775","wikidata":"https://www.wikidata.org/wiki/Q5157028","display_name":"Compressed suffix array","level":4,"score":0.7618936896324158},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7526214122772217},{"id":"https://openalex.org/C118146561","wikidata":"https://www.wikidata.org/wiki/Q5532514","display_name":"Generalized suffix tree","level":4,"score":0.7506839632987976},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.5797914862632751},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.5155932307243347},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.4999682903289795},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4605291485786438},{"id":"https://openalex.org/C2781166958","wikidata":"https://www.wikidata.org/wiki/Q1426863","display_name":"Suffix tree","level":3,"score":0.453321635723114},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39766770601272583},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.24048948287963867},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18850639462471008},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.11661025881767273},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11123543977737427},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:14596","doi":null,"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2021.15","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol204-esa2021/LIPIcs.ESA.2021.15/LIPIcs.ESA.2021.15.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.esa.2021.15","doi":"https://doi.org/10.4230/lipics.esa.2021.15","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.esa.2021.15","pdf_url":null,"source":{"id":"https://openalex.org/S4393917817","display_name":"Leibniz international proceedings in informatics","issn_l":"1868-8969","issn":["1868-8969"],"is_oa":true,"is_in_doaj":true,"is_core":false,"listed_in":["doaj","jufo-1","norway-1"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:14596","doi":null,"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2021.15","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol204-esa2021/LIPIcs.ESA.2021.15/LIPIcs.ESA.2021.15.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G617271991","display_name":null,"funder_award_id":"SFB876","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3197565376.pdf","grobid_xml":"https://content.openalex.org/works/W3197565376.grobid-xml"},"referenced_works_count":8,"referenced_works":["https://openalex.org/W1542553486","https://openalex.org/W1599214081","https://openalex.org/W1969173824","https://openalex.org/W2073103034","https://openalex.org/W2576782855","https://openalex.org/W2604604482","https://openalex.org/W2964316344","https://openalex.org/W2977415232"],"related_works":["https://openalex.org/W2613862761","https://openalex.org/W2964347760","https://openalex.org/W3037605707","https://openalex.org/W7097552705","https://openalex.org/W2947842203","https://openalex.org/W2032930944","https://openalex.org/W2007399809","https://openalex.org/W7097539637","https://openalex.org/W57812598","https://openalex.org/W2159707167"],"abstract_inverted_index":{"Suffix":[0],"sorting":[1,14,48,87,131],"is":[2,22,29,92],"arguably":[3],"the":[4,16,27,43,51,54,68,125],"most":[5],"fundamental":[6],"building":[7],"block":[8],"in":[9,15,36,128],"string":[10],"algorithmics,":[11],"like":[12],"regular":[13],"broader":[17],"field":[18],"of":[19,31,53,77,137],"algorithms.":[20],"It":[21,111],"thus":[23],"not":[24],"surprising":[25],"that":[26],"literature":[28],"full":[30],"algorithms":[32],"for":[33],"suffix":[34,47,70,86,130],"sorting,":[35],"particular":[37],"focusing":[38],"on":[39,45,97,107],"their":[40],"practicality.":[41],"However,":[42],"advances":[44,127],"practical":[46,129],"stalled":[49],"with":[50],"emergence":[52],"DivSufSort":[55,96],"algorithm":[56,91],"more":[57,133],"than":[58,95,134],"10":[59],"years":[60],"ago,":[61],"which,":[62],"up":[63,101],"to":[64,84,102],"date,":[65],"has":[66],"remained":[67],"fastest":[69],"sorter.":[71],"This":[72],"article":[73],"shows":[74],"how":[75],"properties":[76],"Lyndon":[78],"words":[79],"can":[80,112,119],"be":[81,114,120],"exploited":[82],"algorithmically":[83],"accelerate":[85],"again.":[88],"Our":[89],"new":[90],"6-19%":[93],"faster":[94],"real-world":[98],"texts,":[99],"and":[100],"three":[103],"times":[104],"as":[105],"fast":[106],"artificial":[108],"repetitive":[109],"texts.":[110],"also":[113],"parallelized,":[115],"where":[116],"similar":[117],"speedups":[118],"observed.":[121],"Thus,":[122],"we":[123],"make":[124],"first":[126],"after":[132],"a":[135],"decade":[136],"standstill.":[138]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2021-09-13T00:00:00"}
