Wee LCP

DOI10.1016/j.ipl.2010.02.010zbMath1211.68129OpenAlexW2911967969MaRDI QIDQ991794

Johannes Fischer

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

zbMATH Keywords

data structurescompressed data structuressuffix arraystext indexinglongest common prefixes

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (10)

Succinct 2D dictionary matching ⋮ Variations of the parameterized longest previous factor ⋮ Parameterized longest previous factor ⋮ Fast relative Lempel-Ziv self-index for similar sequences ⋮ Practical compressed suffix trees ⋮ Burrows-Wheeler transform and LCP array construction in constant space ⋮ Combined data structure for previous- and next-smaller-values ⋮ Locally Compressed Suffix Arrays ⋮ Structural Pattern Matching - Succinctly. ⋮ Faster Compressed Suffix Trees for Repetitive Collections

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

This page was built for publication: Wee LCP