Abstract
Transcription factors control transcription by binding to specific sites in the DNA sequences of the target genes, which can be modeled by structured motifs. In this paper, we propose e-BiMotif, a combination of both sequence alignment and a biclustering approach relying on efficient string matching techniques based on suffix trees to unravel all approximately conserved blocks (structured motifs) while straightforwardly disregarding non-conserved regions in-between. Since the length of conserved regions is usually easier to estimate than that of non-conserved regions separating the binding sites, ignoring the width of non-conserved regions is an advantage of the proposed method over other motif finders.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Buhler, J., Tompa, M.: Finding motifs using random projections. Journal of Computational Biology 9(2), 225–242 (2002)
Carvalho, A., Freitas, A., Oliveira, A., Sagot, M.F.: An efficient algorithm for the identification of structured motifs in DNA promoter sequences. IEEE/ACM Transactions on Computational Biology and Bioinformatics 3(2), 126–140 (2006)
Eskin, E., Pevzner, P.: Finding composite regulatory patterns in DNA sequences. Bioinformatics 18(Sup. I), S354–S363 (2002)
Madeira, S., Oliveira, A.: An efficient biclustering algorithm for finding genes with similar patterns in time-series expression data. Algorithms in Molecular Biology 4, 8 (2009)
Marsan, L., Sagot, M.F.: Extracting structured motifs using a suffix tree - algorithms and application to promoter consensus identification. Journal of Computational Biology 7, 345–354 (2000)
Mendes, N., Casimiro, A., Santos, P., Sá-Correia, I., Oliveira, A., Freitas, A.: MUSA: a parameter free algorithm for the identification of biologically significant motifs. Bioinformatics 22(24), 2996–3002 (2006)
Prelic̀, A., Bleuler, S., Zimmermann, P., Wille, A., Bühlmann, P., Gruissem, W., Hennig, L., Thiele, L., Zitzler, E.: A systematic comparison and evaluation of biclustering methods for gene expression data. Bioinformatics 22(9), 1122–1129 (2006)
Thakurta, D., Stormo, G.: Identifying target sites for cooperatively binding factors. Bioinformatics 17(7), 608–621 (2001)
Wang, S., Gutell, R., Miranker, P.: Biclustering as a method for RNA local multiple sequence alignment. Bioinformatics 23(24), 3289–3296 (2007)
Zhang, Y., Zaki, M.: EXMOTIF: efficient structured motif extraction. Algorithms for Molecular Biology 1(21), 126–140 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gonçalves, J.P., Madeira, S.C. (2010). e-BiMotif: Combining Sequence Alignment and Biclustering to Unravel Structured Motifs. In: Rocha, M.P., Riverola, F.F., Shatkay, H., Corchado, J.M. (eds) Advances in Bioinformatics. Advances in Intelligent and Soft Computing, vol 74. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13214-8_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-13214-8_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13213-1
Online ISBN: 978-3-642-13214-8
eBook Packages: EngineeringEngineering (R0)