Systems Biology Approaches to Mining High Throughput Biological DataView this Special Issue
Research Article | Open Access
Jianzhu Ma, Sheng Wang, "AcconPred: Predicting Solvent Accessibility and Contact Number Simultaneously by a Multitask Learning Framework under the Conditional Neural Fields Model", BioMed Research International, vol. 2015, Article ID 678764, 10 pages, 2015. https://doi.org/10.1155/2015/678764
AcconPred: Predicting Solvent Accessibility and Contact Number Simultaneously by a Multitask Learning Framework under the Conditional Neural Fields Model
Motivation. The solvent accessibility of protein residues is one of the driving forces of protein folding, while the contact number of protein residues limits the possibilities of protein conformations. The de novo prediction of these properties from protein sequence is important for the study of protein structure and function. Although these two properties are certainly related with each other, it is challenging to exploit this dependency for the prediction. Method. We present a method AcconPred for predicting solvent accessibility and contact number simultaneously, which is based on a shared weight multitask learning framework under the CNF (conditional neural fields) model. The multitask learning framework on a collection of related tasks provides more accurate prediction than the framework trained only on a single task. The CNF method not only models the complex relationship between the input features and the predicted labels, but also exploits the interdependency among adjacent labels. Results. Trained on 5729 monomeric soluble globular protein datasets, AcconPred could reach 0.68 three-state accuracy for solvent accessibility and 0.75 correlation for contact number. Tested on the 105 CASP11 domain datasets for solvent accessibility, AcconPred could reach 0.64 accuracy, which outperforms existing methods.
The solvent accessibility of a protein residue is the surface area of the residue that is accessible to a solvent, which was first described by Lee and Richards  in 1971. During the process of protein folding, the residue solvent accessibility plays a very important role as it is related to the spatial arrangement and packing of the protein , which is depicted as the hydrophobic effect . Specifically, the trends of the hydrophobic residues to be buried in the interior of the protein and the hydrophilic residues to be exposed to the solvent form the hydrophobic effect that functions as the driving force for the folding of monomeric soluble globular proteins [4–6].
Solvent accessibility can help protein structure prediction in two aspects. Since solvent accessibility is calculated on all-atom protein structure coordinates, it encodes the global information of the 3D protein structure into a 1D feature, which makes solvent accessibility as an excellent piece of complementary information to the other local 1D features such as secondary structure [7–9], structural alphabet [10–12], or backbone torsion angles [13–15]. Compared to the other global information such as the contact map [16, 17] or the distance map [18, 19], solvent accessibility shares similar property of the other local 1D feature that it could be predicted into a relatively accurate level . Therefore, the predicted solvent accessibility has been widely utilized for detection as well as threading of remote homologous proteins [21–23] and quality assessment of protein models [24, 25].
The contact number is yet another kind of 1D feature that encodes the 3D information, which is related to, but different from, solvent accessibility . The contact number of a protein residue is actually the result of protein folding. It has been suggested that, given the contact number for each residue, the possibilities of protein conformations that satisfy the contact number constraints are very limited . Thus, the predicted contact numbers of a protein may serve as useful restraints for de novo structure prediction  or contact map prediction .
To predict the protein solvent accessibility, most methods first discretize it into two- or three-state labels based on the continuous relative solvent accessibility value . Then these methods apply a variety of learning approaches for the prediction, such as neural networks [29–34], SVM (support vector machine) [35–37], Bayesian statistics , and nearest neighbor [20, 39]. Some other methods also attempt to directly predict the continuous absolute or relative solvent accessibility value [14, 34, 40–42].
Comparing with the solvent accessibility prediction, there are much fewer methods that deal with the prediction of contact number. For example, Kinjo et al.  employ linear regression analysis, Pollastri et al.  use neural networks, and Yuan  applies SVM.
Since a high dependency between the adjacent labels for both solvent accessibility and contact number exists , it is hard to utilize this information based on the previous proposed computational methods. For instance, neural network methods usually do not take the interdependency relationship among the labels of adjacent residues into consideration. Similarly, it is also challenging for SVM to deal with this dependency information . Although hidden Markov model (HMM)  is capable of describing this dependency, it is challenging for HMM to model the complex nonlinear relationship between input protein features and the predicted solvent accessibility labels, especially when a large amount of heterogeneous protein features is available .
Recently, ACCpro5  could reach almost perfect prediction of protein solvent accessibility by the aid of structural similarity in the protein template database. However, such approach might not perform well on those de novo folds or the sequences that cannot find any similar proteins in the database.
Although solvent accessibility and contact number are two different quantities, they are certainly related with each other, both reflecting the hydrophobic or hydrophilic atmosphere of each residue in the protein structure . For example, a residue with a large contact number would probably be buried inside the core, whereas a residue with a small contact number would probably be exposed to the solvent. Therefore, a learning approach that could utilize this relationship to extract the universal representation of the features would be beneficial.
Here we present AcconPred (solvent accessibility and contact number prediction), available at http://ttic.uchicago.edu/~majianzhu/AcconPred_package_v1.00.tar.gz based on a shared weight multitask learning framework under the CNF (conditional neural fields) model. As a recently invented probabilistic graphical model, CNF  has been used for a variety of bioinformatics tasks [21–23, 45, 48–52]. Specifically, CNF is a perfect integration of CRF (Conditional Random Fields)  and neural networks. Besides modeling the nonlinear relationship between the input protein features and the predicted labels as what neural network does, CNF can also model the interdependency among adjacent labels as what CRF does.
It has been shown that a unified neural network architecture, trained simultaneously on a collection of related tasks, provides more accurate labelings than a network trained only on a single task . A study by Caruana thus demonstrates the power of multitask learning that could extract the universal representation of the input features . In AcconPred, we integrate multitask learning framework under the CNF model by sharing the weight of the neuron functions between the two tasks, followed by a stochastic gradient descent for training the parameters.
Last but not least, AcconPred can provide a probability distribution over all the possible labels. That is, instead of predicting a single label at each residue, AcconPred will generate the label probability distribution for solvent accessibility and contact number. Our testing data shows that AcconPred achieves better accuracy on solvent accessibility prediction and higher correlation on contact number prediction than the other methods.
2.1. Preliminary Definition
2.1.1. Calculating Solvent Accessibility from Native Protein Structure
We applied DSSP  to calculate the absolute accessible surface area for each residue in a protein. The relative solvent accessibility (RSA) of the residue X is calculated through dividing the absolute accessible surface area by the maximum solvent accessibility which uses Gly-X-Gly extended tripeptides . In particular, these values are 210 (Phe), 175 (Ile), 170 (Leu), 155 (Val), 145 (Pro), 115 (Ala), 75 (Gly), 185 (Met), 135 (Cys), 255 (Trp), 230 (Tyr), 140 (Thr), 115 (Ser), 180 (Gln), 160 (Asn), 190 (Glu), 150 (Asp), 195 (His), 200 (Lys), and 225 (Arg), in units of Å2.
With the relative solvent accessibility value, the classification was divided into three states, say, buried (B), intermediate (I), and exposed (E), as in the literatures [14, 20]. In this work, the usage of 10% for B/I and 40% for I/E in the 3-state definition is based on the following two facts: such division is close to the definition of previous method ; at this cutoff, the background distribution for the three states in our training data is close to 1 : 1 : 1. A more comprehensive interpretation for this 10%/40% threshold is described in Results and shown in Figure 2.
2.1.2. Calculating Contact Number from Native Protein Structure
To calculate the contact number for each residue, we followed similar definition from previous works [26, 43]. Basically, the contact number (CN) of the th residue in a protein structure is the number of C-beta atoms from the other residues (excluding 5 nearest-neighbor residues) within the sphere of the radius 7.5 Å centered at the C-beta atom of the th residue. We also limit the maximal contact number as 14 if the observed contact number is above 14, because such cases are rare in our training data. So for each residue, there are 15 states of contact number in total.
2.2.1. Training and Validation Data
Training and validation data were extracted from all monomeric, globular, and nonmembrane protein structures. They were downloaded from Protein Data Bank (PDB)  dated before May 1, 2014. The monomeric proteins were extracted according to the “Remark 350 Author Determined Biological Unit: Monomeric” recorded in the PDB file. To exclude those nonglobular proteins, we calculated the buried residue ratio (i.e., the percentage of the residues in buried state) for each protein and removed those proteins with <10% buried residue ratio. To exclude those membrane proteins, the PDBTM database  was employed.
The reason for using monomeric protein to predict solvent accessibility is based on the fact that the patterns in the surface of the monomeric proteins are different from those in the interface of the oligomeric proteins . Again, the reason why we exclude the membrane proteins is that they have the opposite solvent accessibility pattern to those monomeric, globular soluble proteins. Furthermore, the 10% buried residue ratio cutoff was derived from statistics for the globular protein database .
Finally, we excluded proteins with length less than 50, having chain-breaks in the middle, and the 40% sequence identity was applied to remove redundancy. So in total we have 5729 monomeric, globular, and nonmembrane protein structures as our training and validation dataset (5-cross validation). The 5729 PDB IDs included in the training and validation datasets could be found in the Supplementary Material available online at http://dx.doi.org/10.1155/2015/678764.
2.2.2. Testing Data
The testing data were collected from the CASP11  targets containing 105 domains. Note that all CASP11 targets were released after May 1, 2014. The PDB structures for the 105 CASP11 testing datasets could be found in the Supplementary Files.
In order to compare with the existing programs, we further included the dataset from Yuan  as the testing data for contact number prediction. The 945 PDB IDs included in the Yuan dataset could be found in the Supplementary Files.
2.3. Protein Features
A variety of protein features have been studied by [14, 29–32, 41, 62, 63] to predict the solvent accessibility or the contact number. They could be categorized into three classes: evolution related, structure related, and amino acid related features, which will form our feature vector for residue . Furthermore, since the solvent accessibility or the contact number for a certain residue could be influenced by its nearby residues in sequence, we then introduce a windows size to capture this information. That is, we take the feature vectors from as the final input features for residue . In this work we set the windows size .
2.3.1. Evolution Related Features
Solvent accessibility as well as contact number of a residue has a strong relationship with the residue’s substitution and evolution. Residues in the buried core and residues on the solvent-exposed surfaces were shown to have different substitution patterns due to different selection pressure . Evolution information such as PSSM (position specific scoring matrix) and PSFM (position specific frequency matrix) generated by PSI-BLAST  has been used and proved to enhance the prediction performance. Here we use different evolution information from the HHM file generated by HHpred . In particular, it first invokes PSI-BLAST with five iterations and -value 0.001 and then computes the homology information for each residue combined with a context-specific background probability . Overall, for each residue, we have evolution related features.
2.3.2. Structure Related Features
Local structural features are also very useful in predicting solvent accessibility, as indicated in . Here we use the predicted secondary structure elements (SSEs) probability as the structure related features for each residue position. In particular, we use both 3-class and 8-class SSEs. The 3-class SSE is predicted by PSIPRED  which is more accurate but contains less information, while the 8-class secondary structure element is predicted by RaptorX-SS8  which is less accurate but contains more information. Overall, for each residue, we have structure related features.
2.3.3. Amino Acid Related Features
Besides using position dependent evolutionary and structural features, we also use position independent features such as (a) physicochemical property, (b) specific propensity of being endpoints of an SS segment, and (c) correlated contact potential, for each amino acid. Specifically, physicochemical property has 7 values for each amino acid (shown in Table 1 from ); specific propensity of being endpoints of an SS segment has 11 values for each amino acid (shown in Table 1 from ); correlated contact potential has 40 values for each amino acid (shown in Table 3 from ). All these features have been studied in  for secondary structure elements prediction and in [21–23] for homology detection. Overall, for each residue, we have amino acid dependent features.
2.4. Prediction Method
2.4.1. CNF Model
Conditional neural fields (CNF)  are probabilistic graphical models that have been extensively used in modeling sequential data [45, 49]. Given features on each residue on a protein sequence, we could compute the probability of each label for one residue and the transition probability for neighboring residues. Formally, for a given protein with length , we denote its predicted labels (say, 3-state solvent accessibility or 15-state contact number) as , where , for solvent accessibility prediction, and for contact number prediction. We also represent the input features of a given protein by an matrix , where represents the number of hidden neurons and the th column vector represents the protein feature vector associated with the th residue, defined in the previous section. Then we can formulize the conditional probability of the predicted labels on protein feature matrix as follows: where is the potential function defined on an edge connecting two nodes; is the potential function defined at the position ; is a hidden neuron function that does nonlinear transformation of input protein features; is the window size. Formally, and are defined as follows:where is an indicator function; represents the final input features for residue ; , , and are model parameters to be trained. Specifically, is the parameter from the input features to hidden neuron nodes, from neuron to label, and from label to label, respectively; and represent predicted labels (see Figure 1). The details for the training and prediction of the CNF model could be found in . One beneficial result of CNF is the probability output for each label at a position through a MAP (maximum a posteriori) procedure. These probabilities, generated by CNF models trained by different combinations of feature classes, could be further utilized as features for training a consensus CNF model.
2.4.2. Multitask Learning Framework
Multitask learning (MTL) has recently attracted extensive research interest in the data mining and machine learning community [71–74]. It has been observed that learning multiple related tasks simultaneously often improves predicted accuracy . Inspired by , a variety of functionally important protein properties, such as secondary structure and solvent accessibility, can be encoded as a labeling of amino acids and trained in multitask simultaneously under a deep neural network framework . Here we propose a similar procedure for learning two tasks, say solvent accessibility and contact number, under a weight sharing CNF framework.
Specifically, assuming we have related tasks, the “weight sharing” strategy implies that the parameters for the function are shared between tasks. That is to say, the hidden neuron function that does nonlinear transformation of input protein features is shared for predicting solvent accessibility and contact number. The whole CNF framework includes the parameters for each task . With this setup (i.e., only the neuron to label function and the label to label function are task-specific), the CNF framework automatically learns an embedding that generalizes across tasks in the first hidden neuron layers and learns features specific for the desired tasks in the second layers.
When using stochastic gradient descent to train the model parameters, we could carry out the following three steps: (a) select a task at random, (b) select a random training example for this task, and (c) compute the gradients of the CNF attributed to this task with respect to this example and update the parameters. Again, the probabilities generated by CNF models trained for different task could be utilized as features for training a consensus CNF model for a single task.
We evaluate our program AcconPred on two prediction tasks, say solvent accessibility prediction and contact number prediction, on our own training data and CASP11 testing data. For contact number prediction, in order to compare with the existing programs, we further include the Yuan  dataset as the testing data. Besides using accuracy as the measurement for both solvent accessibility and contact number, we also use the following evaluation metrics for solvent accessibility, which includes precision (defined as ), recall (defined as ), and F1 score (defined as ), where , , , and are the numbers of the true positives, true negatives, false positives, and false negatives for a given dataset, respectively. To evaluate the performance of contact number, we also calculate the Pearson correlation between the predicted and the observed values.
In the following sections, we first give an interpretation of the 10%/40% threshold that defines the 3-state solvent accessibility. Then we evaluate the performance of AcconPred on the training data. Followed by briefly describing the programs to be compared, we show the outperformance of AcconPred with the existing programs on the testing data, which includes CASP11 and Yuan dataset.
3.1. Interpretation of the 10%/40% Threshold That Defines the 3-State Solvent Accessibility
Traditionally, predicting solvent accessibility using machine learning models is regarded as either 2, 3, or 10 labels of classification problem or a real value regression problem. There is no widely accepted criterion on how to classify the real value solvent accessibility into a finite number of discrete states such as buried, intermediate, and exposed. The reason is that, in a classification problem, with fewer labels we could get a more accurate prediction but at the same time lose lots of information by merging adjacent classes. This fact still holds between classification and regression because regression could be recognized as a kind of infinite labels prediction task with lower accuracy comparing with classification under the same situation.
Therefore, it is a tradeoff between using fewer labels of less information and using more labels less accurate. In addition, even for the same number of labels in the classification problem, the boundary for each label still needs to be finely determined. Remember that solvent accessibility represents the relative buried degree of one residue in the whole 3D protein so it is possible for two aligned residues on two structural related proteins to have different real value of accessibility in some range. To decide the range of each label is equal to giving a standard to judge if two residues with different solvent accessibilities can be aligned together.
In this work, the three discrete states on relative solvent accessibility with boundaries at 10% and 40% are used (see Figure 2). We could give an interpretation for such boundaries by all-against-all protein pairwise structure alignments [76–79] on our training data. Followed by filtering out the pairs with TM-score  lower than 0.65 which indicates that the two proteins have no obvious biological relevance , we calculate the log-odds ratio between the pair frequencies in the remaining structure alignments and the background frequencies, with respect to the relative solvent accessibility in 1% unit. As shown in Figure 2, the area with more red color means that the corresponding two relative solvent accessibilities on two aligned proteins have more chance to coappear in the structure alignments, while the area with more blue color is vice versa. As a result, it can be concluded that, under such boundaries, the within-class distance is low (with more yellow or red points), while the between-class distance is high (with more cyan or blue area).
3.2. Performance on Training Data
3.2.1. Results for 3-State Solvent Accessibility Prediction
(1) Precision, Recall, and F1 Score for Each Predicted Label. Table 1 gives detailed results for each label of solvent accessibility prediction, say buried, intermediate, and exposed. Besides the overall analysis in terms of precision, recall, and F1 score, we also provide the subset analysis of the predicted label which is chosen according to the predicted probability. From this table, we observe that when predicted probability is above 0.8, both the predicted buried label and exposed label could reach about 0.9 accuracy. However, the prediction of the intermediate label is least accurate, which can be probably expected from the arbitrariness of the threshold between the three states .
|Overall indicates the whole set of the predicted labels.|
‡>0.9 indicates that the set of the predicted labels is chosen according to the predicted probability which is larger than 0.9.
(2) Relative Importance of the Three Classes of Features. As mentioned in the previous section, the features used in the training process consist of three classes: evolution related, structure related, and amino acid related, respectively. In order to estimate the impact of each class on 3-state solvent accessibility prediction, we apply each of them to train the model and perform the prediction. Table 2 illustrates the prediction accuracy of different feature classes and different learning models, including single task learning model and multitask learning model. It could be observed that using amino acid related feature alone could reach 0.55 Q3 accuracy, and this accuracy could be largely increased by using the evolution related feature alone. It is interesting that although the structure related features are actually derived from the evolutionary information, the combination of all these three classes of features could reach 0.66 Q3 accuracy. Finally, we show that the performance improvement could be gained by performing multitask learning for 2% accuracy.
|Combined single indicates that all classes of features, including evolution, structure, and amino acid, are used for training a single task model.|
‡Combined MTL indicates that all classes of features are used for training a multitask learning model.
3.2.2. Results for 15-State Contact Number Prediction
Table 3 illustrates the prediction accuracy of different feature classes and different learning models for 15-state contact number, with the same trend in Table 2 in 3-state solvent accessibility perdition. It should be noted that if the difference between the predicted contact number and the observed value is only 1 or 2, we still could tolerate the result. Table 4 shows the prediction accuracy of different tolerance values, ranging from 0 to 3. If 1, 2, or 3 differences between the predicted contact number and the observed value are tolerated, the accuracy could reach 0.63, 0.83, and 0.93, respectively. The Pearson correlation score of AcconPred on the training data is 0.75.
3.3. Performance on Testing Data
3.3.1. The Existing Programs to Be Compared
We compare AcconPred with three popular solvent accessibility prediction programs, say SPINE-X , SANN , and ACCpro5 , as well as two contact number prediction programs, say Kinjo’s method  and Yuan’s method . For solvent accessibility prediction, SPINE-X is a neural network based method, whereas SANN is based on nearest neighbor. In contrast to these two methods that rely on protein sequence information alone, ACCpro5 exploits the additional structural information derived from PDB. For contact number prediction, both Kinjo’s and Yuan’s methods extract features from protein sequence information. However, Kinjo’s method applies linear regression for the prediction, while Yuan’s method employs SVM method.
3.3.2. Results on CASP11 Data
Table 5 summarizes the results of three existing and well-known methods (say, SPINE-X, SANN, and ACCpro5, resp.) for predicting the 3-state solvent accessibility on the CASP11 105 domain cases. It should be noted that the original 3-state output of SPINE-X is based on the 25%/75% threshold, while SANN is 9%/36%. However, besides the discretized output, both SPINE-X and SANN also output predicted continuous relative solvent accessibility that ranges from 0 to 100%. So we use the same 10%/40% threshold as AcconPred to relabel the output from SPINE-X and SANN. Furthermore, the original output of ACCpro5 is 2-state which cut at 25%. Nonetheless, ACCpro5 also generates 20-state relative solvent accessibility at all thresholds between 0% and 95% at 5% increments. So in this case we could also easily transform the output of ACCpro5 into the 3-state at 10%/40% threshold. We observe that AcconPred could reach 0.65 Q3 accuracy, which is higher than SPINE-X, SANN, and ACCpro5 whose Q3 accuracies are 0.57, 0.61, and 0.58, respectively. All detailed results from SPINE-X, SANN, and ACCpro5 could be found in Supplementary Files.
We also calculate the Q15 prediction accuracy and correlation of AcconPred for 15-state contact number on CASP11 data. The results are 0.28 for Q15 and 0.71 for correlation, which is quite consistent with the results from the training data (0.3 for Q15 and 0.74 for correlation) and the Yuan data (0.28 for Q15 and 0.72 for correlation).
3.3.3. Results on Yuan Data
Since the software of both Kinjo’s method and Yuan’s method is not available, we perform AcconPred on the training set from Yuan. It should be noted that the Yuan data (containing 945 PDB chains) were also the training data for Kinjo’s method . Because the same dataset is used for contact number prediction, we could directly extract the results of Kinjo’s method and Yuan’s method from their paper for the comparison analysis. Table 6 summarizes the correlation results for Kinjo’s method, Yuan’s method, and AcconPred. We observe that our proposed method AcconPred outperforms the other methods significantly. The correlation score of AcconPred is 0.72, which is better than Kinjo’s method (correlation score is 0.63) and Yuan’s method (correlation score is 0.64).
4. Discussion and Future Work
In this work, we have presented AcconPred for predicting the 3-state solvent accessibility as well as the 15-state contact number for a given protein sequence. The method is based on a shared weight multitask learning framework under the CNF model. The overall performance of AcconPred for both solvent accessibility and contact number prediction is significantly better than the state-of-the-art methods.
There are two reasons why AcconPred could achieve this performance. The CNF model not only captures the complex nonlinear relationship between the input protein features and the predicted labels, but also exploits interdependence among adjacent labels [45, 47]. The shared weight multitask learning framework could incorporate the information of both solvent accessibility and contact number simultaneously during training .
Furthermore, the CNF model defines a probability distribution over the label space. The probability distribution, generated by CNF models trained on different combinations of feature classes (shown in Tables 2 and 3) for both solvent accessibility and contact number, could be further applied as the input feature to train a regression neural network model for predicting the continuous relative solvent accessibility. Meanwhile, the predicted contact number probability alone could be applied as topology constraints for the contact map prediction. It is suggested that the same framework of AcconPred could be applied to predict 10-state relative solvent accessibility, with 10% at each interval. Similar as in Table 4, we could also measure the prediction accuracy of different tolerance values for 10-state solvent accessibility.
Another uniqueness of our work is the training data, which excludes those “outlier” cases for solvent accessibility training, such as oligomer, membrane, and nonglobular proteins. This is because of the fact that these proteins have quite different solvent accessibility patterns with the monomeric soluble globular proteins. Recently,  pointed out that there were preferred chemical patterns of closely packed residues at the protein-protein interface. It implies that our training data that contains monomeric soluble globular proteins could serve as a control set for protein-protein interface prediction.
Conflict of Interests
The authors declare that there is no conflict of interests regarding the publication of this paper.
Training/testing dataset as well as the CASP11 evaluation dataset could be found in the Supplementary Material. The CASP11 evaluation dataset contains all detailed results from SPINE-X, SANN, ACCpro5 and AcconPred.
- B. Lee and F. M. Richards, “The interpretation of protein structures: estimation of static accessibility,” Journal of Molecular Biology, vol. 55, no. 3, pp. 379–400, 1971.
- W. Kauzmann, “Some factors in the interpretation of protein denaturation,” in Advances in Protein Chemistry, vol. 14, pp. 1–63, 1959.
- K. A. Dill, “Dominant forces in protein folding,” Biochemistry, vol. 29, no. 31, pp. 7133–7155, 1990.
- C. Chothia, “Structural invariants in protein folding,” Nature, vol. 254, no. 5498, pp. 304–308, 1975.
- G. D. Rose, A. R. Geselowitz, G. J. Lesser, R. H. Lee, and M. H. Zehfus, “Hydrophobicity of amino acid residues in globular proteins,” Science, vol. 229, no. 4716, pp. 834–838, 1985.
- K. A. Sharp, “Extracting hydrophobic free energies from experimental data: relationship to protein folding and theoretical models,” Biochemistry, vol. 30, no. 40, pp. 9686–9697, 1991.
- W. Kabsch and C. Sander, “Dictionary of protein secondary structure: pattern recognition of hydrogen-bonded and geometrical features,” Biopolymers—Peptide Science Section, vol. 22, no. 12, pp. 2577–2637, 1983.
- L. J. McGuffin, K. Bryson, and D. T. Jones, “The PSIPRED protein structure prediction server,” Bioinformatics, vol. 16, no. 4, pp. 404–405, 2000.
- D. Frishman and P. Argos, “Knowledge‐based protein secondary structure assignment,” Proteins: Structure, Function, and Bioinformatics, vol. 23, no. 4, pp. 566–579, 1995.
- A. G. de Brevern, C. Etchebest, and S. Hazout, “Bayesian probabilistic approach for predicting backbone structures in terms of protein blocks,” Proteins: Structure, Function, and Bioinformatics, vol. 41, no. 3, pp. 271–287, 2000.
- W.-M. Zheng and X. Liu, “A protein structural alphabet and its substitution matrix CLESUM,” in Transactions on Computational Systems Biology II, vol. 3680 of Lecture Notes in Comput. Sci., pp. 59–67, Springer, Berlin, Germany, 2005.
- I. Budowski-Tal, Y. Nov, and R. Kolodny, “FragBag, an accurate representation of protein structure, retrieves structural neighbors from the entire PDB quickly and accurately,” Proceedings of the National Academy of Sciences of the United States of America, vol. 107, no. 8, pp. 3481–3486, 2010.
- G. J. Kleywegt and T. A. Jones, “Phi/Psi-chology: ramachandran revisited,” Structure, vol. 4, no. 12, pp. 1395–1400, 1996.
- E. Faraggi, B. Xue, and Y. Zhou, “Improving the prediction accuracy of residue solvent accessibility and real-value backbone torsion angles of proteins by guided-learning through a two-layer neural network,” Proteins: Structure, Function and Bioinformatics, vol. 74, no. 4, pp. 847–856, 2009.
- Y. Shen, F. Delaglio, G. Cornilescu, and A. Bax, “TALOS+: a hybrid method for predicting protein backbone torsion angles from NMR chemical shifts,” Journal of Biomolecular NMR, vol. 44, no. 4, pp. 213–223, 2009.
- D. T. Jones, D. W. A. Buchan, D. Cozzetto, and M. Pontil, “PSICOV: precise structural contact prediction using sparse inverse covariance estimation on large multiple sequence alignments,” Bioinformatics, vol. 28, no. 2, Article ID btr638, pp. 184–190, 2012.
- M. Vendruscolo, R. Najmanovich, and E. Domany, “Protein folding in contact map space,” Physical Review Letters, vol. 82, no. 3, pp. 656–659, 1999.
- L. Holm and C. Sander, “Protein structure comparison by alignment of distance matrices,” Journal of Molecular Biology, vol. 233, no. 1, pp. 123–138, 1993.
- F. Zhao and J. Xu, “A position-specific distance-dependent statistical potential for protein structure and functional study,” Structure, vol. 20, no. 6, pp. 1118–1126, 2012.
- K. Joo, S. J. Lee, and J. Lee, “Sann: solvent accessibility prediction of proteins by nearest neighbor method,” Proteins: Structure, Function and Bioinformatics, vol. 80, no. 7, pp. 1791–1797, 2012.
- J. Ma, S. Wang, F. Zhao, and J. Xu, “Protein threading using context-specific alignment potential,” Bioinformatics, vol. 29, no. 13, pp. i257–i265, 2013.
- J. Ma, J. Peng, S. Wang, and J. Xu, “A conditional neural fields model for protein threading,” Bioinformatics, vol. 28, no. 12, pp. i59–i66, 2012.
- J. Ma, S. Wang, Z. Wang, and J. Xu, “MRFalign: protein homology detection through alignment of markov random fields,” PLoS Computational Biology, vol. 10, no. 3, Article ID e1003500, 2014.
- P. Benkert, M. Künzli, and T. Schwede, “QMEAN server for protein model quality estimation,” Nucleic Acids Research, vol. 37, no. 2, pp. W510–W514, 2009.
- J. Cheng, Z. Wang, A. N. Tegge, and J. Eickholt, “Prediction of global and local quality of CASP8 models by MULTICOM series,” Proteins: Structure, Function and Bioinformatics, vol. 77, no. 9, pp. 181–184, 2009.
- A. R. Kinjo, K. Horimoto, and K. Nishikawa, “Predicting absolute contact numbers of native protein structure from amino acid sequence,” Proteins: Structure, Function and Genetics, vol. 58, no. 1, pp. 158–165, 2005.
- A. Kabakçioǧlu, I. Kanter, M. Vendruscolo, and E. Domany, “Statistical properties of contact vectors,” Physical Review E, vol. 65, no. 4, Article ID 041904, 2002.
- A. N. Tegge, Z. Wang, J. Eickholt, and J. Cheng, “NNcon: improved protein contact map prediction using 2D-recursive neural networks,” Nucleic Acids Research, vol. 37, supplement 2, pp. W515–W518, 2009.
- S. R. Holbrook, S. M. Muskal, and S.-H. Kim, “Predicting surface exposure of amino acids from protein sequence,” Protein Engineering, vol. 3, no. 8, pp. 659–665, 1990.
- B. Rost and C. Sander, “Conservation and prediction of solvent accessibility in protein families,” Proteins: Structure, Function and Genetics, vol. 20, no. 3, pp. 216–226, 1994.
- L. Ehrlich, M. Reczko, H. Bohr, and R. C. Wade, “Prediction of protein hydration sites from sequence by modular neural networks,” Protein Engineering, vol. 11, no. 1, pp. 11–19, 1998.
- G. Pollastri, P. Baldi, P. Fariselli, and R. Casadio, “Prediction of coordination number and relative solvent accessibility in proteins,” Proteins: Structure, Function, and Bioinformatics, vol. 47, no. 2, pp. 142–153, 2002.
- S. Ahmad and M. M. Gromiha, “NETASA: neural network based prediction of solvent accessibility,” Bioinformatics, vol. 18, no. 6, pp. 819–824, 2002.
- R. Adamczak, A. Porollo, and J. Meller, “Accurate prediction of solvent accessibility using neural networks-based regression,” Proteins: Structure, Function and Genetics, vol. 56, no. 4, pp. 753–767, 2004.
- Z. Yuan, K. Burrage, and J. S. Mattick, “Prediction of protein solvent accessibility using support vector machines,” Proteins: Structure, Function and Genetics, vol. 48, no. 3, pp. 566–570, 2002.
- H. Kim and H. Park, “Prediction of protein relative solvent accessibility with support vector machines and long‐range interaction 3D local descriptor,” Proteins: Structure, Function and Genetics, vol. 54, no. 3, pp. 557–562, 2004.
- M. N. Nguyen and J. C. Rajapakse, “Prediction of protein relative solvent accessibility with a two-stage SVM approach,” Proteins: Structure, Function and Genetics, vol. 59, no. 1, pp. 30–37, 2005.
- M. J. Thompson and R. A. Goldstein, “Predicting solvent accessibility: higher accuracy using Bayesian statistics and optimized residue substitution classes,” Proteins: Structure, Function, and Genetics, vol. 25, no. 1, pp. 38–47, 1996.
- J. Sim, S.-Y. Kim, and J. Lee, “Prediction of protein solvent accessibility using fuzzy k-nearest neighbor method,” Bioinformatics, vol. 21, no. 12, pp. 2844–2849, 2005.
- S. Ahmad, M. M. Gromiha, and A. Sarai, “Real value prediction of solvent accessibility from amino acid sequence,” Proteins: Structure, Function and Genetics, vol. 50, no. 4, pp. 629–635, 2003.
- A. Garg, H. Kaur, and G. P. S. Raghava, “Real value prediction of solvent accessibility in proteins using multiple sequence alignment and secondary structure,” Proteins: Structure, Function and Genetics, vol. 61, no. 2, pp. 318–324, 2005.
- Z. Yuan and B. Huang, “Prediction of protein accessible surface areas by support vector regression,” Proteins: Structure, Function, and Bioinformatics, vol. 57, no. 3, pp. 558–564, 2004.
- Z. Yuan, “Better prediction of protein contact number using a support vector regression analysis of amino acid sequence,” BMC Bioinformatics, vol. 6, article 248, 2005.
- N. Goldman, J. L. Thorne, and D. T. Jones, “Assessing the impact of secondary structure and solvent accessibility on protein evolution,” Genetics, vol. 149, no. 1, pp. 445–458, 1998.
- Z. Wang, F. Zhao, J. Peng, and J. Xu, “Protein 8-class secondary structure prediction using conditional neural fields,” Proteomics, vol. 11, no. 19, pp. 3786–3792, 2011.
- C. N. Magnan and P. Baldi, “SSpro/ACCpro 5: almost perfect prediction of protein secondary structure and relative solvent accessibility using profiles, machine learning and structural similarity,” Bioinformatics, vol. 30, no. 18, pp. 2592–2597, 2014.
- J. Peng, L. Bo, and J. Xu, “Conditional neural fields,” in Advances in Neural Information Processing Systems, 2009.
- S. Wang, J. Peng, and J. Xu, “Alignment of distantly related protein structures: algorithm, bound and implications to homology modeling,” Bioinformatics, vol. 27, no. 18, pp. 2537–2545, 2011.
- F. Zhao, J. Peng, and J. Xu, “Fragment-free approach to protein folding using conditional neural fields,” Bioinformatics, vol. 26, no. 12, Article ID btq193, pp. i310–i317, 2010.
- M. Källberg, H. Wang, S. Wang et al., “Template-based protein structure modeling using the RaptorX web server,” Nature Protocols, vol. 7, no. 8, pp. 1511–1522, 2012.
- M. Källberg, G. Margaryan, S. Wang, J. Ma, and J. Xu, “RaptorX server: a resource for template-based protein structure modeling,” in Protein Structure Prediction, vol. 1137 of Methods in Molecular Biology, pp. 17–27, Springer, 2014.
- I. Dubchak, S. Balasubramanian, S. Wang et al., “An integrative computational approach for prioritization of genomic variants,” PLoS ONE, vol. 9, no. 12, Article ID e114903, 2014.
- J. Lafferty, A. McCallum, and F. C. Pereira, “Conditional random fields: probabilistic models for segmenting and labeling sequence data,” in Proceedings of the 18th International Conference on Machine Learning (ICML'01), pp. 282–289, 2001.
- R. Collobert and J. Weston, “A unified architecture for natural language processing: deep neural networks with multitask learning,” in Proceedings of the 25th International Conference on Machine Learning, pp. 160–167, ACM, July 2008.
- R. Caruana, Multitask Learning, Springer, Berlin, Germany, 1998.
- C. Chothia, “The nature of the accessible and buried surfaces in proteins,” Journal of Molecular Biology, vol. 105, no. 1, pp. 1–12, 1976.
- H. M. Berman, J. Westbrook, Z. Feng et al., “The protein data bank,” Nucleic Acids Research, vol. 28, no. 1, pp. 235–242, 2000.
- D. Kozma, I. Simon, and G. E. Tusnády, “PDBTM: protein data bank of transmembrane proteins after 8 years,” Nucleic Acids Research, vol. 41, no. 1, pp. D524–D529, 2013.
- R. A. Jordan, Y. El-Manzalawy, D. Dobbs, and V. Honavar, “Predicting protein-protein interface residues using local surface structural similarity,” BMC Bioinformatics, vol. 13, article 41, 2012.
- R. Sowdhamini, S. D. Rufino, and T. L. Blundell, “A database of globular protein structural domains: clustering of representative family members into similar folds,” Folding and Design, vol. 1, no. 3, pp. 209–220, 1996.
- J. Moult, “A decade of CASP: progress, bottlenecks and prognosis in protein structure prediction,” Current Opinion in Structural Biology, vol. 15, no. 3, pp. 285–289, 2005.
- R. Adamczak, A. Porollo, and J. Meller, “Combining prediction of secondary structure and solvent accessibility in proteins,” Proteins: Structure, Function and Genetics, vol. 59, no. 3, pp. 467–475, 2005.
- J. Cheng, A. Z. Randall, M. J. Sweredoski, and P. Baldi, “SCRATCH: a protein structure and structural feature prediction server,” Nucleic Acids Research, vol. 33, supplement 2, pp. W72–W76, 2005.
- Y. Y. Tseng and J. Liang, “Estimation of amino acid residue substitution rates at local spatial regions and application in protein function inference: a Bayesian Monte Carlo approach,” Molecular Biology and Evolution, vol. 23, no. 2, pp. 421–436, 2006.
- S. F. Altschul, T. L. Madden, A. A. Schäffer et al., “Gapped BLAST and PSI-BLAST: a new generation of protein database search programs,” Nucleic Acids Research, vol. 25, no. 17, pp. 3389–3402, 1997.
- J. Söding, “Protein homology detection by HMM-HMM comparison,” Bioinformatics, vol. 21, no. 7, pp. 951–960, 2005.
- A. Biegert and J. Söding, “Sequence context-specific profiles for homology searching,” Proceedings of the National Academy of Sciences of the United States of America, vol. 106, no. 10, pp. 3770–3775, 2009.
- J. Meiler, M. Müller, A. Zeidler, and F. Schmäschke, “Generation and evaluation of dimension-reduced amino acid parameter representations by artificial neural networks,” Journal of Molecular Modeling, vol. 7, no. 9, pp. 360–369, 2001.
- M. Duan, M. Huang, C. Ma, L. Li, and Y. Zhou, “Position-specific residue preference features around the ends of helices and strands and a novel strategy for the prediction of secondary structures,” Protein Science, vol. 17, no. 9, pp. 1505–1512, 2008.
- Y. H. Tan, H. Huang, and D. Kihara, “Statistical potential-based amino acid similarity matrices for aligning distantly related protein sequences,” Proteins: Structure, Function and Genetics, vol. 64, no. 3, pp. 587–600, 2006.
- H. Fei and J. Huan, “Structured feature selection and task relationship inference for multi-task learning,” Knowledge and Information Systems, vol. 35, no. 2, pp. 345–364, 2013.
- O. Chapelle, P. Shivaswamy, S. Vadrevu, K. Weinberger, Z. Ya, and B. Tseng, “Multi-task learning for boosting with application to web search ranking,” in Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '10), pp. 1189–1197, ACM, July 2010.
- J. Chen, J. Liu, and J. Ye, “Learning incoherent sparse and low-rank patterns from multiple tasks,” ACM Transactions on Knowledge Discovery from Data, vol. 5, no. 4, article 22, 2012.
- J. Liu, S. Ji, and J. Ye, “Multi-task feature learning via efficient l2, 1-norm minimization,” in Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence, pp. 339–348, AUAI Press, 2009.
- Y. Qi, M. Oja, J. Weston, and W. S. Noble, “A unified multitask architecture for predicting local protein properties,” PLoS ONE, vol. 7, no. 3, Article ID e32235, 2012.
- S. Wang, J. Ma, J. Peng, and J. Xu, “Protein structure alignment beyond spatial proximity,” Scientific Reports, vol. 3, article 1448, 2013.
- S. Wang and W.-M. Zheng, “CLePAPS: fast pair alignment of protein structures based on conformational letters,” Journal of Bioinformatics and Computational Biology, vol. 6, no. 2, pp. 347–366, 2008.
- S. Wang and W.-M. Zheng, “Fast multiple alignment of protein structures using conformational letter blocks,” The Open Bioinformatics Journal, vol. 3, pp. 69–83, 2009.
- J. Ma and S. Wang, “Algorithms, applications, and challenges of protein structure alignment,” Advances in Protein Chemistry and Structural Biology, vol. 94, pp. 121–175, 2014.
- Y. Zhang and J. Skolnick, “Scoring function for automated assessment of protein structure template quality,” Proteins: Structure, Function and Genetics, vol. 57, no. 4, pp. 702–710, 2004.
- J. Xu and Y. Zhang, “How significant is a protein structure similarity with TM-score = 0.5?” Bioinformatics, vol. 26, no. 7, pp. 889–895, 2010.
- Q. Luo, R. Hamer, G. Reinert, and C. M. Deane, “Local network patterns in protein-protein interfaces,” PLoS ONE, vol. 8, no. 3, Article ID e57031, 2013.
Copyright © 2015 Jianzhu Ma and Sheng Wang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.