Sparse and truncated suffix trees on variable-length codes

DOI10.1007/978-3-642-21458-5_22MaRDI QIDQ3011859zbMATH OpenOpenAlexFDO

Authors Takashi Uemura, Hiroki Arimura

Publication date 29 June 2011

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-21458-5_22

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Online algorithms; streaming algorithms (68W27) Prefix, length-variable, comma-free codes (94A45)

Recommendations

• Sparse suffix tree construction in small space
• Suffix trees on words
• Truncated suffix trees and their application to data compression.
• On-Line Linear-Time Construction of Word Suffix Trees
• On-line construction of suffix trees

Cites work

• A Space-Economical Suffix Tree Construction Algorithm
• Algorithms on Strings, Trees and Sequences
• scientific article; zbMATH DE number 1786458 (Why is no real title available?)
• Jewels of Stringology
• On-line construction of suffix trees
• On-Line Linear-Time Construction of Word Suffix Trees
• Property Matching and Weighted Matching
• Replacing suffix trees with enhanced suffix arrays
• Suffix Arrays on Words
• Suffix trees on words
• Truncated suffix trees and their application to data compression.

Cited in

(3)

• Extracting the sparse longest common prefix array from the suffix binary search tree
• Space-efficient representation of truncated suffix trees, with applications to Markov order estimation
• Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing

This page was built for publication: Sparse and truncated suffix trees on variable-length codes

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