 |
HAL UPEC - UPEM Portal |  |
 |
Conference papers
Improved Filters for the Approximate Suffix-Prefix Overlap Problem
Abstract : Computing suffix-prefix overlaps for a large collection of strings is a fundamental building block for the analysis of genomic next-generation sequencing data. The approximate suffix-prefix overlap problem is to find all pairs of strings from a given set such that a prefix of one string is similar to a suffix of the other. Välimäki et al. (Information and Com-putation, 2012) gave a solution to this problem based on suffix filters. In this work, we propose two improvements to the method of Välimäki et al. that reduce the running time of the computation.
Cited literature [14 references]
https://hal-upec-upem.archives-ouvertes.fr/hal-01086208
Contributor : Admin Ligm <>
Submitted on : Sunday, November 23, 2014 - 9:52:20 AM
Last modification on : Wednesday, February 26, 2020 - 7:06:07 PM
Document(s) archivé(s) le : Tuesday, February 24, 2015 - 10:24:35 AM
Contributor : Admin Ligm <>
Submitted on : Sunday, November 23, 2014 - 9:52:20 AM
Last modification on : Wednesday, February 26, 2020 - 7:06:07 PM
Document(s) archivé(s) le : Tuesday, February 24, 2015 - 10:24:35 AM
File
Kucherov-Tsur-overlaps.pdf
Files produced by the author(s)
