Multi-patterns parameterised matching with application to computational biology
by Swati Tevatia; Rajesh Prasad
International Journal of Information and Communication Technology (IJICT), Vol. 7, No. 4/5, 2015

Abstract: In the multi-pattern parameterised string matching problem, we are given a text T and pattern set P = {p1, p2, , pn{. The pattern pi, 1 ≤ i ≤ n, matches a substring t of the text T, if characters of the pattern pi can be transformed into the characters of the substring t with some bijective mapping. This problem has important application in computational biology, where two trends of DNA can be matched with some one-to-one mapping even they are not exactly same. In 2008, Salmela and Tarhio developed a fast parameterised Boyer-Moore-Horspool with hash algorithm, but it is unable to handle multiple patterns simultaneously. In this paper, we extend this algorithm for simultaneously searching the presence of more than one pattern in a large DNA text. Experimental results show that our algorithm is very fast in practice.

Online publication date: Thu, 02-Jul-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Information and Communication Technology (IJICT):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your 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