Practical Linear-Time Computation of Smallest Suffixient Sets

[2606.31034] Practical Linear-Time Computation of Smallest Suffixient Sets Skip to main content Search Submit Donate Log in Computer Science > Data Structures and Algorithms arXiv:2606.31034 (cs) [Submitted on 30 Jun 2026 ( v1 ), last revised 21 Aug 2026 (this version, v2)] Title: Practical Linear-Time Computation of Smallest Suffixient Sets Authors: Francisco Olivares , Gonzalo Navarro View PDF HTML (experimental) Abstract: Suffixient arrays are recent structures that have attracted attention because they offer relevant pattern matching functionality in less asymptotic space than the Run-Length BWT, the de-facto standard to index highly repetitive string collections. Various algorithms exist for building them from the suffix array data structures. We present the first construction algorithm that is (i) linear-time, (ii) one-pass over the structures, and (iii) implemented and practical. This makes the construction particularly useful on large text collections, which we demonstrate empirically by showing that it dominates the space/time tradeoff map of the implemented constructions. Subjects: Data Structures and Algorithms (cs.DS) Cite as: arXiv:2606.31034 [cs.DS] (or arXiv:2606.31034v2 [cs.DS] for this version) https://doi.org/10.48550/arXiv.2606.31034 Focus to learn more arXiv-issued DOI via DataCite Submission history From: Francisco Olivares [ view email ] [v1] Tue, 30 Jun 2026 02:05:57 UTC (636 KB) [v2] Fri, 21 Aug 2026 20:44:05 UTC (679 KB) Full-text links: Access Paper: View PDF HTML (experimental) TeX Source view license Additional Features Audio Summary Current browse context: cs.DS < prev | next > new | recent | 2026-06 Change to browse by: cs References & Citations SciX Google Scholar Semantic Scholar export BibTeX citation Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer ( What is the Explorer? ) Connected Papers Toggle Connected Papers ( What is Connected Papers? ) Litmaps Toggle Litmaps ( What is Litmaps? ) scite.ai Toggle scite Smart Citations ( What are Smart Citations? ) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv ( What is alphaXiv? ) Links to Code Toggle CatalyzeX Code Finder for Papers ( What is CatalyzeX? ) DagsHub Toggle DagsHub ( What is DagsHub? ) GotitPub Toggle Gotit.pub ( What is GotitPub? ) Huggingface Toggle Hugging Face ( What is Huggingface? ) ScienceCast Toggle ScienceCast ( What is ScienceCast? ) Demos Demos Replicate Toggle Replicate ( What is Replicate? ) Spaces Toggle Hugging Face Spaces ( What is Spaces? ) Spaces Toggle TXYZ.AI ( What is TXYZ.AI? ) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower ( What are Influence Flowers? ) Core recommender toggle CORE Recommender ( What is CORE? ) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs . Which authors of this paper are endorsers? | Disable MathJax ( What is MathJax? ) We gratefully acknowledge support from our major funders , member institutions , and all contributors. About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab)

Related documents

• Practical Linear-Time Computation of Smallest Suffixient Sets#665834
• Asymptotically unit-rate storage codes from binary BCH codes#1157004
• The Inverse Lyndon Array#1049142
• Lower Bounds for all List-Decodable Deletion Codes#1062537
• A Triadic Suffix Tokenization Scheme for Numerical Reasoning#10351