{"id":"https://openalex.org/W4391652638","doi":"https://doi.org/10.1145/3641854","title":"Generic Non-recursive Suffix Array Construction","display_name":"Generic Non-recursive Suffix Array Construction","publication_year":2024,"publication_date":"2024-02-08","ids":{"openalex":"https://openalex.org/W4391652638","doi":"https://doi.org/10.1145/3641854"},"language":"en","primary_location":{"id":"doi:10.1145/3641854","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3641854","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3641854","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3641854","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5011336831","display_name":"Jannik Olbrich","orcid":"https://orcid.org/0000-0003-3291-7342"},"institutions":[{"id":"https://openalex.org/I196349391","display_name":"Universit\u00e4t Ulm","ror":"https://ror.org/032000t02","country_code":"DE","type":"education","lineage":["https://openalex.org/I196349391"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Jannik Olbrich","raw_affiliation_strings":["University of Ulm, Ulm, Germany"],"raw_orcid":"https://orcid.org/0000-0003-3291-7342","affiliations":[{"raw_affiliation_string":"University of Ulm, Ulm, Germany","institution_ids":["https://openalex.org/I196349391"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090763399","display_name":"Enno Ohlebusch","orcid":"https://orcid.org/0009-0008-3937-3652"},"institutions":[{"id":"https://openalex.org/I196349391","display_name":"Universit\u00e4t Ulm","ror":"https://ror.org/032000t02","country_code":"DE","type":"education","lineage":["https://openalex.org/I196349391"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Enno Ohlebusch","raw_affiliation_strings":["University of Ulm, Ulm, Germany"],"raw_orcid":"https://orcid.org/0009-0008-3937-3652","affiliations":[{"raw_affiliation_string":"University of Ulm, Ulm, Germany","institution_ids":["https://openalex.org/I196349391"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088688063","display_name":"Thomas B\u00fcchler","orcid":"https://orcid.org/0000-0002-9273-5439"},"institutions":[{"id":"https://openalex.org/I196349391","display_name":"Universit\u00e4t Ulm","ror":"https://ror.org/032000t02","country_code":"DE","type":"education","lineage":["https://openalex.org/I196349391"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Thomas B\u00fcchler","raw_affiliation_strings":["University of Ulm, Ulm, Germany"],"raw_orcid":"https://orcid.org/0000-0002-9273-5439","affiliations":[{"raw_affiliation_string":"University of Ulm, Ulm, Germany","institution_ids":["https://openalex.org/I196349391"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I196349391"],"apc_list":null,"apc_paid":null,"fwci":1.6671,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.85230082,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":"20","issue":"2","first_page":"1","last_page":"42"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12162","display_name":"Cellular Automata and Applications","score":0.9909999966621399,"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/T12029","display_name":"DNA and Biological Computing","score":0.9854000210762024,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"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","display_name":"Suffix","score":0.7104592323303223},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5923898220062256},{"id":"https://openalex.org/keywords/suffix-array","display_name":"Suffix array","score":0.5116989612579346},{"id":"https://openalex.org/keywords/compressed-suffix-array","display_name":"Compressed suffix array","score":0.49618297815322876},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3863251805305481},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3786347508430481},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.36016812920570374},{"id":"https://openalex.org/keywords/suffix-tree","display_name":"Suffix tree","score":0.3414137363433838},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.21962818503379822},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.17393827438354492}],"concepts":[{"id":"https://openalex.org/C2779804580","wikidata":"https://www.wikidata.org/wiki/Q102047","display_name":"Suffix","level":2,"score":0.7104592323303223},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5923898220062256},{"id":"https://openalex.org/C2779259728","wikidata":"https://www.wikidata.org/wiki/Q281472","display_name":"Suffix array","level":3,"score":0.5116989612579346},{"id":"https://openalex.org/C100903775","wikidata":"https://www.wikidata.org/wiki/Q5157028","display_name":"Compressed suffix array","level":4,"score":0.49618297815322876},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3863251805305481},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3786347508430481},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.36016812920570374},{"id":"https://openalex.org/C2781166958","wikidata":"https://www.wikidata.org/wiki/Q1426863","display_name":"Suffix tree","level":3,"score":0.3414137363433838},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.21962818503379822},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.17393827438354492},{"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":1,"locations":[{"id":"doi:10.1145/3641854","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3641854","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3641854","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3641854","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3641854","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3641854","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6215124692","display_name":null,"funder_award_id":"OH 53/7-1","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":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4391652638.pdf","grobid_xml":"https://content.openalex.org/works/W4391652638.grobid-xml"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W117230746","https://openalex.org/W1520575986","https://openalex.org/W1533768783","https://openalex.org/W1950227463","https://openalex.org/W1969173824","https://openalex.org/W1977174119","https://openalex.org/W2073103034","https://openalex.org/W2093599904","https://openalex.org/W2102987669","https://openalex.org/W2139749722","https://openalex.org/W2161488606","https://openalex.org/W2313966519","https://openalex.org/W2400487982","https://openalex.org/W2407929722","https://openalex.org/W2519490418","https://openalex.org/W2576782855","https://openalex.org/W2604604482","https://openalex.org/W2611059838","https://openalex.org/W2916044693","https://openalex.org/W2963653132","https://openalex.org/W3037043591","https://openalex.org/W3139034841","https://openalex.org/W3197565376","https://openalex.org/W3203859541","https://openalex.org/W3213146285","https://openalex.org/W4221141568","https://openalex.org/W4313031064","https://openalex.org/W4367355557","https://openalex.org/W6906796481"],"related_works":["https://openalex.org/W2003608043","https://openalex.org/W153119118","https://openalex.org/W2583658747","https://openalex.org/W2405892617","https://openalex.org/W2158874082","https://openalex.org/W1575722140","https://openalex.org/W4293529780","https://openalex.org/W1498395615","https://openalex.org/W2073921136","https://openalex.org/W2055795184"],"abstract_inverted_index":{"The":[0,90],"suffix":[1,22,41,166,179],"array":[2,42,167,180],"is":[3,18,35,64,78,95,183,200,221,230],"arguably":[4],"one":[5],"of":[6,21,92,142],"the":[7,29,36,73,83,99,130,143,154,164,169,173],"most":[8],"important":[9],"data":[10,228],"structures":[11],"in":[12,33,56,103,149],"sequence":[13],"analysis":[14],"and":[15,77,105,107,117,138,168,175,194,217],"consequently":[16],"there":[17,51],"a":[19,65,88,139],"multitude":[20],"sorting":[23,75,100],"algorithms.":[24],"However,":[25],"to":[26,111,127,162],"this":[27,93],"date":[28],"GSACA":[30,58,104,189],"algorithm":[31,44,67,155,182],"introduced":[32],"2015":[34],"only":[37,185],"known":[38],"non-recursive":[39],"linear-time":[40,115],"construction":[43,181,210],"(SACA).":[45],"Despite":[46],"its":[47,109],"interesting":[48],"theoretical":[49],"properties,":[50],"has":[52],"been":[53],"little":[54],"effort":[55],"improving":[57],"\u2019s":[59],"non-competitive":[60],"real-world":[61],"performance.":[62],"There":[63],"super-linear":[66],"DSH":[68,106,195],",":[69,82],"which":[70],"relies":[71],"on":[72,212,227],"same":[74],"principle":[76,101],"faster":[79,187,201,222],"than":[80,188,202,223],"DivSufSort":[81,193],"fastest":[84],"SACA":[85],"for":[86,172],"over":[87],"decade.":[89],"purpose":[91],"article":[94],"twofold:":[96],"We":[97,152],"analyse":[98],"used":[102,126,161,171],"exploit":[108],"properties":[110],"give":[112],"an":[113],"optimised":[114],"algorithm,":[116],"we":[118],"show":[119],"that":[120,229],"it":[121,158],"can":[122,159],"be":[123,160],"very":[124],"elegantly":[125],"compute":[128,163],"both":[129],"original":[131],"extended":[132],"Burrows-Wheeler":[133,144],"transform":[134,145],"(":[135,146],"eBWT":[136,176,219],")":[137,148],"bijective":[140],"version":[141],"BBWT":[147,174,198,209],"linear":[150],"time.":[151],"call":[153],"\u201cgeneric,\u201d":[156],"since":[157],"regular":[165],"variants":[170],".":[177,196],"Our":[178,197],"not":[184,231],"significantly":[186],"but":[190],"also":[191],"outperforms":[192],"-algorithm":[199,220],"or":[203,214],"competitive":[204],"with":[205],"all":[206,224],"other":[207,225],"tested":[208],"implementations":[211],"large":[213],"repetitive":[215],"data,":[216],"our":[218],"programs":[226],"extremely":[232],"repetitive.":[233]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}