Skip Navigation


Bioinformatics Advance Access originally published online on September 16, 2004
Bioinformatics 2005 21(3):314-324; doi:10.1093/bioinformatics/bti019
This Article
Right arrow Full Text Freely available
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow All Versions of this Article:
21/3/314    most recent
bti019v1
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 ISI Web of Science
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 arrow Search for citing articles in:
ISI Web of Science (10)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Li, H.
Right arrow Articles by Li, J.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Li, H.
Right arrow Articles by Li, J.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bioinformatics vol. 21 issue 3 © Oxford University Press 2005; all rights reserved.

Discovery of stable and significant binding motif pairs from PDB complexes and protein interaction datasets

Haiquan Li 1,2,* and Jinyan Li 1

1 Institute for Infocomm Research 21 Heng Mui Keng Terrace, Singapore 119613
2 School of Computing, National University of Singapore Singapore 119260

*To whom correspondence should be addressed.

Motivation: Discovery of binding sites is important in the study of protein–protein interactions. In this paper, we introduce stable and significant motif pairs to model protein-binding sites. The stability is the pattern’s resistance to some transformation. The significance is the unexpected frequency of occurrence of the pattern in a sequence dataset comprising known interacting protein pairs. Discovery of stable motif pairs is an iterative process, undergoing a chain of changing but converging patterns. Determining the starting point for such a chain is an interesting problem. We use a protein complex dataset extracted from the Protein Data Bank to help in identifying those starting points, so that the computational complexity of the problem is much released.

Results: We found 913 stable motif pairs, of which 765 are significant. We evaluated these motif pairs using comprehensive comparison results against random patterns. Wet-experimentally discovered motifs reported in the literature were also used to confirm the effectiveness of our method.

Contact haiquan{at}i2r.a-star.edu.sg

Supplementary information http://sdmc.i2r.a-star.edu.sg/BindingMotifPairs


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
J. Guo, X. Wu, D.-Y. Zhang, and K. Lin
Genome-wide inference of protein interaction sites: lessons from the yeast high-quality negative protein-protein interaction dataset
Nucleic Acids Res., April 1, 2008; 36(6): 2002 - 2011.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
A.D.J. van Dijk, C.J.F. ter Braak, R.G. Immink, G.C. Angenent, and R.C.H.J. van Ham
Predicting and understanding transcription factor interactions based on sequence level determinants of combinatorial control
Bioinformatics, January 1, 2008; 24(1): 26 - 33.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
H. Li, J. Li, and L. Wong
Discovering motif pairs at interaction sites from protein sequences on a proteome-wide scale
Bioinformatics, April 15, 2006; 22(8): 989 - 996.
[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.