Open Access

Exploiting residue-level and profile-level interface propensities for usage in binding sites prediction of proteins

BMC Bioinformatics20078:147

DOI: 10.1186/1471-2105-8-147

Received: 01 February 2007

Accepted: 05 May 2007

Published: 05 May 2007

Abstract

Background

Recognition of binding sites in proteins is a direct computational approach to the characterization of proteins in terms of biological and biochemical function. Residue preferences have been widely used in many studies but the results are often not satisfactory. Although different amino acid compositions among the interaction sites of different complexes have been observed, such differences have not been integrated into the prediction process. Furthermore, the evolution information has not been exploited to achieve a more powerful propensity.

Result

In this study, the residue interface propensities of four kinds of complexes (homo-permanent complexes, homo-transient complexes, hetero-permanent complexes and hetero-transient complexes) are investigated. These propensities, combined with sequence profiles and accessible surface areas, are inputted to the support vector machine for the prediction of protein binding sites. Such propensities are further improved by taking evolutional information into consideration, which results in a class of novel propensities at the profile level, i.e. the binary profiles interface propensities. Experiment is performed on the 1139 non-redundant protein chains. Although different residue interface propensities among different complexes are observed, the improvement of the classifier with residue interface propensities can be negligible in comparison with that without propensities. The binary profile interface propensities can significantly improve the performance of binding sites prediction by about ten percent in term of both precision and recall.

Conclusion

Although there are minor differences among the four kinds of complexes, the residue interface propensities cannot provide efficient discrimination for the complicated interfaces of proteins. The binary profile interface propensities can significantly improve the performance of binding sites prediction of protein, which indicates that the propensities at the profile level are more accurate than those at the residue level.

Background

Protein function is very often encoded in a small number of residues located in the functional active site, which are dispersed around the primary sequence, but packed in a compact spatial region [1]. Recognition of functional sites in proteins is a direct computational approach to the characterization of proteins in terms of biological and biochemical function. Localization of functional sites will allow us to understand how the protein recognizes other molecules, to gain clues about its likely function at the level of the cell and the organism, and to identify important binding sites that may serve as useful targets for pharmaceutical design [2].

Recently, a series of computational efforts to identify interaction sites or interfaces in proteins have been undertaken. A number of studies on the characteristics of protein interfaces have provided clues for binding site prediction. Several methods have been proposed to predict these sites based on the sequence or structure characteristics of known protein-protein interaction sites.

In terms of physical chemistry, protein interfaces are generally observed to be more hydrophobic than the remainder of the protein surface [3, 4]. Moreover, the interfaces of permanent complexes tend to be more hydrophobic when compared to those of transient complexes [5]. Some interfaces have a significant number of polar residues [6], usually where interactions are less permanent [7]. Charged side-chains are often excluded from protein-protein interfaces with the exception of arginine [8], which is one of the most abundant interface residues regardless of interaction types [9]. The evolutionary conservation of residues is another property that may be utilized to predict protein-protein interfaces [10]. The evolutionary trace (ET) method tries to identify functional sites by using the sequence variations and functional divergences found in nature [11, 12]. Accurate ET analysis requires functionally relevant sequence and high-quality alignments as input [13]. A structure-independent criterion has been presented to measure the quality of evolutionary trace [14]. Because sequence conservation reflects not only evolutionary selection at binding sites to maintain protein function, but also the selection throughout the protein to maintain the stability of the folded state [15], many researchers try to distinguish functional and structural constraints on protein evolution [16, 17]. A comprehensive evaluation of different conservation scores has been performed by Valdar [18]. Other sequence information has also been exploited such as the phylogenetic profile [19, 20], the sequence motifs [21], sequence profile [22, 23], evolution rate [24, 25], etc.

The features extracted from the three-dimensional structures of protein complexes are critical for a full understanding of the mechanism of interactions because they provide specific interaction details at the atomic level. The accessible surface area (ASA) is one of the most widely used features [26]. Molecular docking seems to be the most principled computational approach for identifying the interaction sites [27], but it requires the precise design of energy function [28], either physical energy [29] or empirical scoring functions [27, 30]. 3D-motifs have also been successfully used to identify binding sites of the same type in proteins with different folds [3134]. Patch analysis using a six-parameter scoring function can distinguish the interface from other surfaces [3].

Because none of the above-mentioned properties is able to make an unambiguous identification of interface regions or patches, a combination of some of them (via either a linear combination [35] or machine learning [36]) is found to be effective for improving the accuracy of binding-site prediction [37]. The PINUP method predicts interface residues using an empirical score function made of a linear combination of the energy score, interface propensity and residue conservation score [38].

Rossi et al. first construct a scoring function, and then perform a Monte Carlo optimization, to find a good scoring patch on the protein surface [39].

Machine Learning Methods are well suited to the classification of interface and non-interface surface residues [40, 41]. Neural networks [42] and support vector machine [43, 44] have been applied in this field. These studies take sequential or structural information as input [6]. Other researchers adopt two-stage model [23] to further improve the performance. Recently, the conditional random field (CRF) model has been introduced, which formalizes the prediction of protein interaction sites as a sequence-labeling task [45].

In this study, we revisit the difference of amino acid compositions between the interface area and other surface area. Although some researchers have found that there are different amino acid compositions among the interaction sites of different complexes (homo-permanent complexes, homo-transient complexes, hetero-permanent complexes, and hetero-transient complexes) [46], such difference has not been integrated into the prediction process. Here, the residue interface propensities of different complexes are collected. These propensities, combined with sequence profiles and accessible surface areas, are inputted to the support vector machine for the prediction of protein binding sites. Such propensities are further improved by taking evolutional information into consideration. The frequency profiles are directly calculated from the multiple sequence alignments outputted by PSI-BLAST [47] and converted into binary profiles [48] with a probability threshold. As a result, the protein sequences are represented as sequences of binary profiles rather than sequences of amino acids. Similar to the residue interface propensities, a class of novel propensities at the profile level is introduced. Binary profiles can be viewed as novel building blocks of proteins. It has been successfully applied in many computational biology tasks, such as domain boundary prediction [48], knowledge-based mean force potentials [49], protein remote homology detection [50] etc. Experimental results show that the binary profile propensities significantly improve the performance of binding sites prediction of proteins.

Results and discussion

Residue interface propensities

Residue interface propensities are good indicators for binding sites and have been widely used in many studies [6]. The residue interface propensities of the four kinds of complexes are shown in Fig. 1. Positive propensity means that the residue is abundant in the interface while negative propensity means that the residue is abundant in the surface area.
https://static-content.springer.com/image/art%3A10.1186%2F1471-2105-8-147/MediaObjects/12859_2007_Article_1519_Fig1_HTML.jpg
Figure 1

Residue interface propensities of the four kinds of complexes. Column bar 1, 2, 3 and 4 denote hetero-permanent, hetero-transient, homo-permanent and homo-transient complex respectively.

The four kinds of complexes have similar residue interface propensities. They all show that hydrophobic residues (F, I, L, M, V) and some polar aromatic residues (W, Y, H) are favored in interface area. The charged residue R also shows preferences for the interface area. Other polar amino acid T, E and small amino acid P, A are disfavored in the interface. The same phenomena have been observed by others [35] although some researchers evaluated the ASA contribution for amino acid [3, 38] while we count them. Bio-physically similar residues, such as L and I, or D and E, usually showed similar trends, indicating the reliability of the data.

There are minor differences among the four kinds of complexes. Although many amino acids show the same trend for interface area or surface area, the propensities are different for the four kinds of complexes. Further more, some amino acids reveal different propensities in different complexes. Amino acid Q, S and T show preferences for the hetero complexes rather than homo complexes.

Amino acid C and L are favored in permanent complexes rather than transient complexes. Ofran and Rost [46] found that the composition of all interface types differed substantially from that of SWISS-PROT. Here we conclude that the residue interface propensities show general trends and have minor differences among different kinds of complexes.

Binary profile interface propensities

The binary profile frequencies in interface are different from those in surface area. These differences can be used to produce the discriminative binary profile propensities. In theory, the total number of binary profiles is extremely large (220), but in fact, only a small fraction of binary profiles appears, which is dependent on the choice of probability threshold P h and the dataset. Based on the results of cross-validation (Next section), the four kinds of complexes have different number of binary profiles, ranging from one hundred to several thousands. The binary profiles and their propensities of the four kinds of complexes are listed in the Additional files (see additional file 1, 2, 3, 4). Note that the binary profiles with low occurrence times (<3) are ignored, since these profiles are not statistically significant and may introduce much noise.

An increased propensity of hydrophobic residues and their combinations in interface has been observed, such as the binary profile FHWY, ILMV. Although some amino acids are preferred in surface, the combination of these amino acids with other amino acids may be preferred in interface such as AEP, ST. Another special phenomenon is that some binary profiles only occur in interface while other binary profiles only occur in surface area. The former results in a maximum propensity (being set as 4) and the latter results in a minimum propensity (being set as – 4). Each kind of complexes has many such binary profiles.

The differences of binary profile interface propensities among different complexes are significant in comparison with those of residue interface propensities. Many binary profiles show positive propensities in one complex but negative propensities in another complex. Table 1 summarizes the number of such binary profiles between any pair of complexes.
Table 1

The differences of binary profile interface propensities among the four kinds of complexes

 

Hetero permanenta

Hetero transient

Homo permanent

Homo transient

Hetero permanent

-

341

378

29

Hetero transient

261

-

893

28

Homo permanent

267

908

-

36

Homo transient

17

27

38

-

aGiven in the element (I, J) of the matrix are the number of binary profiles which show positive propensities in complex type I and negative propensities in complex type J.

Comparative results with and without propensities

The first SVM takes profile and ASA of spatially neighboring residues as input, which are common input features used by previous studies [15, 44, 51]. Then we add the amino acid or binary profile interface propensities as an extra feature to evaluate whether these propensities can improve the performance or not. All the results are obtained by five-fold cross-validation.

The second SVM takes residue interface propensities as an extra feature. Table 2 gives the results with and without residue interface propensities. The similar performance indicates that the standard amino acid cannot provide efficient discrimination for the complicated interfaces of proteins. The results on homo-transient complex are extremely low because there are only 5 chains in this complex. The performance of the first SVM is comparable with those of Chung et al. [15]. They reported precision of 0.498 and recall of 0.568 with the same features on their 274 hetero-complexes.
Table 2

Comparative results with and without residue interface propensities on the four kinds of complexes.

  

Precision

Recall

F1

Accuracy

CC

Hetero permanent

Non-proa

0.518

0.582

0.547

0.687

0.267

 

AA-prob

0.514

0.590

0.548

0.684

0.265

Hetero transient

Non-pro

0.414

0.563

0.475

0.643

0.204

 

AA-pro

0.415

0.561

0.476

0.643

0.204

Homo permanent

Non-pro

0.463

0.607

0.526

0.687

0.288

 

AA-pro

0.474

0.617

0.536

0.693

0.303

Homo transient

Non-pro

0.206

0.463

0.279

0.691

0.136

 

AA-pro

0.260

0.465

0.327

0.743

0.195

aThe features of SVM are Position-Specific Score Matrix (PSSM) and Accessible Surface Areas (ASA)

bResidue interface propensity is inputted to SVM as an extra feature

The third SVM takes binary profile interface propensities as an extra feature instead of residue interface propensities. The probability threshold P h of converting a frequency profile into a binary profile needs to be optimized. During the validation process, three sets are used to train SVM, one validation set is used to optimize the parameter and the testing set is used to give the final results. That is, we select the values of P h that give the best results on the validation set and then such parameter is used to test the proteins on the testing set to give the final results. The influences of P h on the performance are illustrated in Fig. 2. F1 is used as the guild line since it is a tradeoff between precision and recall. The optimal values of P h are different for different complexes.
https://static-content.springer.com/image/art%3A10.1186%2F1471-2105-8-147/MediaObjects/12859_2007_Article_1519_Fig2_HTML.jpg
Figure 2

The average F1 under different value of parameter Ph. The F1 is obtained as the results of cross-validation at the validation dataset.

The results of cross-validation are then obtained with the optimal value of P h and shown in Table 3. The improvement of the third SVM is significant in comparison with the other two SVMs. The F1 is improved by about ten percent. According to the experimental results, we can infer that the propensities at the profile level may be more accurate than that at the amino acid level.
Table 3

Cross-validation results with binary profile interface propensities

 

P h a

Nb

Precision

Recall

F1

Accuracy

CC

Hetero permanent

0.07

1558

0.599

0.700

0.644

0.735

0.396

Hetero transient

0.05

4662

0.501

0.756

0.602

0.697

0.379

Homo permanent

0.05

8639

0.546

0.734

0.626

0.745

0.435

Homo transient

0.08

129

0.277

0.551

0.363

0.747

0.250

aThe optimal probability threshold P h of converting a frequency profile into a binary profile

bThe number of binary profiles

Comparative results with propensities from other complexes

Analysis of interface propensities shows that the residue interface propensities have minor differences among different complexes while the profile interface propensities differ significantly among different complexes. To validate it, the propensities from other complexes are used as an extra feature. The results are shown in Table 4 (residue-level) and Table 5 (profile-level).
Table 4

Comparative results with residue interface propensities from other complexes.

Complexa

Propensitiesb

Precision

Recall

F1

Accuracy

CC

Hetero permanent

Hetero transient

0.512

0.570

0.539

0.679

0.256

 

Homo permanent

0.503

0.578

0.538

0.682

0.250

Hetero transient

Hetero permanent

0.419

0.568

0.482

0.646

0.212

 

Homo permanent

0.418

0.568

0.482

0.644

0.210

Homo permanent

Hetero permanent

0.445

0.596

0.510

0.674

0.273

Homo transient

Hetero permanent

0.192

0.550

0.285

0.636

0.132

aThe complexes that the experiments are performed on.

bThe complexes that the propensities are derived from.

Table 5

Comparative results with binary profile interface propensities from other complexes.

Complexa

Propensitiesb

Precision

Recall

F1

Accuracy

CC

Hetero permanent

Hetero transient

0.532

0.574

0.551

0.698

0.282

Hetero transient

Homo permanent

0.413

0.562

0.475

0.642

0.203

Homo permanent

Hetero Permanent

0.463

0.607

0.525

0.686

0.287

Homo transient

Hetero permanent

0.181

0.514

0.262

0.637

0.111

aThe complexes that the experiments are performed on.

bThe complexes that the propensities are derived from.

The performances of Table 4 are close to those of Table 2, which indicates that the differences of residue interface propensities among different complexes can be negligible. The performances of Table 5 decrease significantly in comparison with those of Table 3, so the profile interface propensities are sensitive to the types of complexes. In other words, the propensities at the profile-level can give more exact description of interfaces than the propensities at the residue level.

Examples

Some examples are provided at Fig. 3. One protein is selected from each type of complexes. The true interface and the interface predicted by the second SVM and the third SVM are depicted. Most interface residues and non-interface residues can be predicted correctly. It is clearly that the classifier that integrates binary profile interface propensities is more accurate than the classifier that uses residue interface propensities.
https://static-content.springer.com/image/art%3A10.1186%2F1471-2105-8-147/MediaObjects/12859_2007_Article_1519_Fig3_HTML.jpg
Figure 3

Sample predictions. One protein is selected from each complexes and shown in sub-figure (A), (B), (C) and (D). The PDB IDs and chain identifiers are 1bplB, 1ijeB, 1lqpB and 1j0xO respectively. The interface residues are depicted with purple colour. For each sub-figure, the true interfaces are shown in the center picture. The left picture gives the results predicted by the second SVM, which takes residue interface propensities as an extra feature. The right picture gives the results predicted by the third SVM, which takes binary profile propensities as an extra feature.

Comparison with conservation scores

The conservation score is another widely used feature in prediction of function sites, which indicates the importance of a residue for maintaining the structure and function of a protein [18]. Here, we compare the binary profile interface propensities with conservation scores since both of them are derived from the multiple sequence alignment of homologues. Three conservation scores are investigated including the symbol entropy score [52], Karlin score [53] and Valdar score [54]. They are defined as follows:
C e n t r o p y = i K p i ln p i × 1 ln K MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacqWGdbWqdaWgaaWcbaGaemyzauMaemOBa4MaemiDaqNaemOCaiNaem4Ba8MaemiCaaNaemyEaKhabeaakiabg2da9iabgkHiTmaaqahabaGaemiCaa3aaSbaaSqaaiabdMgaPbqabaGccyGGSbaBcqGGUbGBcqWGWbaCdaWgaaWcbaGaemyAaKgabeaakiabgEna0oaalaaabaGaeGymaedabaGagiiBaWMaeiOBa4Maem4saSeaaaWcbaGaemyAaKgabaGaem4saSeaniabggHiLdaaaa@4E37@
(1)
C K a r l i n = i N j > i N M ( s i , s j ) × 2 N ( N 1 ) MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacqWGdbWqdaWgaaWcbaGaem4saSKaemyyaeMaemOCaiNaemiBaWMaemyAaKMaemOBa4gabeaakiabg2da9maaqahabaWaaabCaeaacqWGnbqtcqGGOaakcqWGZbWCdaWgaaWcbaGaemyAaKgabeaakiabcYcaSiabdohaZnaaBaaaleaacqWGQbGAaeqaaOGaeiykaKIaey41aq7aaSaaaeaacqaIYaGmaeaacqWGobGtcqGGOaakcqWGobGtcqGHsislcqaIXaqmcqGGPaqkaaaaleaacqWGQbGAcqGH+aGpcqWGPbqAaeaacqWGobGta0GaeyyeIuoaaSqaaiabdMgaPbqaaiabd6eaobqdcqGHris5aaaa@5581@
(2)
C v a l d a r = λ i N j > i N w i w j M ( s i , s j ) MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacqWGdbWqdaWgaaWcbaGaemODayNaemyyaeMaemiBaWMaemizaqMaemyyaeMaemOCaihabeaakiabg2da9GGaciab=T7aSnaaqahabaWaaabCaeaacqWG3bWDdaWgaaWcbaGaemyAaKgabeaakiabdEha3naaBaaaleaacqWGQbGAaeqaaaqaaiabdQgaQjabg6da+iabdMgaPbqaaiabd6eaobqdcqGHris5aaWcbaGaemyAaKgabaGaemOta4eaniabggHiLdGccqWGnbqtcqGGOaakcqWGZbWCdaWgaaWcbaGaemyAaKgabeaakiabcYcaSiabdohaZnaaBaaaleaacqWGQbGAaeqaaOGaeiykaKcaaa@5483@
(3)

Please refer to [18] for detail calculation and comparison of these scores.

These conservation scores are used as an additional feature respectively and the cross-validation results are shown in Table 6. Overall the F1 is improved by about 2 percent in comparison with those without conservation scores (the first SVM).
Table 6

Cross-validation results with conservation scores

  

Precision

Recall

F1

Accuracy

CC

Hetero permanent

Ventropy

0.529

0.571

0.549

0.692

0.280

 

VKarlin

0.531

0.584

0.556

0.698

0.282

 

VValdar

0.534

0.592

0.561

0.702

0.283

Hetero transient

Ventropy

0.414

0.563

0.477

0.644

0.203

 

VKarlin

0.414

0.572

0.480

0.644

0.204

 

VValdar

0.415

0.585

0.486

0.645

0.205

Homo permanent

Ventropy

0.464

0.607

0.526

0.687

0.288

 

VKarlin

0.472

0.613

0.533

0.692

0.291

 

VValdar

0.478

0.622

0.541

0.698

0.295

Homo transient

Ventropy

0.212

0.468

0.292

0.698

0.121

 

VKarlin

0.226

0.478

0.307

0.710

0.127

 

VValdar

0.228

0.482

0.310

0.721

0.132

All these conservation scores show positive correlation with binary profile interface propensities, although the Pearson correlation coefficients are small (0.017, 0.053, 0.064 for Ventropy, VKarlin and Vvaldar respectively). The results show that the improvement by conservation scores is much lower than that by binary profile interface propensities.

Independent testing

A direct comparison with other studies is difficult due to the differences in choice of dataset and definitions of surface or interface residue. Our method is tested on the protein-protein docking benchmark 2.0, which is a well established dataset including 84 hetero transient complex. The proteins in hetero transient complexes are filtered by removing the protein chains contained in benchmark 2.0 dataset and their homologues. The SVMs are re-trained on the filtered datasets and used to test the complexes in benchmark 2.0 dataset. The results on different subset (rigid-body, medium difficult and difficult set) and the average results are shown in Table 7. The classifiers with binary profile interface propensities outperform those with residue interface propensities by 5 percent in term of F1.
Table 7

Results on the protein-protein docking benchmark 2.0 dataset.

Subset

No. of Protein

Methoda

Precision

Recall

F1

Accuracy

CC

Rigid body

63

AA

0.393

0.447

0.418

0.848

0.301

  

BP

0.446

0.495

0.469

0.857

0.328

Medium difficult

13

AA

0.356

0.405

0.379

0.810

0.258

  

BP

0.412

0.464

0.436

0.821

0.271

Difficult

8

AA

0.362

0.384

0.372

0.813

0.299

  

BP

0.409

0.427

0.428

0.819

0.317

All

84

AA

0.370

0.412

0.390

0.824

0.286

  

BP

0.422

0.462

0.441

0.832

0.305

aAA, the classifiers with residue interface propensities as extra features; BP, the classifiers with binary profile interface propensities as extra features.

The results are better than those of related works. Liang et al [38]. developed an empirical scoring function for binding site prediction, which is a weighted combination of energy scores, conservation scores and residue interface propensities. They achieved the precision of 0.294 and the recall of 0.305. The overall F1 is only 0.30. Their method is trained on a small dataset (only 57 proteins). Furthermore their method is a simple combination of three features while our method is based on discriminative model.

Conclusion

In this study, the residue interface propensities of four kinds of complexes (hetero-permanent complex, hetero-transient complex, homo-permanent complexes and homo-transient complex) are collected and applied in the process of predicting binding sites of proteins. Such propensities are improved by taking evolutionary information into consideration, which results in the binary profile interface propensities. Although there are minor differences among the four kinds of complexes, the residue interface propensities cannot provide efficient discrimination for the complicated interfaces of proteins. The binary profile interface propensities can significantly improve the performance of binding sites prediction of protein, which indicates that the propensities at the profile level are more accurate than those at the residue level.

Methods

Dataset

A comprehensive set of complexes is chosen from the Protein Data Bank (PDB) [55] and then subjected to a number of stringent filtering steps. All proteins with multi-chains, non-NMR structures and resolution better than 4 Å are selected. Two chains in a protein are considered as interacting pairs if at least two non-hydrogen atoms in each chain are separated by no more than 5 Å [42, 56].

For PDB structure with more than two chains, each chain is selected for at most one time. For protein chain that interacts with multiple partners, only one partner with the most interfacial residues is selected as its partner. The protein chains with less than 40 amino acids are removed. The PQS web-server [57] is used to eliminate crystal packing complexes rather than biologically functional multimers. The selected chains are further filtered such that no pair of chain has more than 25% sequence identify. Finally, a total of 1139 chains are obtained.

Classification of complexes

The protein-protein interactions can be divided into different types according to different criterions [58]. In this study, the complexes are classified by the homology of interacting chains (homo versus hetero) and the lifetime of the complexes (transient versus permanent).

Using simple sequence comparisons, the complexes can be classified as homo-complexes or hetero-complexes. Two interacting protein chains were defined as homo-complex if over 90% of them are aligned and the sequence identity over the aligned region is more than 95% [42]. All other complexes are classified as hetero-complexes.

A permanent complex is usually very stable and thus only exists in its complexed form. In contrast, a transient complex can exist in separated state. The method of differentiating the transient complexes and permanent complexes is same as the one used by Ofran and Rost [46]. The guild lines for classifying the hetero-complexes and homo-complexes into permanent and transient states are different. They are briefly described here. If the chains from the hetero-complexes are stored in the same SWISS-PROT files [59], the complexes are classified as hetero-permanent complexes; otherwise they are classified as hetero-transient complexes. All homo-complexes that are annotated as monomers in DIP [60] database are classified as homo-transient complexes; otherwise they are classified as homo-permanent complexes.

The above dataset is then grouped into four kinds of complexes (hetero-permanent, hetero-transient, homo-permanent, homo-transient). The statistical information of different complexes is tabulated in Table 8. An amino acid is defined as a surface amino acid if the ASA of at least one of its atom is larger than 2 Å2 [39]. A surface residue is considered as interface residues if its accessible surface area is decreased by more than 1 Å2 upon complexation [38]. The ASA is calculated with the DSSP program [61]. According to this definition, 27.3% of the surface residues are interface residues. Such ratio is very close to that (28%) in Chung's dataset [15].
Table 8

Summary of the four complexes

 

Chains

Res.

Surface res.

Interface res.a

Hetero-permanent

123

25157

21737

7136 (32.8%)

Hetero-transient

386

86168

72288

19177 (26.5%)

Homo-permanent

625

174629

142620

38556 (27%)

Homo-transient

5

1555

1267

187 (14.8%))

Total

1139

287509

237912

65056 (27.3%)

aGiven in the bracket are the fraction of interface residues in the total number of surface residues.

Calculation of propensities

The amino acid frequencies between interface and other surface area are different. Such difference can be used to produce the residue interface propensity, which is defined as the log ratio between the amino acid frequency in interface area and that in surface area:P a = In(Pa, I/Pa, S)

where P a is the propensity of amino acid a, Pa, Iis the frequency of amino acid a in interface area and Pa, Sis the frequency of amino acid a in surface area. The frequencies can be calculated from the training set by maximum likelihood estimation:
P a , I = C a , I C I MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacqWGqbaudaWgaaWcbaGaemyyaeMaeiilaWIaemysaKeabeaakiabg2da9maalaaabaGaem4qam0aaSbaaSqaaiabdggaHjabcYcaSiabdMeajbqabaaakeaacqWGdbWqdaWgaaWcbaGaemysaKeabeaaaaaaaa@3948@
(5)
P a , S = C a , S C S MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacqWGqbaudaWgaaWcbaGaemyyaeMaeiilaWIaem4uamfabeaakiabg2da9maalaaabaGaem4qam0aaSbaaSqaaiabdggaHjabcYcaSiabdofatbqabaaakeaacqWGdbWqdaWgaaWcbaGaem4uamfabeaaaaaaaa@3984@
(6)

where Ca, Iis the count of amino acid a in interface area, C I is the total number of amino acid in interface area, Ca, Sis the count of amino acid a in surface area, C S is the total number of amino acid in surface area. The residue interface propensity describes the likelihood of amino acid to be found in interface area as compared to those in surface area. A propensity of 0 indicates that the amino acid has the same frequency in interface and surface area. A positive propensity means that the amino acid is over-representative in interface area.

In term of binary profile, the protein sequence is represented as sequence of binary profiles rather than sequence of amino acids. Each amino acid is replaced by the corresponding binary profiles that are derived from the multiple sequence alignments as described in the following section. The calculation formula of binary profile interface propensities are same as that of the residue interface propensities except that the subscripts are replaced by binary profiles rather than amino acid:P b = In(Pb, I/Pb, S)

where P b is the propensity of binary profile b, Pb, Iis the frequency of binary profile b in interface area and Pb, Sis the frequency of binary profile b in surface area. The frequencies can also be calculated by maximum likelihood estimation in the same manner of amino acid. The binary profile interface propensity contains evolution information and provides more accurate prediction of binding sites than amino acid interface propensity according to the experimental results.

Here an example of calculating the propensities of binary profiles is provided. Suppose there is a frequency profile (see Table 9):
Table 9

An example of calculating the propensities of binary profiles

A: 0.09

C: 0.02

D: 0.07

E: 0.04

F: 0.03

G: 0.1

H: 0.07

I: 0.04

K: 0.02

L: 0.09

M: 0.02

N: 0.09

P: 0.05

Q: 0.04

R: 0.03

S: 0.04

T: 0.05

V: 0.01

W: 0.05

Y: 0.05

When the probability threshold P h is taken as 0.08, we get the following binary profile (see Table 10):
Table 10

When the probability threshold P h is taken as 0.08, we get the following binary profile:

A: 1

C: 0

D: 0

E: 0

F: 0

G: 1

H: 0

I: 0

K: 0

L: 1

M: 0

N: 1

P: 0

Q: 0

R: 0

S: 0

T: 0

V: 0

W: 0

Y: 0

By collecting the non-zero term in binary profile, the combination of amino acid AGLN is obtained. Suppose the frequency of AGLN is 0.00042 in interface area and 0.00021 in surface area, which are calculated by maximum likelihood estimate using equation (5) and (6). Thus, the propensity of AGLN is 0.693147 (ln (0.00042/0.00021)) by equation (7).

Generating of binary profiles

A binary profile can be expressed by a vector with dimensions of 20, in which each element represents one kind of amino acid and can only take value of 0 or 1. When the element takes value of 1, it means that the corresponding amino acid can occur during evolution. Otherwise, it means that the corresponding amino acid cannot occur. A binary profile can also be expressed by a substring of amino acid combination, which is obtained by collecting each element of the vector with non-zero value. Each combination of the twenty amino acids corresponds to a binary profile and vice versa. Below we describe the process of generating the binary profiles.

The PSI-BLAST [47] is used to generate the profiles of amino acid sequences with parameters j = 3 and e = 0.001. The search is performed against the non-redundant database (NR) database from NCBI. The frequency profiles are directly obtained from the multiple sequence alignments outputted by PSI-BLAST. The target frequency reflects the probability of an amino acid occurrence in a given position of the sequences. The method of target frequency calculation is similar to that implemented in PSI-BLAST.

Because the frequency profile is a matrix of frequencies for all amino acids, it cannot be directly used and need to be converted into a binary profile by a probability threshold P h . When the frequency of an amino acid is larger than P h , it is converted into an integral value of 1, which means that the specified amino acid can occur in a given position of the protein sequence during evolution. Otherwise it is converted into 0. A substring of amino acid combination is then obtained by collecting the binary profile with non-zero value for each position of the protein sequences. These substrings have approximately represented the amino acids that possibly occur at a given sequence position during evolution. Fig. 4 has shown the process of generating binary profiles.
https://static-content.springer.com/image/art%3A10.1186%2F1471-2105-8-147/MediaObjects/12859_2007_Article_1519_Fig4_HTML.jpg
Figure 4

The flowchart of generating binary profiles. The multiple sequence alignment is obtained by PSI-BLAST. The frequency profile is calculated from the multiple sequence alignment and converted to a binary profile with a frequency threshold. The substring of amino acid combination is then collected.

Prediction

Support Vector Machine (SVM) is a class of supervised learning algorithms first introduced by Vapnik [62]. Given a set of labelled training vectors (positive and negative input examples), SVM can learn a linear decision boundary to discriminate between the two classes. The result is a linear classification rule that can be used to classify new test examples. SVM has exhibited excellent performance in practice and has strong theoretical foundation of statistical learning theory. Here the LIBSVM package [63] is used as the SVM implementation with radial basis function as kernel. The values of γ and regularization parameter C are set to be 0.005 and 1, respectively.

The input of SVM is a window containing a surface residue and its 12 spatially nearest surface residues [15]. An interface residue is defined as the positive sample, and a surface residue is defined as the negative sample. The input features are sequence profiles, accessible surface areas and propensities of residues in the window. The sequence profiles are taken from the Position-Specific Score Matrix (PSSM) outputted by PSI-BLAST [47]. All the input values are scaled between -1 and 1 before being inputted to the SVM.

It is known that SVM cannot perform well on an unbalanced dataset. In this dataset, only 27.3% of the surface residues are interface residues. If all surface residues are used in the training, the classifier will be biased to predict a residue as a surface residue. To address this issue, a set of surface residues is randomly selected to make the ratio of positive and negative data 1:1. Fivefold cross-validation is then used to evaluate the SVM. The whole dataset is randomly divided into five subgroups with an approximately equal number of chains. Each SVM runs five times with five different training and test sets. For each run, three of the subsets are used as the training set, one subset is used to select the optimal parameters and the remaining one is used as the test set.

Performance metrics

The following measures are used to evaluate the performances: precision, recall, accuracy, F1 and correlation coefficient (CC), which are defined as follows:
Precision = TP TP + FP MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacqqGqbaucqqGYbGCcqqGLbqzcqqGJbWycqqGPbqAcqqGZbWCcqqGPbqAcqqGVbWBcqqGUbGBcqGH9aqpdaWcaaqaaiabbsfaujabbcfaqbqaaiabbsfaujabbcfaqjabgUcaRiabbAeagjabbcfaqbaaaaa@41A1@
(8)
Recall = TP TP + FN MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacqqGsbGucqqGLbqzcqqGJbWycqqGHbqycqqGSbaBcqqGSbaBcqGH9aqpdaWcaaqaaiabbsfaujabbcfaqbqaaiabbsfaujabbcfaqjabgUcaRiabbAeagjabb6eaobaaaaa@3D56@
(9)
F 1 = 2 × Precision × Recall Precision + Recall MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacqqGgbGrcqaIXaqmcqGH9aqpdaWcaaqaaiabikdaYiabgEna0kabbcfaqjabbkhaYjabbwgaLjabbogaJjabbMgaPjabbohaZjabbMgaPjabb+gaVjabb6gaUjabgEna0kabbkfasjabbwgaLjabbogaJjabbggaHjabbYgaSjabbYgaSbqaaiabbcfaqjabbkhaYjabbwgaLjabbogaJjabbMgaPjabbohaZjabbMgaPjabb+gaVjabb6gaUjabgUcaRiabbkfasjabbwgaLjabbogaJjabbggaHjabbYgaSjabbYgaSbaaaaa@5D95@
(10)
Accuracy = TP + TN TP + TN + FP + FN MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacqqGbbqqcqqGJbWycqqGJbWycqqG1bqDcqqGYbGCcqqGHbqycqqGJbWycqqG5bqEcqGH9aqpdaWcaaqaaiabbsfaujabbcfaqjabgUcaRiabbsfaujabb6eaobqaaiabbsfaujabbcfaqjabgUcaRiabbsfaujabb6eaojabgUcaRiabbAeagjabbcfaqjabgUcaRiabbAeagjabb6eaobaaaaa@4998@
(11)
C C = TP × TN FP × FN ( TP + FN ) ( TP + FP ) ( TN + FP ) ( TN + FN ) MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacqWGdbWqcqWGdbWqcqGH9aqpdaWcaaqaaiabbsfaujabbcfaqjabgEna0kabbsfaujabb6eaojabgkHiTiabbAeagjabbcfaqjabgEna0kabbAeagjabb6eaobqaamaakaaabaGaeiikaGIaeeivaqLaeeiuaaLaey4kaSIaeeOrayKaeeOta4KaeiykaKIaeiikaGIaeeivaqLaeeiuaaLaey4kaSIaeeOrayKaeeiuaaLaeiykaKIaeiikaGIaeeivaqLaeeOta4Kaey4kaSIaeeOrayKaeeiuaaLaeiykaKIaeiikaGIaeeivaqLaeeOta4Kaey4kaSIaeeOrayKaeeOta4KaeiykaKcaleqaaaaaaaa@5AAE@
(12)

where TP is the number of true positives (interface residues correctly classified as interface residues), FP is the number of false positives (surface residues incorrectly classified as interface residues), TN is the number of true negatives (surface residues correctly classified as surface residues) and FN is the number of false negatives (interface residues incorrectly classified as surface residues).

Precision, recall and F1 are used to measure the performance of classifying interface residues, while accuracy is used to measure the performance of classifying the whole test dataset. Correlation coefficient (CC) is applied to measure the correlation between predictions and actual test data.

Declarations

Acknowledgements

The authors would like to thank Xuan Liu for her comments on this work that significantly improve the presentation of the paper. Financial support is provided by the National Natural Science Foundation of China (60673019 and 60435020).

Authors’ Affiliations

(1)
School of Computer Science and Technology, Harbin Institute of Technology

References

  1. Zhang Z, Grigorov MG: Similarity networks of protein binding sites. Proteins 2006, 62(2):470–478. 10.1002/prot.20752View ArticlePubMedGoogle Scholar
  2. Chelliah V, Chen L, Blundell TL, Lovell SC: Distinguishing structural and functional restraints in evolution in order to identify interaction sites. J Mol Biol 2004, 342(5):1487–1504. 10.1016/j.jmb.2004.08.022View ArticlePubMedGoogle Scholar
  3. Jones S, Thornton JM: Analysis of protein-protein interaction sites using surface patches. J Mol Biol 1997, 272(1):121–132. 10.1006/jmbi.1997.1234View ArticlePubMedGoogle Scholar
  4. Magliery TJ, Regan L: Sequence variation in ligand binding sites in proteins. BMC Bioinformatics 2005, 6: 240. 10.1186/1471-2105-6-240PubMed CentralView ArticlePubMedGoogle Scholar
  5. Lo Conte L, Chothia C, Janin J: The atomic structure of protein-protein recognition sites. J Mol Biol 1999, 285(5):2177–2198. 10.1006/jmbi.1998.2439View ArticlePubMedGoogle Scholar
  6. Bradford JR, Westhead DR: Improved prediction of protein-protein binding sites using a support vector machines approach. Bioinformatics 2005, 21(8):1487–1494. 10.1093/bioinformatics/bti242View ArticlePubMedGoogle Scholar
  7. Nooren IM, Thornton JM: Structural characterisation and functional significance of transient protein-protein interactions. J Mol Biol 2003, 325(5):991–1018. 10.1016/S0022-2836(02)01281-0View ArticlePubMedGoogle Scholar
  8. Bradford JR, Needham CJ, Bulpitt AJ, Westhead DR: Insights into protein-protein interfaces using a Bayesian network prediction method. J Mol Biol 2006, 362(2):365–386. 10.1016/j.jmb.2006.07.028View ArticlePubMedGoogle Scholar
  9. Chakrabarti P, Janin J: Dissecting protein-protein recognition sites. Proteins 2002, 47(3):334–343. 10.1002/prot.10085View ArticlePubMedGoogle Scholar
  10. Pils B, Copley RR, Schultz J: Variation in structural location and amino acid conservation of functional sites in protein domain families. BMC Bioinformatics 2005, 6: 210. 10.1186/1471-2105-6-210PubMed CentralView ArticlePubMedGoogle Scholar
  11. Lichtarge O, Bourne HR, Cohen FE: An evolutionary trace method defines binding surfaces common to protein families. J Mol Biol 1996, 257(2):342–358. 10.1006/jmbi.1996.0167View ArticlePubMedGoogle Scholar
  12. Morgan DH, Kristensen DM, Mittelman D, Lichtarge O: ET viewer: an application for predicting and visualizing functional sites in protein structures. Bioinformatics 2006, 22(16):2049–2050. 10.1093/bioinformatics/btl285View ArticlePubMedGoogle Scholar
  13. Yao H, Kristensen DM, Mihalek I, Sowa ME, Shaw C, Kimmel M, Kavraki L, Lichtarge O: An accurate, sensitive, and scalable method to identify functional sites in protein structures. J Mol Biol 2003, 326(1):255–261. 10.1016/S0022-2836(02)01336-0View ArticlePubMedGoogle Scholar
  14. Yao H, Mihalek I, Lichtarge O: Rank information: a structure-independent measure of evolutionary trace quality that improves identification of protein functional sites. Proteins 2006, 65(1):111–123. 10.1002/prot.21101View ArticlePubMedGoogle Scholar
  15. Chung JL, Wang W, Bourne PE: Exploiting sequence and structure homologs to identify protein-protein binding sites. Proteins 2006, 62(3):630–640. 10.1002/prot.20741View ArticlePubMedGoogle Scholar
  16. Cheng G, Qian B, Samudrala R, Baker D: Improvement in protein functional site prediction by distinguishing structural and functional constraints on protein family evolution using computational design. Nucleic Acids Res 2005, 33(18):5861–5867. 10.1093/nar/gki894PubMed CentralView ArticlePubMedGoogle Scholar
  17. Panchenko AR, Kondrashov F, Bryant S: Prediction of functional sites by analysis of sequence and structure conservation. Protein Sci 2004, 13(4):884–892. 10.1110/ps.03465504PubMed CentralView ArticlePubMedGoogle Scholar
  18. Valdar WS: Scoring residue conservation. Proteins 2002, 48(2):227–241. 10.1002/prot.10146View ArticlePubMedGoogle Scholar
  19. La D, Sutch B, Livesay DR: Predicting protein functional sites with phylogenetic motifs. Proteins 2005, 58(2):309–320. 10.1002/prot.20321View ArticlePubMedGoogle Scholar
  20. Kim Y, Subramaniam S: Locally defined protein phylogenetic profiles reveal previously missed protein interactions and functional relationships. Proteins 2006, 62(4):1115–1124. 10.1002/prot.20830View ArticlePubMedGoogle Scholar
  21. Liu AH, Zhang X, Stolovitzky GA, Califano A, Firestein SJ: Motif-based construction of a functional map for mammalian olfactory receptors. Genomics 2003, 81(5):443–456. 10.1016/S0888-7543(03)00022-3View ArticlePubMedGoogle Scholar
  22. Wang B, Chen P, Huang DS, Li JJ, Lok TM, Lyu MR: Predicting protein interaction sites from residue spatial sequence profile and evolution rate. FEBS Lett 2006, 580(2):380–384. 10.1016/j.febslet.2005.11.081View ArticlePubMedGoogle Scholar
  23. Yan C, Dobbs D, Honavar V: A two-stage classifier for identification of protein-protein interface residues. Bioinformatics 2004, 20(Suppl 1):I371-I378. 10.1093/bioinformatics/bth920View ArticlePubMedGoogle Scholar
  24. Bordner AJ, Abagyan R: REVCOM: a robust Bayesian method for evolutionary rate estimation. Bioinformatics 2005, 21(10):2315–2321. 10.1093/bioinformatics/bti347View ArticlePubMedGoogle Scholar
  25. Thibert B, Bredesen DE, Del Rio G: Improved prediction of critical residues for protein function based on network and phylogenetic analyses. BMC Bioinformatics 2005, 6(1):213. 10.1186/1471-2105-6-213PubMed CentralView ArticlePubMedGoogle Scholar
  26. Zhou HX, Shan Y: Prediction of protein interaction sites from sequence profile and residue neighbor list. Proteins 2001, 44(3):336–343. 10.1002/prot.1099View ArticlePubMedGoogle Scholar
  27. Meiler J, Baker D: ROSETTALIGAND: protein-small molecule docking with full side-chain flexibility. Proteins 2006, 65(3):538–548. 10.1002/prot.21086View ArticlePubMedGoogle Scholar
  28. Osterberg F, Morris GM, Sanner MF, Olson AJ, Goodsell DS: Automated docking to multiple target structures: incorporation of protein mobility and structural water heterogeneity in AutoDock. Proteins 2002, 46: 34–40. 10.1002/prot.10028View ArticlePubMedGoogle Scholar
  29. Laurie AT, Jackson RM: Q-SiteFinder: an energy-based method for the prediction of protein-ligand binding sites. Bioinformatics 2005, 21(9):1908–1916. 10.1093/bioinformatics/bti315View ArticlePubMedGoogle Scholar
  30. Zhang C, Liu S, Zhu Q, Zhou Y: A knowledge-based energy function for protein-ligand, protein-protein, and protein-DNA complexes. J Med Chem 2005, 48(7):2325–2335. 10.1021/jm049314dView ArticlePubMedGoogle Scholar
  31. Torrance JW, Bartlett GJ, Porter CT, Thornton JM: Using a library of structural templates to recognise catalytic sites and explore their evolution in homologous families. J Mol Biol 2005, 347(3):565–581. 10.1016/j.jmb.2005.01.044View ArticlePubMedGoogle Scholar
  32. Ivanisenko VA, Pintus SS, Grigorovich DA, Kolchanov NA: PDBSite: a database of the 3D structure of protein functional sites. Nucleic Acids Res 2005, (33 Database):D183–187.
  33. Wilczynski B, Hvidsten TR, Kryshtafovych A, Tiuryn J, Komorowski J, Fidelis K: Using local gene expression similarities to discover regulatory binding site modules. BMC Bioinformatics 2006, 7: 505. 10.1186/1471-2105-7-505PubMed CentralView ArticlePubMedGoogle Scholar
  34. Snyder KA, Feldman HJ, Dumontier M, Salama JJ, Hogue CW: Domain-based small molecule binding site annotation. BMC Bioinformatics 2006, 7: 152. 10.1186/1471-2105-7-152PubMed CentralView ArticlePubMedGoogle Scholar
  35. Neuvirth H, Raz R, Schreiber G: ProMate: a structure based prediction program to identify the location of protein-protein binding sites. J Mol Biol 2004, 338(1):181–199. 10.1016/j.jmb.2004.02.040View ArticlePubMedGoogle Scholar
  36. Res I, Mihalek I, Lichtarge O: An evolution based classifier for prediction of protein interfaces without using protein structures. Bioinformatics 2005, 21(10):2496–2501. 10.1093/bioinformatics/bti340View ArticlePubMedGoogle Scholar
  37. Yan C, Terribilini M, Wu F, Jernigan RL, Dobbs D, Honavar V: Predicting DNA-binding sites of proteins from amino acid sequence. BMC Bioinformatics 2006, 7: 262. 10.1186/1471-2105-7-262PubMed CentralView ArticlePubMedGoogle Scholar
  38. Liang S, Zhang C, Liu S, Zhou Y: Protein binding site prediction using an empirical scoring function. Nucleic Acids Res 2006, 34(13):3698–3707. 10.1093/nar/gkl454PubMed CentralView ArticlePubMedGoogle Scholar
  39. Rossi A, Marti-Renom MA, Sali A: Localization of binding sites in protein structures by optimization of a composite scoring function. Protein Sci 2006.Google Scholar
  40. Down T, Leong B, Hubbard TJ: A machine learning strategy to identify candidate binding sites in human protein-coding sequence. BMC Bioinformatics 2006, 7: 419. 10.1186/1471-2105-7-419PubMed CentralView ArticlePubMedGoogle Scholar
  41. Deng H, Chen G, Yang W, Yang JJ: Predicting calcium-binding sites in proteins – a graph theory and geometry approach. Proteins 2006, 64(1):34–42. 10.1002/prot.20973View ArticlePubMedGoogle Scholar
  42. Chen H, Zhou HX: Prediction of interface residues in protein-protein complexes by a consensus neural network method: test against NMR data. Proteins 2005, 61(1):21–35. 10.1002/prot.20514View ArticlePubMedGoogle Scholar
  43. Dubey A, Realff MJ, Lee JH, Bommarius AS: Support vector machines for learning to identify the critical positions of a protein. J Theor Biol 2005, 234(3):351–361. 10.1016/j.jtbi.2004.11.037View ArticlePubMedGoogle Scholar
  44. Koike A, Takagi T: Prediction of protein-protein interaction sites using support vector machines. Protein Eng Des Sel 2004, 17(2):165–173. 10.1093/protein/gzh020View ArticlePubMedGoogle Scholar
  45. Li MH, Lin L, Wang XL, Liu T: Protein-protein interaction site prediction based on conditional random fields. Bioinformatics 2007. To be publishedView ArticleGoogle Scholar
  46. Ofran Y, Rost B: Analysing six types of protein-protein interfaces. J Mol Biol 2003, 325(2):377–387. 10.1016/S0022-2836(02)01223-8View ArticlePubMedGoogle Scholar
  47. Altschul SF, Madden TL, Schaffer AA, Zhang JH, Zhang Z, Miller W, Lipman DJ: Gapped Blast and Psi-blast: a new generation of protein database search programs. Nucleic Acids Research 1997, 25(17):3389–3402. 10.1093/nar/25.17.3389PubMed CentralView ArticlePubMedGoogle Scholar
  48. Dong Q, Wang XL, Lin L, Xu Z: Domain boundary prediction based on profile domain linker propensity index. Comput Biol Chem 2006, 30(2):127–133.View ArticlePubMedGoogle Scholar
  49. Dong Qw, Wang Xl, Lin L: Novel knowledge-based mean force potential at the profile level. BMC Bioinformatics 2006, 7: 324. 10.1186/1471-2105-7-324PubMed CentralView ArticlePubMedGoogle Scholar
  50. Dong QW, Wang XL, Lin L: Protein remote homology detection based on binary profiles. 1st International Conference on Bioinformatics Research and Development BIRD/LNBI 2007. To be publishedGoogle Scholar
  51. Ofran Y, Rost B: Predicted protein-protein interaction sites from local sequence information. FEBS Lett 2003, 544(1–3):236–239. 10.1016/S0014-5793(03)00456-3View ArticlePubMedGoogle Scholar
  52. Sander C, Schneider R: Database of homology-derived protein structures and the structural meaning of sequence alignment. Proteins 1991, 9(1):56–68. 10.1002/prot.340090107View ArticlePubMedGoogle Scholar
  53. Karlin S, Brocchieri L: Evolutionary conservation of RecA genes in relation to protein structure and function. J Bacteriol 1996, 178(7):1881–1894.PubMed CentralPubMedGoogle Scholar
  54. Valdar WS, Thornton JM: Protein-protein interfaces: analysis of amino acid conservation in homodimers. Proteins 2001, 42(1):108–124. 10.1002/1097-0134(20010101)42:1<108::AID-PROT110>3.0.CO;2-OView ArticlePubMedGoogle Scholar
  55. Kouranov A, Xie L, de la Cruz J, Chen L, Westbrook J, Bourne PE, Berman HM: The RCSB PDB information portal for structural genomics. Nucleic Acids Res 2006, (34 Database):D302–305. 10.1093/nar/gkj120
  56. Bordner AJ, Abagyan R: Statistical analysis and prediction of protein-protein interfaces. Proteins 2005, 60(3):353–366. 10.1002/prot.20433View ArticlePubMedGoogle Scholar
  57. Henrick K, Thornton JM: PQS: a protein quaternary structure file server. Trends Biochem Sci 1998, 23(9):358–361. 10.1016/S0968-0004(98)01253-5View ArticlePubMedGoogle Scholar
  58. Nooren IM, Thornton JM: Diversity of protein-protein interactions. Embo J 2003, 22(14):3486–3492. 10.1093/emboj/cdg359PubMed CentralView ArticlePubMedGoogle Scholar
  59. Wu CH, Apweiler R, Bairoch A, Natale DA, Barker WC, Boeckmann B, Ferro S, Gasteiger E, Huang H, Lopez R, et al.: The Universal Protein Resource (UniProt): an expanding universe of protein information. Nucleic Acids Res 2006, (34 Database):D187–191. 10.1093/nar/gkj161
  60. Xenarios I, Salwinski L, Duan XJ, Higney P, Kim SM, Eisenberg D: DIP, the Database of Interacting Proteins: a research tool for studying cellular networks of protein interactions. Nucleic Acids Res 2002, 30(1):303–305. 10.1093/nar/30.1.303PubMed CentralView ArticlePubMedGoogle Scholar
  61. Kabsch W, Sander C: Dictionary of Secondary structure in Proteins: Pattern Recognition of Hydrogenbonded and Geometrical Features. Biopolymers 1983, 22(12):2577–2637. 10.1002/bip.360221211View ArticlePubMedGoogle Scholar
  62. Vapnik VN: Statistical learning theory. New York: Wiley; 1998.Google Scholar
  63. Chang CC, Lin CJ: LIBSVM: a library for support vector machines.2001. [http://www.csie.ntu.edu.tw/~cjlin/libsvm]Google Scholar

Copyright

© Dong et al; licensee BioMed Central Ltd. 2007

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Advertisement