Indexing a sequence for mapping reads with a single mismatch

Maxime Crochemore (1, 2) , Alessio Langiu (3, 1) , M. Sohel Rahman (1)

1 Department of Computer Science [London]
2 LIGM - Laboratoire d'Informatique Gaspard-Monge
3 DEIM - Dipartimento di Energia, ingegneria dell'Informazione e modelli Matematici [Palermo]

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.

Mots clés: algorithms; genome sequence; indexing; mapping reads; mismatch; pattern matching

Domaines: Bio-informatique [q-bio.QM]; Algorithme et structure de données [cs.DS]

Maxime Crochemore, Alessio Langiu, M. Sohel Rahman. Indexing a sequence for mapping reads with a single mismatch. Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 2014, 2 (20130167), pp.1-18. ⟨10.1098/rsta.2013.0167⟩. ⟨hal-01375933⟩