Predicting Protein-Protein Interaction via SVM Learning

Charleston Noble (B.A. Bioinformatics & Mathematics, 2012)
Alex Zylman (B.S. Computer Engineering, 2012)

EECS 349: Machine Learning - Fall 2011
Bryan Pardo
Northwestern University

Interactions between proteins are essential for the large majority of biological functions, so predicting whether two proteins will interact is a central problem in medical and biological research. We propose a method which accomplishes this task with only the most basic knowledge of the two proteins: their primary structures.

Proteins are linear chains of amino acids, which fold to form complex three dimensional structures. A protein's primary structure is simply its amino acid sequence, while secondary, tertiary and quaternary structures refer to its local and global three-dimensional shape.

If two proteins come into contact with each other, and their structures complement each other in some region, then they can bind, or dock with each other. If two proteins are capable of binding with each other, then they are said to interact. Binding interactions ubiquitous in biological processes, and much of contemporary pharmaceutical research is concerned with the creation of novel interacting proteins. For example, Alzheimer's Disease is thought to be caused by the accumulation of misfolded proteins in the brain, and one proposed cure is the creation of a protein which can interact with these and properly re-orient them.

While the interaction (or non-interaction) status of protein pairs is determined by their three dimensional shapes, the problem of accurately predicting the shape of novel proteins remains an open (and enormously complex) problem in bioinformatics. Thus it has been suggested that, since a protein's primary structure determines its tertiary structure, or three dimensional shape, we can skip the intermediate and intractable step of determining the proteins' tertiary structure when attempting to predict interactions.
Primary structures of interacting protein pairs were obtained from UCLA's Database of Interacting Proteins which contains over 50,000 entries representing pairs of proteins known to mutually bind ("positive interactions"). Pairs of proteins known to be unable to bind ("negative interactions") are not included in the database, so we needed to create them by permuting sequences of positively interacting pairs. If one member of a pair of positively interacting proteins is shuffled, the result is a synthetic native-like protein that, with a high degree of certainty, can be said to interact negatively. This permutation was performed using Shufflet, a bioinformatics application developed by Eivind Coward, University of Bergen. Overall, 134,550 protein-pairs were used, with half of these being interacting pairs and the other half non-interacting.
Proteins were represented by feature vectors by aggregating descriptors of their amino acid constituents. The descriptors we considered were hydrophobicity, hydrophicility, volumes of side chains, polarity, polarizability, solvent-accessible surface area (SASA) and net charge index (NCI). These descriptors were chosen because they, in particular, affect the binding properties of the overall protein. They have a known value for each amino acid that we normalized before constructing our feature vector.

Aggregate descriptor values for proteins were assembled by finding the autocovariance (AC) of their values up to a distance lg away from a particular amino acid. Given a protein sequence, AC variables describe the average interactions between residues, a certain lag apart throughout the whole sequence. These values were calculated according to:



where j represents one descriptor, i the position in the sequence X, n the length of the sequence X and lag <= lg the value of the lag. The software SVM-Light was employed in the classiffication of feature vectors. A linear function was chosen as the kernel function due to time constraints.
We achieved a 72.56% accuracy rate using a linear kernel and the full set of features. This compares to the roughly 80% accuracy of current research into this problem. From there, we wanted to find out which acid descriptors had the largest effect in determining the accuracy of our classiffier.

Initially, we ran our classiffier seven times, each time using all of the descriptors except for one. This way, we get an average accuracy of 72.07% (with a standard deviation of .31%), only slightly less than our accuracy using all of the descriptors. The removal of SASA had the largest effect, dropping our accuracy to 71.67%, while the removal of polarizability had the least effect, dropping our accuracy to 72.46%.

Subsequently, we ran our classiffier seven times, each using only one of our seven descriptors. The average accuracy of 61.84% with a standard deviation of 4.79%. The descriptor that had the least effect on accuracy was NCI, which had an accuracy of 57.04%. The descriptor that had the largest effect was polarity, which had an accuracy of 68.08%. While most of our training was done with a linear kernel, we ran this training data a second time using a radial basis kernel function, which increased our accuracy to 71.4%.

Next, we wanted to see which descriptor, when paired with polarity, gave the highest accuracy so we ran our classiffier six times using each of the remaining six descriptors and polarity. We got an average accuracy of 69.32% with a standard deviation of .38%. The descriptor that had the highest accuracy when paired with polarity was SASA at 69.88%, while the descriptor with the lowest accuracy was 68.92%.

When we look at our descriptors paired with polarity and SASA, the average is 70.67% and the standard deviation is .46%. The maximum accuracy of 71.47% was achieved using volume, polarity, and SASA while the lowest accuracy of 70.36% was a result of using polarity, SASA, and NCI.