Two space saving tricks for linear time LCP array computation
From MaRDI portal
Recommendations
- Burrows-Wheeler transform and LCP array construction in constant space
- Space-Time Tradeoffs for Longest-Common-Prefix Array Computation
- Computing the BWT and the LCP array in constant space
- Linear-time longest-common-prefix computation in suffix arrays and its applications
- Low space external memory construction of the succinct permuted longest common prefix array
Cited in
(30)- Computing regularities in strings: a survey
- Variations of the parameterized longest previous factor
- Space-efficient construction of compressed suffix trees
- Computing the longest common prefix array based on the Burrows-Wheeler transform
- Computing the Burrows-Wheeler transform of a string and its reverse in parallel
- Computing the BWT and the LCP array in constant space
- Tighter bounds for the sum of irreducible LCP values
- Permuted Longest-Common-Prefix Array
- Efficient algorithms for three variants of the LPF table
- On the number of elements to reorder when updating a suffix array
- Parameterized longest previous factor
- Linear-time longest-common-prefix computation in suffix arrays and its applications
- Better external memory LCP array construction
- Tighter bounds for the sum of irreducible LCP values
- Space-efficient computation of the LCP array from the Burrows-Wheeler transform
- Dichotomic Selection on Words: A Probabilistic Analysis
- External memory BWT and LCP computation for sequence collections with applications
- Burrows-Wheeler transform and LCP array construction in constant space
- Lightweight BWT and LCP merging via the gap algorithm
- Inducing the LCP-array
- Fast and Lightweight LCP-Array Construction Algorithms
- Inducing suffix and LCP arrays in external memory
- LCP array construction in external memory
- Inducing enhanced suffix arrays for string collections
- Fast, practical algorithms for computing all the repeats in a string
- Inducing the Lyndon array
- Longest common prefix arrays for succinct \(k\)-spectra
- Space-time trade-offs for the LCP array of Wheeler DFAs
- Exploiting new properties of string net frequency for efficient computation
- Wee LCP
This page was built for publication: Two space saving tricks for linear time LCP array computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5315389)