Fast practical online exact single and multiple pattern matching algorithms in highly similar sequences Online publication date: Wed, 24-Apr-2019
by Nadia Ben Nsira; Thierry Lecroq; Élise Prieur-Gaston
International Journal of Data Mining and Bioinformatics (IJDMB), Vol. 22, No. 1, 2019
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Data Mining and Bioinformatics (IJDMB):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook