{"id":"https://openalex.org/W7167038941","doi":"https://doi.org/10.48550/arxiv.2607.00204","title":"Computing Smallest Suffixient Arrays in Sublinear Time","display_name":"Computing Smallest Suffixient Arrays in Sublinear Time","publication_year":2026,"publication_date":"2026-06-30","ids":{"openalex":"https://openalex.org/W7167038941","doi":"https://doi.org/10.48550/arxiv.2607.00204"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2607.00204","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.00204","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2607.00204","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5017230590","display_name":"Hiroto Fujimaru","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fujimaru, Hiroto","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5139923943","display_name":"Gonzalo Navarro","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Navarro, Gonzalo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5139738763","display_name":"Francisco Olivares","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Olivares, Francisco","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082711976","display_name":"Jakub Radoszewski","orcid":"https://orcid.org/0000-0002-0067-6401"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Radoszewski, Jakub","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063451211","display_name":"Giuseppe Romana","orcid":"https://orcid.org/0000-0002-3489-0684"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Romana, Giuseppe","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5139922752","display_name":"Cristian Urbina","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Urbina, Cristian","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"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":0.984499990940094,"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.984499990940094,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.007600000128149986,"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.0013000000035390258,"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/sublinear-function","display_name":"Sublinear function","score":0.7634000182151794},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5390999913215637},{"id":"https://openalex.org/keywords/variety","display_name":"Variety (cybernetics)","score":0.5351999998092651},{"id":"https://openalex.org/keywords/series","display_name":"Series (stratigraphy)","score":0.4778999984264374},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4171999990940094},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.3833000063896179}],"concepts":[{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.7634000182151794},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5464000105857849},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5390999913215637},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.5351999998092651},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.48080000281333923},{"id":"https://openalex.org/C143724316","wikidata":"https://www.wikidata.org/wiki/Q312468","display_name":"Series (stratigraphy)","level":2,"score":0.4778999984264374},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47620001435279846},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4417000114917755},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4171999990940094},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.3833000063896179},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3714999854564667},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.32350000739097595},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.32100000977516174},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.3179999887943268},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3057999908924103},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.28940001130104065},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.26499998569488525},{"id":"https://openalex.org/C104267543","wikidata":"https://www.wikidata.org/wiki/Q208163","display_name":"Signal processing","level":3,"score":0.2515999972820282}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2607.00204","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.00204","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2607.00204","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.00204","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"A":[0],"suffixient":[1,41],"array":[2,42],"is":[3,57,91],"a":[4,18,25,39,106],"novel":[5],"data":[6],"structure":[7],"that,":[8],"when":[9,89],"combined":[10],"with":[11],"an":[12,97],"index":[13],"providing":[14],"direct":[15],"access":[16],"on":[17],"text":[19],"$T$,":[20],"allows":[21],"us":[22],"to":[23,37],"answer":[24],"variety":[26],"of":[27,61,70,73,77,108],"pattern":[28],"matching":[29],"queries.":[30],"In":[31],"this":[32],"work,":[33],"we":[34],"show":[35],"how":[36],"compute":[38],"smallest":[40],"for":[43,51],"$T[1\\dots":[44],"n]$":[45],"in":[46],"$O(\\frac{n\\log":[47],"\u03c3}{\\sqrt{\\log":[48],"n}}+\\min(r,\\bar{r})\\log^\u03b5n)$":[49],"time":[50,85],"any":[52],"$\u03b5>":[53],"0$,":[54],"where":[55],"$\u03c3$":[56,90],"the":[58,68,74],"alphabet":[59],"size":[60],"$T$":[62,78],"and":[63,65,79,94],"$r$":[64],"$\\bar{r}$":[66],"are":[67],"numbers":[69],"equal-letter":[71],"runs":[72],"Burrows-Wheeler":[75],"transforms":[76],"its":[80],"reverse":[81],"$\\overline{T}$,":[82],"respectively.":[83],"This":[84],"complexity":[86],"becomes":[87],"sublinear":[88],"small":[92],"enough":[93],"$\\min(r,\\bar{r})=o(\\frac{n}{\\log^\u03b5n})$,":[95],"yielding":[96],"asymptotic":[98],"improvement":[99],"over":[100],"state-of-the-art":[101],"algorithms.":[102],"We":[103],"also":[104],"present":[105],"series":[107],"connected":[109],"algorithmic":[110],"results.":[111]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-03T00:00:00"}