Skip Navigation


Bioinformatics Advance Access originally published online on August 2, 2005
Bioinformatics 2005 21(19):3711-3718; doi:10.1093/bioinformatics/bti608
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/19/3711    most recent
bti608v1
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 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 (3)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Kuang, R.
Right arrow Articles by Leslie, C.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Kuang, R.
Right arrow Articles by Leslie, C.
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}oxfordjournals.org

Motif-based protein ranking by network propagation

Rui Kuang 1, Jason Weston 4, William Stafford Noble 5 and Christina Leslie 2,3,*

1Department of Computer Science, Columbia University New York, NY 10027, USA
2Center for Computational Biology and Bioinformatics, Columbia University New York, NY 10027, USA
3Center for Computational Learning Systems, Columbia University New York, NY 10027, USA
4NEC Labs New Jersey, CA 95014, USA
5Department of Genome Sciences, University of Washington Seattle, WA 98195, USA

*To whom correspondence should be addressed.

Motivation: Sequence similarity often suggests evolutionary relationships between protein sequences that can be important for inferring similarity of structure or function. The most widely-used pairwise sequence comparison algorithms for homology detection, such as BLAST and PSI-BLAST, often fail to detect less conserved remotely-related targets.

Results: In this paper, we propose a new general graph-based propagation algorithm called MotifProp to detect more subtle similarity relationships than pairwise comparison methods. MotifProp is based on a protein-motif network, in which edges connect proteins and the k-mer based motif features that they contain. We show that our new motif-based propagation algorithm can improve the ranking results over a base algorithm, such as PSI-BLAST, that is used to initialize the ranking. Despite the complex structure of the protein-motif network, MotifProp can be easily interpreted using the top-ranked motifs and motif-rich regions induced by the propagation, both of which are helpful for discovering conserved structural components in remote homologies.

Availability: http://www.cs.columbia.edu/compbio/motifprop

Contact: cleslie{at}cs.columbia.edu

Received on May 30, 2005; revised on July 23, 2005; accepted on July 29, 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
 BioinformaticsHome page
A. R. Shah, C. S. Oehmen, and B.-J. Webb-Robertson
SVM-HUSTLE--an iterative semi-supervised machine learning approach for pairwise protein remote homology detection
Bioinformatics, March 15, 2008; 24(6): 783 - 790.
[Abstract] [Full Text] [PDF]

Home page
 Brief BioinformHome page
T. Aittokallio and B. Schwikowski
Graph-based methods for analysing networks in cell biology
Brief Bioinform, September 1, 2006; 7(3): 243 - 255.
[Abstract] [Full Text] [PDF]

Home page
 BioinformaticsHome page
O. Camoglu, T. Can, and A. K. Singh
Integrating multi-attribute similarity networks for robust representation of the protein space
Bioinformatics, July 1, 2006; 22(13): 1585 - 1592.
[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.