Faster repetition-aware compressed suffix trees based on block trees

DOI10.1007/978-3-030-32686-9_31zbMATH Open1539.68082MaRDI QIDQ6536270

Manuel O. Cáceres, Gonzalo Navarro

Publication date: 19 April 2024

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On compressing and indexing repetitive sequences
• Replacing suffix trees with enhanced suffix arrays
• Faster entropy-bounded compressed suffix trees
• Practical compressed suffix trees
• On-line construction of suffix trees
• Compressed suffix trees with full functionality
• Fully Functional Static and Dynamic Succinct Trees
• Succinct Representations of Ordinal Trees
• Indexing Highly Repetitive Collections
• Suffix Arrays: A New Method for On-Line String Searches
• The string B-tree
• Fully compressed suffix trees
• Space-Efficient Frameworks for Top- k String Retrieval
• A Space-Economical Suffix Tree Construction Algorithm
• On the Complexity of Finite Sequences
• Algorithms on Strings, Trees and Sequences
• New text indexing functionalities of the compressed suffix arrays
• Grammar-based codes: a new class of universal lossless source codes
• Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
• Faster Compressed Suffix Trees for Repetitive Collections

This page was built for publication: Faster repetition-aware compressed suffix trees based on block trees