{"id":"https://openalex.org/W7163896854","doi":"https://doi.org/10.4230/lipics.cpm.2026.30","title":"Constructing Suffixient Arrays Revisited","display_name":"Constructing Suffixient Arrays Revisited","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7163896854","doi":"https://doi.org/10.4230/lipics.cpm.2026.30"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25956","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2026.30","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol369-cpm2026/LIPIcs.CPM.2026.30/LIPIcs.CPM.2026.30.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,"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":"publishedVersion"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol369-cpm2026/LIPIcs.CPM.2026.30/LIPIcs.CPM.2026.30.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5126200288","display_name":"Paola Bonizzoni","orcid":null},"institutions":[{"id":"https://openalex.org/I66752286","display_name":"University of Milano-Bicocca","ror":"https://ror.org/01ynf4891","country_code":"IT","type":"education","lineage":["https://openalex.org/I66752286"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Bonizzoni, Paola","raw_affiliation_strings":["Department of Computer Science, University of Milano-Bicocca, Italy"],"raw_orcid":"https://orcid.org/0000-0001-7289-4988","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Milano-Bicocca, Italy","institution_ids":["https://openalex.org/I66752286"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071941755","display_name":"Younan Gao","orcid":"https://orcid.org/0000-0003-4984-2551"},"institutions":[{"id":"https://openalex.org/I66752286","display_name":"University of Milano-Bicocca","ror":"https://ror.org/01ynf4891","country_code":"IT","type":"education","lineage":["https://openalex.org/I66752286"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Gao, Younan","raw_affiliation_strings":["Department of Computer Science, University of Milano-Bicocca, Italy"],"raw_orcid":"https://orcid.org/0000-0003-4984-2551","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Milano-Bicocca, Italy","institution_ids":["https://openalex.org/I66752286"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063797606","display_name":"Brian Riccardi","orcid":"https://orcid.org/0000-0002-4925-9529"},"institutions":[{"id":"https://openalex.org/I66752286","display_name":"University of Milano-Bicocca","ror":"https://ror.org/01ynf4891","country_code":"IT","type":"education","lineage":["https://openalex.org/I66752286"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Riccardi, Brian","raw_affiliation_strings":["Department of Computer Science, University of Milano-Bicocca, Italy"],"raw_orcid":"https://orcid.org/0000-0002-4925-9529","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Milano-Bicocca, Italy","institution_ids":["https://openalex.org/I66752286"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.94567439,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"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.9958000183105469,"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.9958000183105469,"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.000699999975040555,"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/T10181","display_name":"Natural Language Processing Techniques","score":0.0003000000142492354,"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/suffix","display_name":"Suffix","score":0.7239999771118164},{"id":"https://openalex.org/keywords/suffix-array","display_name":"Suffix array","score":0.6704000234603882},{"id":"https://openalex.org/keywords/prefix","display_name":"Prefix","score":0.5651999711990356},{"id":"https://openalex.org/keywords/compressed-suffix-array","display_name":"Compressed suffix array","score":0.4805000126361847},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.48010000586509705},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4235000014305115},{"id":"https://openalex.org/keywords/suffix-tree","display_name":"Suffix tree","score":0.3797999918460846}],"concepts":[{"id":"https://openalex.org/C2779804580","wikidata":"https://www.wikidata.org/wiki/Q102047","display_name":"Suffix","level":2,"score":0.7239999771118164},{"id":"https://openalex.org/C2779259728","wikidata":"https://www.wikidata.org/wiki/Q281472","display_name":"Suffix array","level":3,"score":0.6704000234603882},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6133000254631042},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.5651999711990356},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5310999751091003},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.49799999594688416},{"id":"https://openalex.org/C100903775","wikidata":"https://www.wikidata.org/wiki/Q5157028","display_name":"Compressed suffix array","level":4,"score":0.4805000126361847},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.48010000586509705},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43479999899864197},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4235000014305115},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4133000075817108},{"id":"https://openalex.org/C2781166958","wikidata":"https://www.wikidata.org/wiki/Q1426863","display_name":"Suffix tree","level":3,"score":0.3797999918460846},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.3296999931335449},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.3292999863624573},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.32710000872612},{"id":"https://openalex.org/C200985842","wikidata":"https://www.wikidata.org/wiki/Q3375503","display_name":"Random permutation","level":3,"score":0.2971999943256378},{"id":"https://openalex.org/C101722063","wikidata":"https://www.wikidata.org/wiki/Q218825","display_name":"Random access","level":2,"score":0.29019999504089355},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2881999909877777},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28540000319480896},{"id":"https://openalex.org/C118146561","wikidata":"https://www.wikidata.org/wiki/Q5532514","display_name":"Generalized suffix tree","level":4,"score":0.2736999988555908},{"id":"https://openalex.org/C135598885","wikidata":"https://www.wikidata.org/wiki/Q1366302","display_name":"Row","level":2,"score":0.266400009393692},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.2597000002861023}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25956","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2026.30","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol369-cpm2026/LIPIcs.CPM.2026.30/LIPIcs.CPM.2026.30.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,"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":"publishedVersion"},{"id":"doi:10.4230/lipics.cpm.2026.30","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.cpm.2026.30","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25956","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2026.30","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol369-cpm2026/LIPIcs.CPM.2026.30/LIPIcs.CPM.2026.30.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,"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":"publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7163896854.pdf","grobid_xml":"https://content.openalex.org/works/W7163896854.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Recently,":[0],"Cenzato":[1],"et":[2],"al.":[3],"proposed":[4],"a":[5,15,24,71,93,132,138],"new":[6,133],"text":[7,41],"index,":[8],"called":[9],"the":[10,18,39,49,52,58,63,97,116,121,124,145],"suffixient":[11,72,139],"array,":[12,51,56],"which":[13],"is":[14,43,115],"subset":[16],"of":[17,62,65,87,118,123],"suffix":[19,50],"array":[20,73,140],"and":[21,57],"supports":[22],"locating":[23],"single":[25,94],"pattern":[26],"occurrence":[27],"or":[28],"finding":[29],"its":[30],"maximal":[31],"exact":[32],"matches":[33],"(MEMs),":[34],"assuming":[35],"random":[36],"access":[37],"to":[38,92],"input":[40],"T[1..n]":[42,66],"available.":[44],"They":[45],"show":[46],"that,":[47],"given":[48],"longest":[53],"common":[54],"prefix":[55],"Burrows-Wheeler":[59],"transform":[60],"(BWT)":[61],"reverse":[64],"over":[67,96],"an":[68,101],"alphabet":[69],"{1,\u2026,\u03c3},":[70],"can":[74],"be":[75],"constructed":[76],"in":[77,106,120,141],"linear":[78,142],"time.":[79],"However,":[80],"their":[81],"construction":[82,103],"algorithms":[83],"require":[84],"multiple":[85],"scans":[86],"these":[88],"arrays.":[89],"When":[90],"restricted":[91],"pass":[95],"arrays,":[98],"they":[99],"present":[100,131],"alternative":[102],"algorithm":[104,135],"running":[105],"O(n":[107],"+":[108],"r":[109,114],"log":[110],"\u03c3)":[111],"time,":[112],"where":[113],"number":[117],"runs":[119],"BWT":[122],"reversed":[125],"text.":[126],"In":[127],"this":[128],"paper,":[129],"we":[130],"one-pass":[134],"that":[136],"constructs":[137],"time":[143],"under":[144],"standard":[146],"RAM":[147],"model.":[148]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-06-09T00:00:00"}