{"id":"https://openalex.org/W6927200123","doi":"https://doi.org/10.25596/jalc-2003-593","title":"Computing Quasi Suffix Arrays","display_name":"Computing Quasi Suffix Arrays","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W6927200123","doi":"https://doi.org/10.25596/jalc-2003-593"},"language":"en","primary_location":{"id":"doi:10.25596/jalc-2003-593","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2003-593","pdf_url":null,"source":{"id":"https://openalex.org/S7407052944","display_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.25596/jalc-2003-593","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Fran\u011bk, Franti\u0161ek","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Fran\u011bk, Franti\u0161ek","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Holub, Jan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Holub, Jan","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Smyth, William F.","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Smyth, William F.","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Xiao, Xiangdong","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xiao, Xiangdong","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.46707053,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9933000206947327,"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.9933000206947327,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.0017999999690800905,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.0010000000474974513,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/generalized-suffix-tree","display_name":"Generalized suffix tree","score":0.8787999749183655},{"id":"https://openalex.org/keywords/compressed-suffix-array","display_name":"Compressed suffix array","score":0.8529999852180481},{"id":"https://openalex.org/keywords/suffix","display_name":"Suffix","score":0.8317999839782715},{"id":"https://openalex.org/keywords/suffix-array","display_name":"Suffix array","score":0.6976000070571899},{"id":"https://openalex.org/keywords/lexicographical-order","display_name":"Lexicographical order","score":0.6611999869346619},{"id":"https://openalex.org/keywords/suffix-tree","display_name":"Suffix tree","score":0.5981000065803528},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5764999985694885},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5239999890327454}],"concepts":[{"id":"https://openalex.org/C118146561","wikidata":"https://www.wikidata.org/wiki/Q5532514","display_name":"Generalized suffix tree","level":4,"score":0.8787999749183655},{"id":"https://openalex.org/C100903775","wikidata":"https://www.wikidata.org/wiki/Q5157028","display_name":"Compressed suffix array","level":4,"score":0.8529999852180481},{"id":"https://openalex.org/C2779804580","wikidata":"https://www.wikidata.org/wiki/Q102047","display_name":"Suffix","level":2,"score":0.8317999839782715},{"id":"https://openalex.org/C2779259728","wikidata":"https://www.wikidata.org/wiki/Q281472","display_name":"Suffix array","level":3,"score":0.6976000070571899},{"id":"https://openalex.org/C159254197","wikidata":"https://www.wikidata.org/wiki/Q1144915","display_name":"Lexicographical order","level":2,"score":0.6611999869346619},{"id":"https://openalex.org/C2781166958","wikidata":"https://www.wikidata.org/wiki/Q1426863","display_name":"Suffix tree","level":3,"score":0.5981000065803528},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5764999985694885},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5239999890327454},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5157999992370605},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.5109999775886536},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45500001311302185},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42590001225471497},{"id":"https://openalex.org/C2780861071","wikidata":"https://www.wikidata.org/wiki/Q1062934","display_name":"Character (mathematics)","level":2,"score":0.38109999895095825},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.34290000796318054},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.3400999903678894},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31610000133514404},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.3093000054359436},{"id":"https://openalex.org/C7757238","wikidata":"https://www.wikidata.org/wiki/Q374040","display_name":"String searching algorithm","level":3,"score":0.2881999909877777},{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.2851000130176544},{"id":"https://openalex.org/C2776372474","wikidata":"https://www.wikidata.org/wiki/Q508291","display_name":"Simplicity","level":2,"score":0.2639000117778778},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.25369998812675476}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.25596/jalc-2003-593","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2003-593","pdf_url":null,"source":{"id":"https://openalex.org/S7407052944","display_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.25596/jalc-2003-593","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2003-593","pdf_url":null,"source":{"id":"https://openalex.org/S7407052944","display_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,14,64],"introduce":[1],"quasi":[2,18,68,109,219],"suffix":[3,9,19,42,69,110,146,150,208,220],"arrays":[4,10,43,209,221],"as":[5,190],"a":[6,17,31,87,95],"generalization":[7],"of":[8,23,26,41,61,98,132,175,231],"for":[11,34,56,71],"character":[12],"strings.":[13],"show":[15],"that":[16,50,74,106,137,162,180,234],"array":[20,111,151],"encodes":[21],"enough":[22],"the":[24,27,38,102,108,113,123,163,183,188,191,202,216,226],"structure":[25],"string":[28],"to":[29],"be":[30,77,187,199],"useful":[32],"construct":[33],"many":[35],"applications":[36],"where":[37,120],"full":[39],"power":[40],"is":[44,122,166],"not":[45,52,181,236],"necessary,":[46],"notably":[47],"in":[48,67,112,115,138,197,210,225],"problems":[49],"do":[51,235],"require":[53],"lexicographical":[54],"order,":[55],"example,":[57],"pattern-matching":[58],"or":[59],"calculation":[60],"repeating":[62],"substrings.":[63],"are":[65],"interested":[66],"arrays,":[70],"we":[72,93,158],"believe":[73],"they":[75],"can":[76,159,222],"calculated":[78],"by":[79,101,130,173,213],"simple,":[80],"fast,":[81],"and":[82,148,228],"space":[83,229],"efficient":[84],"algorithms.":[85,153],"As":[86],"first":[88],"step":[89],"towards":[90],"this":[91,156],"goal,":[92],"describe":[94],"family":[96],"DIST":[97,232],"algorithms":[99,141,233],"(inspired":[100],"Crochemore's":[103],"repetitions":[104],"algorithm)":[105],"compute":[107],"average-case":[114,164,192],"$O(|x|":[116,167],"\\log":[117,168],"|x|)$":[118],"time,":[119],"$x$":[121],"input":[124],"string.":[125],"Based":[126],"on":[127,206],"experiments":[128],"conducted":[129],"one":[131,174],"us":[133,176],"(Xiao),":[134],"it":[135],"appears":[136],"practice":[139],"our":[140],"execute":[142],"faster":[143],"than":[144],"all":[145],"tree":[147],"most":[149],"construction":[152],"Though":[154],"at":[155],"time":[157,212],"only":[160,182,217],"prove":[161],"complexity":[165,185],"|x|)$,":[169],"tests":[170],"carried":[171],"out":[172],"(Holub)":[177],"strongly":[178],"suggest":[179],"worst-case":[184],"may":[186,196],"same":[189],"complexity,":[193],"but":[194],"both":[195],"fact":[198],"linear.":[200],"Given":[201],"very":[203],"recent":[204],"results":[205],"computing":[207],"linear":[211],"recursive":[214],"algorithms,":[215],"advantage":[218],"have":[223],"lies":[224],"simplicity":[227],"efficiency":[230],"use":[237],"recursion.":[238]},"counts_by_year":[],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}