Computing the longest common prefix array based on the Burrows-Wheeler transform
DOI10.1016/J.JDA.2012.07.007zbMATH Open1267.68322OpenAlexW2042175004MaRDI QIDQ2376799FDOQ2376799
Authors: Timo Beller, Simon Gog, Enno Ohlebusch, Thomas Schnattinger 
Publication date: 24 June 2013
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2012.07.007
Recommendations
wavelet treeBurrows-Wheeler transformshortest absent wordslongest common prefix arrayshortest unique substrings
Protein sequences, DNA sequences (92D20) Combinatorics on words (68R15) Algorithms on strings (68W32)
Cited In (15)
- Space-Time Tradeoffs for Longest-Common-Prefix Array Computation
- Edge minimization in de Bruijn graphs
- LCP array construction in external memory
- Space-efficient computation of the LCP array from the Burrows-Wheeler transform
- The colored longest common prefix array computed via sequential scans
- Longest common prefix with mismatches
- Lightweight LCP construction for very large collections of strings
- Permuted Longest-Common-Prefix Array
- Sampled Longest Common Prefix Array
- Better external memory LCP array construction
- Space-efficient construction of compressed suffix trees
- Efficient construction of a compressed de Bruijn graph for pan-genome analysis
- Faster lightweight Lempel-Ziv parsing
- Burrows-Wheeler transform and LCP array construction in constant space
- Longest common prefix arrays for succinct \(k\)-spectra
This page was built for publication: Computing the longest common prefix array based on the Burrows-Wheeler transform
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2376799)
