Skip Navigation

Bioinformatics 2005 21(Suppl 1):i204-i212; doi:10.1093/bioinformatics/bti1001
This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow Alert me when this article is cited
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 Hannenhalli, S.
Right arrow Articles by Wang, L.-S.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Hannenhalli, S.
Right arrow Articles by Wang, L.-S.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2005. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions{at}oupjournals.org

Enhanced position weight matrices using mixture models

Sridhar Hannenhalli 1,* and Li-San Wang 2

1Department of Genetics, University of Pennsylvania Philadelphia, PA 19104, USA
2Department of Biology, University of Pennsylvania Philadelphia, PA 19104, USA

*To whom correspondence should be addressed.

Motivation: Positional weight matrix (PWM) is derived from a set of experimentally determined binding sites. Here we explore whether there exist subclasses of binding sites and if the mixture of these subclass-PWMs can improve the binding site prediction. Intuitively, the subclasses correspond to either distinct binding preference of the same transcription factor in different contexts or distinct subtypes of the transcription factor.

Result: We report an Expectation Maximization algorithm adapting the mixture model of Baily and Elkan. We assessed the relative merit of using two subclass-PWMs. The resulting PWMs were evaluated with respect to preferred conservation (relative to mouse) of potential sites in human promoters and expression coherence of the potential target genes. Based on 64 JASPAR vertebrate PWMs, 61–81% of the cases resulted in a higher conservation using the mixture model. Also in 98% of the cases the expression coherence was higher for the target genes of one of the subclass-PWMs. Our analysis of Reb1 sites is consistent with previously discovered subtypes using independent methods. Additionally application of our method to mutated sites for transcription factor LEU3 reveals subclasses that segregate into strongly binding and weakly binding sites with P-value of 0.008. This is the first study which attempts to quantify the subtly different binding specificities of a transcription factor on a large scale and suggests the use of a mixture of PWMs, instead of the current practice of using a single PWM, for a transcription factor.

Availability:

Contact: sridharh{at}pcbi.upenn.edu


Received on January 15, 2005; accepted on March 27, 2005

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
Nucleic Acids ResHome page
S. Keles, C. L. Warren, C. D. Carlson, and A. Z. Ansari
CSI-Tree: A regression tree approach for modeling binding properties of DNA-binding molecules based on cognate site identification (CSI) data
Nucleic Acids Res., April 13, 2008; (2008) gkn057v1.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
L. N. Singh, L.-S. Wang, and S. Hannenhalli
TREMOR a tool for retrieving transcriptional modules by incorporating motif covariance
Nucleic Acids Res., December 18, 2007; 35(21): 7360 - 7371.
[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.