Extracting the sparse longest common prefix array from the suffix binary search tree

DOI10.1007/978-3-030-86692-1_12MaRDI QIDQ2146135zbMATH OpenOpenAlexFDO

Authors Robert W. Irving, Dominik Köppl, Lorna Love, Tomohiro I

Publication date 15 June 2022

Full work available at URL https://doi.org/10.1007/978-3-030-86692-1_12

zbMATH Keywords

Euler tourlongest common prefixessparse suffix sortingsuffix binary search tree

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10)

Cites work

• Deterministic Sparse Suffix Sorting in the Restore Model
• Faster sparse suffix sorting
• Geometric BWT: compressed text indexing via sparse suffixes and range searching
• In-place sparse suffix sorting
• LCP array construction using \(O(\operatorname{sort}(n))\) (or less) I/Os
• Locally Consistent Parsing for Text Indexing in Small Space
• Sparse and truncated suffix trees on variable-length codes
• Sparse suffix trees
• Sparse text indexing in small space
• Suffix Arrays on Words
• Suffix Arrays: A New Method for On-Line String Searches
• The suffix binary search tree and suffix AVL tree

Describes a project that uses

Uses Software

• essaMEM

This page was built for publication: Extracting the sparse longest common prefix array from the suffix binary search tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2146135)