 |
HAL UPEC - UPEM Portal |  |
 |
Indexing a sequence for mapping reads with a single mismatch
Abstract : Mapping reads against a genome sequence is an interesting and useful problem in Computational Molecular Biology and Bioinformatics. In this paper, we focus on the problem of indexing a sequence for mapping reads with a single mismatch. We first focus on a simpler problem where the length of the pattern is given beforehand during the data structure construction. This version of the problem is interesting in its own right in the context of the Next Generation Sequencing (NGS). In the sequel we show how to solve the more general problem. In both cases, our algorithm can construct an efficient data structure in O(n log^(1+ε)n) time and space and can answer subsequent queries in O(m log log n + K) time. Here, n is the length of the sequence, m is the length of the read, 0 < ε < 1 and K is the optimal output size.
Cited literature [54 references]
https://hal-upec-upem.archives-ouvertes.fr/hal-01375933
Contributor : Admin Upem <>
Submitted on : Monday, October 3, 2016 - 6:38:16 PM
Last modification on : Wednesday, February 26, 2020 - 7:06:07 PM
Document(s) archivé(s) le : Friday, February 3, 2017 - 2:01:23 PM
Contributor : Admin Upem <>
Submitted on : Monday, October 3, 2016 - 6:38:16 PM
Last modification on : Wednesday, February 26, 2020 - 7:06:07 PM
Document(s) archivé(s) le : Friday, February 3, 2017 - 2:01:23 PM
File
CrochemoreLangiuRahman2014.pdf
Files produced by the author(s)
