Fully compressed suffix trees

DOI10.1145/2000807.2000821zbMath1295.68103OpenAlexW2135208303WikidataQ58883957 ScholiaQ58883957MaRDI QIDQ3189038

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

Publication date: 9 September 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2000807.2000821

zbMATH Keywords

data compressionpattern matchingstring algorithmssuffix treecompressed indextext processing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Protein sequences, DNA sequences (92D20) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05) Algorithms on strings (68W32)

Related Items (20)

Compressed string dictionary search with edit distance one ⋮ Linear-size suffix tries ⋮ Bidirectional Variable-Order de Bruijn Graphs ⋮ Succinct 2D dictionary matching ⋮ Faster repetition-aware compressed suffix trees based on block trees ⋮ Multi-pattern matching with bidirectional indexes ⋮ Cross-document pattern matching ⋮ Time-Optimal Top-$k$ Document Retrieval ⋮ The longest common substring problem ⋮ Practical compressed suffix trees ⋮ Fast Label Extraction in the CDAWG ⋮ Unnamed Item ⋮ Lempel-Ziv-78 compressed string dictionaries ⋮ The exact multiple pattern matching problem solved by a reference tree approach ⋮ Ranked document selection ⋮ Locally Compressed Suffix Arrays ⋮ Tree path majority data structures ⋮ Geometric BWT: compressed text indexing via sparse suffixes and range searching ⋮ Structural Pattern Matching - Succinctly. ⋮ Faster Compressed Suffix Trees for Repetitive Collections

This page was built for publication: Fully compressed suffix trees