An Automaton for Motifs Recognition in DNA Sequences
In this paper we present a new algorithm to find inexact motifs (which are transformed into a set of exact subsequences) from a DNA sequence. Our algorithm builds an automaton that searches for the set of exact subsequences in the DNA database (that can be very long). It starts with a preprocessing phase in which it builds the finite automaton, in this phase it also considers the case in which two different subsequences share a substring (in other words, the subsequences might overlap), this is implemented in a similar way as the KMP algorithm. During the searching phase, the algorithm recognizes all instances in the set of input subsequences that appear in the DNA sequence. The automaton is able to perform the search phase in linear time with respect to the dimension of the input sequence. Experimental results show that the proposed algorithm performs better than the Aho-Corasick algorithm, which has been proved to perform better than the naive approach, even more; it is considered to run in linear time.
Unable to display preview. Download preview PDF.
- 1.Gusfiled, D.: Algorithms on Strings, Trees, and Sequences. Computer Science and Computational Biology. Cambridge University Press, Cambridge (1994)Google Scholar
- 3.Schmollinger, M., et al.: ParSeq: Searching motifs with Structural and Biochemical Properties. Bioinformatics Applications Note 20(9), 1459–1461 (2004)Google Scholar
- 4.Baeza-Yates, R., Gonnet, G.H.: A New Approach to Text Searching. Comunications of the ACM 35(10) (1994)Google Scholar
- 7.Aluru, S.: Handbook of Computational Molecular Biology. Champan & All/Crc Computer and Information Science Series (2005) ISBN 1584884061Google Scholar