LCP array construction in external memory
From MaRDI portal
Publication:5266615
DOI10.1145/2851491zbMATH Open1365.68183OpenAlexW2316621983MaRDI QIDQ5266615FDOQ5266615
Authors: Juha Kärkkäinen, Dominik Kempa 
Publication date: 16 June 2017
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2851491
Recommendations
- Better external memory LCP array construction
- Faster External Memory LCP Array Construction
- LCP array construction using \(O(\operatorname{sort}(n))\) (or less) I/Os
- Engineering external memory LCP array construction: parallel, in-place and large alphabet
- Low space external memory construction of the succinct permuted longest common prefix array
Cites Work
- Lazy Lempel-Ziv factorization algorithms
- Algorithms and data structures for external memory
- Compressed representations of sequences and full-text indexes
- Linear work suffix array construction
- Title not available (Why is that?)
- Suffix Arrays: A New Method for On-Line String Searches
- Permuted Longest-Common-Prefix Array
- Inducing the LCP-array
- Fast and Lightweight LCP-Array Construction Algorithms
- Two Efficient Algorithms for Linear Time Suffix Array Construction
- Bioinformatics algorithms. Sequence analysis, genome rearrangements, and phylogenetic reconstruction
- Title not available (Why is that?)
- Linear Time Suffix Array Construction Using D-Critical Substrings
- Replacing suffix trees with enhanced suffix arrays
- Lightweight data indexing and compression in external memory
- Algorithm Theory - SWAT 2004
- Space-Time Tradeoffs for Longest-Common-Prefix Array Computation
- Computing the longest common prefix array based on the Burrows-Wheeler transform
- Sampled Longest Common Prefix Array
- Lightweight LCP Construction for Next-Generation Sequencing Datasets
- External memory generalized suffix and LCP arrays construction
- Title not available (Why is that?)
- Better external memory suffix array construction
- Linear Time Lempel-Ziv Factorization: Simple, Fast, Small
- Parallel External Memory Suffix Sorting
- Tighter bounds for the sum of irreducible LCP values
- Engineering a lightweight external memory suffix array construction algorithm
- Inducing suffix and LCP arrays in external memory
Cited In (21)
- String inference from longest-common-prefix array
- Bidirectional Text Compression in External Memory
- Lightweight BWT and LCP merging via the gap algorithm
- Computing the multi-string BWT and LCP array in external memory
- LCP array construction using \(O(\operatorname{sort}(n))\) (or less) I/Os
- Low space external memory construction of the succinct permuted longest common prefix array
- Inducing suffix and LCP arrays in external memory
- External memory BWT and LCP computation for sequence collections with applications
- Lightweight merging of compressed indices based on BWT variants
- Engineering a lightweight external memory suffix array construction algorithm
- External memory generalized suffix and LCP arrays construction
- Inducing suffix and LCP arrays in external memory
- Engineering external memory LCP array construction: parallel, in-place and large alphabet
- Lightweight LCP construction for very large collections of strings
- Better external memory LCP array construction
- Fast and Lightweight LCP-Array Construction Algorithms
- Optimal suffix sorting and LCP array construction for constant alphabets
- Faster External Memory LCP Array Construction
- Faster compressed suffix trees for repetitive collections
- Burrows-Wheeler transform and LCP array construction in constant space
- Inducing the LCP-array
Uses Software
This page was built for publication: LCP array construction in external memory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5266615)
