Inducing the LCP-Array
From MaRDI portal
Publication:5199258
DOI10.1007/978-3-642-22300-6_32zbMath1342.68108OpenAlexW1583827615WikidataQ56485248 ScholiaQ56485248MaRDI QIDQ5199258
Publication date: 12 August 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22300-6_32
Related Items (15)
Circular Sequence Comparison with q-grams ⋮ Optimal suffix sorting and LCP array construction for constant alphabets ⋮ Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance ⋮ Longest Common Prefix with Mismatches ⋮ Fast circular dictionary-matching algorithm ⋮ Longest Common Subsequence in at Least k Length Order-Isomorphic Substrings ⋮ Searching and Indexing Circular Patterns ⋮ Burrows-Wheeler transform and LCP array construction in constant space ⋮ Inducing enhanced suffix arrays for string collections ⋮ Alignment-free sequence comparison using absent words ⋮ Faster algorithms for 1-mappability of a sequence ⋮ Popping Superbubbles and Discovering Clumps: Recent Developments in Biological Sequence Analysis ⋮ Dichotomic Selection on Words: A Probabilistic Analysis ⋮ Inducing Suffix and LCP Arrays in External Memory ⋮ LCP Array Construction in External Memory
This page was built for publication: Inducing the LCP-Array
