Sparse and Truncated Suffix Trees on Variable-Length Codes

DOI10.1007/978-3-642-21458-5_22zbMath1339.68154OpenAlexW2106946062MaRDI QIDQ3011859

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) Prefix, length-variable, comma-free codes (94A45) Online algorithms; streaming algorithms (68W27)

Related Items (2)

Extracting the sparse longest common prefix array from the suffix binary search tree ⋮ Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing

Cites Work

• Unnamed Item
• Replacing suffix trees with enhanced suffix arrays
• Suffix trees on words
• Truncated suffix trees and their application to data compression.
• On-line construction of suffix trees
• Suffix Arrays on Words
• A Space-Economical Suffix Tree Construction Algorithm
• Algorithms on Strings, Trees and Sequences
• Jewels of Stringology
• On-Line Linear-Time Construction of Word Suffix Trees
• Property Matching and Weighted Matching

This page was built for publication: Sparse and Truncated Suffix Trees on Variable-Length Codes