Approximate All-Pairs Suffix/Prefix Overlaps
From MaRDI portal
Publication:3575238
DOI10.1007/978-3-642-13509-5_8zbMath1286.68535OpenAlexW1582906780MaRDI QIDQ3575238
Veli Mäkinen, Niko Välimäki, Susana Ladra
Publication date: 26 July 2010
Published in: Combinatorial Pattern Matching (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-13509-5_8
Related Items (6)
Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance ⋮ Approximate all-pairs suffix/prefix overlaps ⋮ Computational graph pangenomics: a tutorial on data structures and their applications ⋮ Computing the Burrows-Wheeler transform of a string and its reverse in parallel ⋮ Linear-time computation of prefix table for weighted strings {\&} applications ⋮ Computing the multi-string BWT and LCP array in external memory
This page was built for publication: Approximate All-Pairs Suffix/Prefix Overlaps
