Abstract
We present in this paper an exact algorithm for motif extraction. Efficiency is achieved by means of an improvement in the algorithm and data structures that applies to the whole class of motif inference algorithms based on suffix trees. An average case complexity analysis shows a gain over the best known exact algorithm for motif extraction. A full implementation was developed and made available online. Experimental results show that the proposed algorithm is more than two times faster than the best known exact algorithm for motif extraction.
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
Allali, J.: Structures d’indexation: les arbres des facteurs. Memoire de maitrise, University of Marne-la-Vallée (2000)
Carvalho, A.M., Freitas, A.T., Oliveira, A.L., Sagot, M.-F.: A highly scalable algorithm for the extraction of cis-regulatory regions. In: Proc. APBC 2005, pp. 273–282. Imperial College Press (2005)
Guha-Thakurta, D., Stormo, G.D.: Identifying target sites for cooperatively binding factors. Bioinformatics 17, 608–621 (2001)
Lothaire, M.: Applied Combinatorics on words. Cambridge University Press, Cambridge (2005)
Marsan, L., Sagot, M.-F.: Algorithms for extracting structured motifs using a suffix tree with application to promoter and regulatory consensus identification. J. Comp. Bio. 7, 345–360 (2001)
Pevzner, P.A., Sze, S.H.: Combinatorial algorithm for finding subtle signals in dna sequences. In: Proc. ISMB 2000, pp. 269–278 (2000)
Sagot, M.-F.: Spelling Approximate repeated or common motifs using a suffix tree. In: Lucchesi, C.L., Moura, A.V. (eds.) LATIN 1998. LNCS, vol. 1380, pp. 111–127. Springer, Heidelberg (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pisanti, N., Carvalho, A.M., Marsan, L., Sagot, MF. (2006). RISOTTO: Fast Extraction of Motifs with Mismatches. In: Correa, J.R., Hevia, A., Kiwi, M. (eds) LATIN 2006: Theoretical Informatics. LATIN 2006. Lecture Notes in Computer Science, vol 3887. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11682462_69
Download citation
DOI: https://doi.org/10.1007/11682462_69
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32755-4
Online ISBN: 978-3-540-32756-1
eBook Packages: Computer ScienceComputer Science (R0)