Sparse suffix trees

DOI10.1007/3-540-61332-3_155MaRDI QIDQ6184666zbMATH OpenOpenAlexDBLPWikidataFDO

Authors 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

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

Recommendations

• Sparse suffix tree construction in small space
• Sparse text indexing in small space
• Sparse suffix tree construction in optimal time and space
• Space efficient suffix trees
• On-Line Linear-Time Construction of Word Suffix Trees

Cites work

• A Space-Economical Suffix Tree Construction Algorithm
• Fast Pattern Matching in Strings
• scientific article; zbMATH DE number 3913711 (Why is no real title available?)
• Improved behaviour of tries by adaptive branching
• On-line construction of suffix trees
• Self-alignments in words and their applications
• Suffix Arrays: A New Method for On-Line String Searches

Cited in

(5)

• Extracting the sparse longest common prefix array from the suffix binary search tree
• Geometric BWT: compressed text indexing via sparse suffixes and range searching
• Sparse suffix and LCP array: simple, direct, small, and fast
• Locally consistent parsing for text indexing in small space
• Sparse suffix and LCP array: simple, direct, small, and fast

This page was built for publication: Sparse suffix trees

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