|
 |
|||||||||||||||||||
|
|||||||||||||||||||
|
|||||||||||||||||||
 |
 |
|
|
Ann. N.Y. Acad. Sci., Annals PrePrint, published online ahead of print October 9, 2007 doi: 10.1196/annals.1407.005 Copyright © 2007 by the New York Academy of Sciences description
1 Computer and Information Sciences, University of Delaware, Newark, Delaware, United States 2 Computer and Information Sciences, University of Delaware, 103 Smith Hall, Newark, Delaware, 19716, United States
* To whom correspondence should be addressed. E-mail: lliao{at}cis.udel.edu. PrePrint Abstract
Predicting protein-protein interactions has become a key step of reverse engineering biological networks to better understand cellular functions. The experimental methods in determining protein-protein interactions are time-consuming and costly, which has motivated vigorous development of computational approaches for predicting protein-protein interactions. A set of recently developed bioinformatics methods utilize co-evolutionary information of the interacting partners, e.g., as exhibited in the form of correlations between distance matrices, where, for each protein, a matrix stores the pairwise distances between the protein and its orthologs in a group of reference genomes. We proposed a novel method to account for the intra-matrix correlations in improving the prediction accuracy. The distance matrices for a pair of proteins are transformed and concatenated into a phylogenetic vector. A least-squares support vector machine is trained and tested on pairs of proteins, represented as phylogenetic vectors, whose interactions are known. The intra-matrix correlations are accounted for by introducing a weighted linear kernel, which determines the dot product of two phylogenetic vectors. The performance, measured as ROC score in cross validation experiments, shows significant improvement of our method (ROC score 0.928) over that of using Pearson correlations (0.659). Key Words:
protein-protein interaction, phylogenetic information, least squares SVM
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
 |
 |
