Tighter bounds for the sum of irreducible LCP values
From MaRDI portal
(Redirected from Publication:507409)
Recommendations
Cites work
- scientific article; zbMATH DE number 1052006 (Why is no real title available?)
- Algorithm Theory - SWAT 2004
- An extension of the Burrows-Wheeler transform
- Bioinformatics algorithms. Sequence analysis, genome rearrangements, and phylogenetic reconstruction
- Burrows-Wheeler transformations and de Bruijn words
- Compressed representations of sequences and full-text indexes
- Compressed suffix trees, efficient computation and storage of LCP-values
- Computing the Burrows-Wheeler transform of a string and its reverse in parallel
- Fixed point theorems for the generalized \(\Psi\)-set contraction mapping on an abstract convex space
- Permuted Longest-Common-Prefix Array
- Replacing suffix trees with enhanced suffix arrays
- Sampled Longest Common Prefix Array
- Suffix Arrays: A New Method for On-Line String Searches
- Uniqueness Theorems for Periodic Functions
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)