Bioinformatics Advance Access published online on August 2, 2005
Bioinformatics, doi:10.1093/bioinformatics/bti608
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
1 Department of Computer Science, Columbia University
* 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.
Received May 30, 2005
Revised July 23, 2005
Accepted July 29, 2005
Article
Motif-based protein ranking by network propagation
2 NEC Labs, New Jersey
3 Department of Genome Sciences, University of Washington
4 Center for Computational Biology and Bioinformatics, Columbia University; Center for Computational Learning Systems, Columbia University
Christina Leslie, E-mail: cleslie{at}cs.columbia.edu
![]()
Abstract ![]()
CiteULike
Connotea
Del.icio.us What's this?
This article has been cited by other articles:
![]() |
H. Chen, L. Ding, Z. Wu, T. Yu, L. Dhanapalan, and J. Y. Chen Semantic web for integrated network analysis in biomedicine Brief Bioinform, March 1, 2009; 10(2): 177 - 192. [Abstract] [Full Text] [PDF] |
||||
![]() |
Y. Qi, Y. Suhail, Y.-y. Lin, J. D. Boeke, and J. S. Bader Finding friends and enemies in an enemies-only network: A graph diffusion kernel for predicting novel genetic interactions and co-complex membership from yeast genetic interactions Genome Res., December 1, 2008; 18(12): 1991 - 2004. [Abstract] [Full Text] [PDF] |
||||
![]() |
T. Hwang, H. Sicotte, Z. Tian, B. Wu, J.-P. Kocher, D. A. Wigle, V. Kumar, and R. Kuang Robust and efficient identification of biomarkers by classifying features on graphs Bioinformatics, September 15, 2008; 24(18): 2023 - 2029. [Abstract] [Full Text] [PDF] |
||||
![]() |
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] |
||||
![]() |
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] |
||||
![]() |
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] |
||||


