Fully compressed suffix trees

DOI10.1145/2000807.2000821MaRDI QIDQ3189038zbMATH OpenOpenAlexWikidataFDO

Authors 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

compressed indexdata compressionpattern matchingstring algorithmssuffix treetext processing

Mathematics Subject Classification ID

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

Recommendations

• Dynamic Fully-Compressed Suffix Trees
• Fully-Compressed Suffix Trees
• Compressed suffix trees, efficient computation and storage of LCP-values
• Compressed suffix trees with full functionality
• Faster entropy-bounded compressed suffix trees

Cited in

(32)

• Faster entropy-bounded compressed suffix trees
• Practical compressed suffix trees
• The exact multiple pattern matching problem solved by a reference tree approach
• Ranked document selection
• Geometric BWT: compressed text indexing via sparse suffixes and range searching
• Succinct 2D dictionary matching
• Compressed suffix trees with full functionality
• Faster repetition-aware compressed suffix trees based on block trees
• Compressed string dictionary search with edit distance one
• Locally compressed suffix arrays
• Compressed Cache-Oblivious String B-tree
• Linear-size suffix tries
• Time-optimal top-k document retrieval
• The longest common substring problem
• Dynamic Fully-Compressed Suffix Trees
• Multi-pattern matching with bidirectional indexes
• Cross-document pattern matching
• scientific article; zbMATH DE number 2081033 (Why is no real title available?)
• Efficient fully-compressed sequence representations
• Tree path majority data structures
• Structural Pattern Matching - Succinctly.
• Fast label extraction in the CDAWG
• Compressed suffix trees, efficient computation and storage of LCP-values
• Faster compressed suffix trees for repetitive collections
• Bidirectional Variable-Order de Bruijn Graphs
• Engineering a compressed suffix tree implementation
• Fully-Compressed Suffix Trees
• Faster repetition-aware compressed suffix trees based on block trees
• Wheeler maps
• Computing MEMs and relatives on repetitive text collections
• Lempel-Ziv-78 compressed string dictionaries
• Tree path majority data structures

This page was built for publication: Fully compressed suffix trees

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