Skip Navigation

This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow FREE Full Text (Screen PDF)
Right arrow Comments: Submit a response
Right arrow Alert me when this article is cited
Right arrow Alert me when Comments are posted
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Eskin, E.
Right arrow Articles by Pevzner, P. A.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Eskin, E.
Right arrow Articles by Pevzner, P. A.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bioinformatics Vol. 18 no. 90001 2002
Pages S354-S363
© 2002 Oxford University Press

Finding composite regulatory patterns in DNA sequences

Eleazar Eskin 1 and Pavel A. Pevzner 2

1 Department of Computer Science, Columbia University, New York, 10027 NY
2 Department of Computer Science and Engineering, University of California at San Diego, La Jolla 92093-0114, CA

Received on January 22, 2002 ; revised on April 1, 2002 ; accepted on April 1, 2002

Pattern discovery in unaligned DNA sequences is a fundamental problem in computational biology with important applications in finding regulatory signals. Current approaches to pattern discovery focus on monad patterns that correspond to relatively short contiguous strings. However, many of the actual regulatory signals are composite patterns that are groups of monad patterns that occur near each other. A difficulty in discovering composite patterns is that one or both of the component monad patterns in the group may be ‘too weak’. Since the traditional monad-based motif finding algorithms usually output one (or a few) high scoring patterns, they often fail to find composite regulatory signals consisting of weak monad parts. In this paper, we present a MITRA (MIsmatch TRee Algorithm) approach for discovering composite signals. We demonstrate that MITRA performs well for both monad and composite patterns by presenting experiments over biological and synthetic data.

Availability: MITRA is available at http://www.cs.columbia.edu/compbio/mitra/

Contact: eeskin{at}cs.columbia.edu

Keywords: regulatory motif finding; pattern finding; dyad motifs.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
Microbiol. Mol. Biol. Rev.Home page
S. A. F. T. van Hijum, M. H. Medema, and O. P. Kuipers
Mechanisms and Evolution of Control Logic in Prokaryotic Transcriptional Regulation
Microbiol. Mol. Biol. Rev., September 1, 2009; 73(3): 481 - 509.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
E. Wijaya, S.-M. Yiu, N. T. Son, R. Kanagasabai, and W.-K. Sung
MotifVoter: a novel ensemble method for fine-grained integration of generic motif finders
Bioinformatics, October 15, 2008; 24(20): 2288 - 2295.
[Abstract] [Full Text] [PDF]


Home page
Genome ResHome page
C. Linhart, Y. Halperin, and R. Shamir
Transcription factor and microRNA motif discovery: The Amadeus platform and a compendium of metazoan target sets
Genome Res., July 1, 2008; 18(7): 1180 - 1189.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
E. Wijaya, K. Rajaraman, S.-M. Yiu, and W.-K. Sung
Detection of generic spaced motifs using submotif pattern mining
Bioinformatics, June 15, 2007; 23(12): 1476 - 1485.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
A. Chakravarty, J. M. Carlson, R. S. Khetani, C. E. DeZiel, and R. H. Gross
SPACER: identification of cis-regulatory elements with non-contiguous critical residues
Bioinformatics, April 15, 2007; 23(8): 1029 - 1031.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
D. GuhaThakurta
Computational identification of transcriptional regulatory elements in DNA sequence
Nucleic Acids Res., July 19, 2006; 34(12): 3585 - 3598.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
T. Waleev, D. Shtokalo, T. Konovalova, N. Voss, E. Cheremushkin, P. Stegmaier, O. Kel-Margoulis, E. Wingender, and A. Kel
Composite Module Analyst: identification of transcription factor binding site combinations using genetic algorithm.
Nucleic Acids Res., July 1, 2006; 34(Web Server issue): W541 - W545.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
A. Kel, T. Konovalova, T. Waleev, E. Cheremushkin, O. Kel-Margoulis, and E. Wingender
Composite Module Analyst: a fitness-based tool for identification of transcription factor binding site combinations
Bioinformatics, May 15, 2006; 22(10): 1190 - 1197.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
A. Zick, I. Onn, R. Bezalel, H. Margalit, and J. Shlomai
Assigning functions to genes: identification of S-phase expressed genes in Leishmania major based on post-transcriptional control elements
Nucleic Acids Res., July 28, 2005; 33(13): 4235 - 4242.
[Abstract] [Full Text] [PDF]


Home page
Proc. Natl. Acad. Sci. USAHome page
X. Li and W. H. Wong
Sampling motifs on phylogenetic trees
PNAS, July 5, 2005; 102(27): 9481 - 9486.
[Abstract] [Full Text] [PDF]


Home page
Mol. Pharmacol.Home page
A. Kel, S. Reymann, V. Matys, P. Nettesheim, E. Wingender, and J. Borlak
A Novel Computational Approach for the Prediction of Networked Transcription Factors of Aryl Hydrocarbon-Receptor-Regulated Genes
Mol. Pharmacol., December 1, 2004; 66(6): 1557 - 1572.
[Abstract] [Full Text] [PDF]



Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.