An(other) Entropy-Bounded Compressed Suffix Tree

DOI10.1007/978-3-540-69068-9_16MaRDI QIDQ3506950zbMATH OpenOpenAlexFDO

Authors Johannes Fischer, Veli Mäkinen, Gonzalo Navarro

Publication date 17 June 2008

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

Full work available at URL http://hdl.handle.net/10138/1169

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Faster entropy-bounded compressed suffix trees
• Compressed suffix trees with full functionality
• Fully-Compressed Suffix Trees
• Practical compressed suffix trees
• Dynamic Fully-Compressed Suffix Trees

Cited in

(13)

• Tight upper and lower bounds on suffix tree breadth
• Practical compressed suffix trees
• Faster entropy-bounded compressed suffix trees
• An estimation of the size of non-compact suffix trees
• A Comparison of Empirical Tree Entropies
• Extended suffix array construction using Lyndon factors
• Permuted Longest-Common-Prefix Array
• On space efficient two dimensional range minimum data structures
• Approximate string matching with compressed indexes
• Quantum data structure for range minimum query
• Compressed suffix trees with full functionality
• Dynamic Fully-Compressed Suffix Trees
• Finding range minima in the middle: approximations and applications

This page was built for publication: An(other) Entropy-Bounded Compressed Suffix Tree

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