Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Gusfiled, D.: Algorithms on Strings, Trees, and Sequences. Computer Science and Computational Biology. Cambridge University Press, Cambridge (1994)
Navarro, G.: A Guide Tour to Approximate String Matching. ACM Computing Surveys 33(1), 31–88 (2001)
Schmollinger, M., et al.: ParSeq: Searching motifs with Structural and Biochemical Properties. Bioinformatics Applications Note 20(9), 1459–1461 (2004)
Baeza-Yates, R., Gonnet, G.H.: A New Approach to Text Searching. Comunications of the ACM 35(10) (1994)
Boyer, R.S., et al.: A Fast String Searching Algorithm. Communications of the ACM 20(10), 726–772 (1977)
Crochemore, M., et al.: Algorithms on Strings. Cambridge University Press, Cambridge (2001)
Aluru, S.: Handbook of Computational Molecular Biology. Champan & All/Crc Computer and Information Science Series (2005) ISBN 1584884061
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Perez, G., Mejia, Y.P., Olmos, I., Gonzalez, J.A., Sánchez, P., Vázquez, C. (2009). An Automaton for Motifs Recognition in DNA Sequences. In: Aguirre, A.H., Borja, R.M., Garciá, C.A.R. (eds) MICAI 2009: Advances in Artificial Intelligence. MICAI 2009. Lecture Notes in Computer Science(), vol 5845. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-05258-3_49
Download citation
DOI: https://doi.org/10.1007/978-3-642-05258-3_49
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05257-6
Online ISBN: 978-3-642-05258-3
eBook Packages: Computer ScienceComputer Science (R0)