Wee LCP
From MaRDI portal
Publication:991794
DOI10.1016/j.ipl.2010.02.010zbMath1211.68129MaRDI QIDQ991794
Publication date: 7 September 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2010.02.010
68P05: Data structures
Related Items
Structural Pattern Matching - Succinctly., Faster Compressed Suffix Trees for Repetitive Collections, Parameterized longest previous factor, Burrows-Wheeler transform and LCP array construction in constant space, Combined data structure for previous- and next-smaller-values, Practical compressed suffix trees, Variations of the parameterized longest previous factor, Succinct 2D dictionary matching, Fast relative Lempel-Ziv self-index for similar sequences, Locally Compressed Suffix Arrays
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simple storage scheme for strings achieving entropy bounds
- Replacing suffix trees with enhanced suffix arrays
- Faster entropy-bounded compressed suffix trees
- Suffix trays and suffix trists: structures for faster text indexing
- Compressed suffix trees with full functionality
- Optimal lower bounds for rank and select indexes
- Compressed representations of sequences and full-text indexes
- Suffix Arrays: A New Method for On-Line String Searches
- An analysis of the Burrows—Wheeler transform
- Indexing compressed text
- Squeezing succinct data structures into entropy bounds
- Permuted Longest-Common-Prefix Array
- Algorithms on Strings, Trees and Sequences
- New text indexing functionalities of the compressed suffix arrays
- Statistical Encoding of Succinct Data Structures
- Algorithm Theory - SWAT 2004
- Fully-Compressed Suffix Trees