Fast practical online exact single and multiple pattern matching algorithms in highly similar sequences - Archive ouverte HAL Access content directly
Journal Articles International Journal of Data Mining and Bioinformatics Year : 2019

Fast practical online exact single and multiple pattern matching algorithms in highly similar sequences

Abstract

With the advent of high-throughput sequencing technologies there are more and more genomic sequences of individuals of the same species available. These sequences only differ by a very small amount of variations. There is thus a strong need for efficient algorithms for performing fast pattern matching in such specific sets of sequences. In this paper, we propose efficient practical algorithms that solve on-line exact pattern matching problem in a set of highly similar DNA sequences. We first present a method for exact single pattern matching when k variations are allowed in a window which size is equal to the pattern length. We then propose an algorithm for exact multiple pattern matching when only one variation is allowed in a window which size is equal to the length of the longest pattern. Experimental results show that our algorithms, though not optimal in the worst case, have good performances in practice.
Not file

Dates and versions

hal-02113316 , version 1 (28-04-2019)

Identifiers

Cite

Nadia Ben Nsira, Thierry Lecroq, Élise Prieur Gaston. Fast practical online exact single and multiple pattern matching algorithms in highly similar sequences. International Journal of Data Mining and Bioinformatics, 2019, 22 (1), pp.1. ⟨10.1504/IJDMB.2019.099285⟩. ⟨hal-02113316⟩
40 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More