Dynamic Fully-Compressed Suffix Trees

DOI10.1007/978-3-540-69068-9_19MaRDI QIDQ3506953zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Luís M. S. Russo, Arlindo L. Oliveira, Gonzalo Navarro

Publication date 17 June 2008

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

Full work available at URL https://doi.org/10.1007/978-3-540-69068-9_19

Mathematics Subject Classification ID

Data structures (68P05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• Fully compressed suffix trees
• Fully-Compressed Suffix Trees
• Faster entropy-bounded compressed suffix trees
• Compressed suffix trees with full functionality
• An(other) Entropy-Bounded Compressed Suffix Tree

Cited in

(3)

• Fully compressed suffix trees
• An(other) Entropy-Bounded Compressed Suffix Tree
• Dynamic extended suffix arrays

This page was built for publication: Dynamic Fully-Compressed Suffix Trees

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