Sparse suffix trees

DOI10.1007/3-540-61332-3_155zbMath1529.68088OpenAlexW1548907175WikidataQ56485242 ScholiaQ56485242MaRDI QIDQ6184666

Juha Kärkkäinen, Esko Ukkonen

Publication date: 29 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61332-3_155

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) Data structures (68P05)

Related Items (2)

Extracting the sparse longest common prefix array from the suffix binary search tree ⋮ Geometric BWT: compressed text indexing via sparse suffixes and range searching

Cites Work

• Unnamed Item
• Improved behaviour of tries by adaptive branching
• On-line construction of suffix trees
• Suffix Arrays: A New Method for On-Line String Searches
• Self-alignments in words and their applications
• A Space-Economical Suffix Tree Construction Algorithm
• Fast Pattern Matching in Strings

This page was built for publication: Sparse suffix trees