Tighter bounds for the sum of irreducible LCP values
DOI10.1016/J.TCS.2015.12.009zbMATH Open1356.68055OpenAlexW2295856663MaRDI QIDQ507409FDOQ507409
Authors: Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski 
Publication date: 6 February 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.12.009
Recommendations
Information storage and retrieval of data (68P20) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Combinatorics on words (68R15)
Cites Work
- Title not available (Why is that?)
- Compressed representations of sequences and full-text indexes
- Suffix Arrays: A New Method for On-Line String Searches
- Uniqueness Theorems for Periodic Functions
- Permuted Longest-Common-Prefix Array
- Bioinformatics algorithms. Sequence analysis, genome rearrangements, and phylogenetic reconstruction
- An extension of the Burrows-Wheeler transform
- Replacing suffix trees with enhanced suffix arrays
- Algorithm Theory - SWAT 2004
- Computing the Burrows-Wheeler transform of a string and its reverse in parallel
- Sampled Longest Common Prefix Array
- Compressed suffix trees, efficient computation and storage of LCP-values
- Fixed point theorems for the generalized \(\Psi\)-set contraction mapping on an abstract convex space
- Burrows-Wheeler transformations and de Bruijn words
Cited In (3)
This page was built for publication: Tighter bounds for the sum of irreducible LCP values
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q507409)
