- Methodology article
- Open Access
DescFold: A web server for protein fold recognition
BMC Bioinformatics volume 10, Article number: 416 (2009)
Machine learning-based methods have been proven to be powerful in developing new fold recognition tools. In our previous work [Zhang, Kochhar and Grigorov (2005) Protein Science, 14: 431-444], a machine learning-based method called DescFold was established by using Support Vector Machines (SVMs) to combine the following four descriptors: a profile-sequence-alignment-based descriptor using Psi-blast e-values and bit scores, a sequence-profile-alignment-based descriptor using Rps-blast e-values and bit scores, a descriptor based on secondary structure element alignment (SSEA), and a descriptor based on the occurrence of PROSITE functional motifs. In this work, we focus on the improvement of DescFold by incorporating more powerful descriptors and setting up a user-friendly web server.
In seeking more powerful descriptors, the profile-profile alignment score generated from the COMPASS algorithm was first considered as a new descriptor (i.e., PPA). When considering a profile-profile alignment between two proteins in the context of fold recognition, one protein is regarded as a template (i.e., its 3D structure is known). Instead of a sequence profile derived from a Psi-blast search, a structure-seeded profile for the template protein was generated by searching its structural neighbors with the assistance of the TM-align structural alignment algorithm. Moreover, the COMPASS algorithm was used again to derive a profile-structural-profile-alignment-based descriptor (i.e., PSPA). We trained and tested the new DescFold in a total of 1,835 highly diverse proteins extracted from the SCOP 1.73 version. When the PPA and PSPA descriptors were introduced, the new DescFold boosts the performance of fold recognition substantially. Using the SCOP_1.73_40% dataset as the fold library, the DescFold web server based on the trained SVM models was further constructed. To provide a large-scale test for the new DescFold, a stringent test set of 1,866 proteins were selected from the SCOP 1.75 version. At a less than 5% false positive rate control, the new DescFold is able to correctly recognize structural homologs at the fold level for nearly 46% test proteins. Additionally, we also benchmarked the DescFold method against several well-established fold recognition algorithms through the LiveBench targets and Lindahl dataset.
The new DescFold method was intensively benchmarked to have very competitive performance compared with some well-established fold recognition methods, suggesting that it can serve as a useful tool to assist in template-based protein structure prediction. The DescFold server is freely accessible at http://220.127.116.11/DescFold/index.html.
Template-based protein structure prediction methods (often known as comparative modeling and fold recognition) typically involve the following three steps. First, a (remote) homologous protein with known structure is identified as a template for a query sequence. The second step is to obtain an optimal alignment between the query sequence and the template sequence. Finally, a refined 3D model of the query protein can be generated based on the template structure. With more and more protein structural templates deposited in the current PDB database http://www.rcsb.org/pdb/home/home.do, template-based methods are increasingly powerful and their applications to many aspects of life sciences are widely explored .
The key step in template-based methods is to identify a structure template that shares a similar 3D structure with the query sequence. When the query protein shares significant sequence similarity with the template, classical sequence alignment methods, such as Blast , FASTA , Smith-Waterman  or Needleman-Wunsch  dynamic programming algorithm, are suitable and accurate in detecting their homologous relationship. Generally, the template-based method for dealing with such "easy" templates is referred to as comparative modeling. However, proteins with weak sequence similarity are also frequently found to share similar 3D folds. Such remote homology relationships can be hard to detect with classical sequence alignment methods. To find a template that shares only remote homology with the query protein, some profile-sequence (or sequence-profile) alignment methods like Psi-blast , Rps-blast , Impala , and Hidden Markov Models (HMM)  have been used, and they often result in a marked improvement. Nevertheless, the profile-sequence (or sequence-profile) alignment methods also perform poorly when the investigated protein pairs are situated in the twilight or midnight zone . A lot of efforts have therefore been deployed to develop more sensitive and powerful remote homology detection techniques, called fold recognition. During the last decade, fold recognition has received considerable attention and a variety of elegant fold recognition methods (e.g., FFAS , 3D-PSSM , Fugue , mGenThreader , ORFeus , MUSTER , and SP5 ) have been developed. The overall good performance of these techniques has been widely demonstrated in the CASP  and CAFASP  competitions as well as in real-time LiveBench experiments .
The basic strategy of fold recognition methods consists in comparing the query sequence with all the structures within a fold library. According to the measured compatibility between sequence and structure, the fold recognition method can identify the template with the best fit. The well-established fold recognition methods can be roughly grouped into three main categories: (1) structure-seeded profile-based; (2) profile-profile alignment-based; and (3) machine learning methods-based. In the first category, 3D-PSSM and Fugue are probably the two best-known representative algorithms. For instance, 3D-PSSM is based on a hybrid fold recognition approach using sequence profiles and structure-seeded profiles (i.e., 3D profiles) coupled with predicted secondary structure information and solvation potential . Grouped into the second category, the profile-profile alignment methods have recently been proven to be very powerful in remote homology identification as well as in generating accurate sequence alignments [20, 21]. Generally, the profile-profile alignment method uses dynamic programming to obtain a direct alignment between two sequence profiles through Psi-blast searching [22, 23]. To improve the performance of the profile-profile alignment, the structural information (e.g., predicted secondary structural information) was also frequently added to measure the similarity of two positional vectors [14, 16]. In the third category, machine learning-based methods were employed to combine different sequence and structural information into fold recognition systems [13, 24–27]. In mGenThreader , for instance, a neural network was used to combine pair-wise potentials, solvation potentials, and various alignment parameters. In the past several years, Support Vector Machines (SVMs) have also been widely used to build binary classifiers, which can allow the prediction of whether a sequence belongs to a single structural fold or not. Provided there are sufficient data in different protein folds, a set of binary classifiers can be trained and integrated into a fold recognition system (i.e. a multi-class predictor). A key step to establish an SVM classifier is to find effective kernel functions, which measure the similarity between any pair of protein sequences. There are some established kernel functions such as spectral kernel , profile-based string kernel , and mismatch string kernel .
A machine learning-based fold recognition method called DescFold was developed in our previous work . In DescFold, any measurement between two proteins or any feature vector extracted from a protein sequence can be defined as a descriptor. For example, the amino acid composition of a protein can be regarded as a descriptor; the e- value obtained from a Blast search of protein A against protein B can also be considered as a descriptor between A and B. Based on such a broad definition, thirteen descriptors' fold identification capabilities were evaluated and four optimal descriptors were selected to construct the original version of DescFold with the assistance of SVMs. Although SVMs were frequently used to build discriminative models between various protein folds , it should be emphasized that the SVMs here were employed to distinguish structurally similar and dissimilar protein pairs. The four implemented descriptors were a profile-sequence-alignment-based descriptor using Psi-blast e-values and bit scores, a sequence-profile-alignment-based descriptor using Rps-blast e-values and bit scores, a descriptor based on the alignment of secondary structural elements (SSEA), and a descriptor based on the occurrence of PROSITE functional motifs . Although the original DescFold was reported to significantly outperform a standard Psi-blast search, it showed weaker performance than some well-established methods when tested on the LiveBench-8 targets .
In the present study, we focus on developing an improved DescFold method through the following efforts. First, a profile-profile-alignment-based (PPA) descriptor was incorporated into the new DescFold method. Of the existing profile-profile alignment algorithms, COMPASS is one of the best-performing methods, and possess good computational efficiency . Additionally, COMPASS is freely accessible to the community. In this work, the alignment scores resulting from the COMPASS algorithm [23, 32] were defined as a PPA descriptor between a sequence pair. In the context of fold recognition, one of the aligned two sequences is regarded as a template, meaning that a structure-seeded profile is available for the template, which may contain different evolutionary information than a sequence profile derived from its homologous sequences. Moreover, the structure-seeded profile for the template sequence was generated by searching its structural neighbors with the assistance of TM-align . Again, the COMPASS algorithm was further used to derive a profile-structural-profile-alignment-based descriptor (i.e., PSPA). Finally, we also set up a user-friendly web server for DescFold, and have made it freely accessible to the research community. Here, we present details on the improvement resulting from two newly introduced profile-profile alignment related descriptors, the construction of the DescFold web server, and the intensive benchmark results of testing DescFold against some state-of-the-art fold recognition methods.
Results and Discussion
The performance of individual descriptors based on the SCOP_1.73_1835 dataset
Based on the SCOP 1.73 version , we compiled a total of 1,835 sequence-dissimilar but structurally related proteins into a highly diverse protein dataset named SCOP_1.73_1835. Then, we used the SCOP_1.73_1835 dataset to benchmark the six different descriptor types in leave-one-out fold identification experiments. Each time, a protein in SCOP_1.73_1835 was selected as a "test" protein and the remaining proteins were regarded as a fold library. By calculating the pair-wise similarity scores defined in different descriptors, the "test" protein was scanned against the fold library and the protein with the most significant similarity score (i.e., the top hit) was recorded. In case the top hit and the test protein belong to the same SCOP superfamily, a correct fold identification was assigned. When the above experiment is performed over all the SCOP_1.73_1835 proteins, a descriptor's performance can be simply quantified in terms of sensitivity by counting the number of proteins with correctly identified structural homologs. More details about the construction of the different types of descriptors and the compilation of the SCOP_1.73_1835 dataset are outlined in the Methods section.
The sensitivities of fold identification using different descriptors are listed in Table 1. Of the four descriptors used in the original DescFold, the performance of the Rps-blast- and Psi-blast-based descriptors yield a sensitivity of 37.49% and 36.84%, respectively. Predicted secondary structure has been proven to be useful in protein fold recognition/classification , which can be effectively encoded by the SSEA-based descriptor [13, 24, 36]. The SSEA-based descriptor allows a correct identification rate of 28.56%. The motif-based descriptor is only able to generate successful fold identification for approximately 20% of the total protein sequences. Generally, the performance ranking of these four descriptors is in good agreement with the results from our previous study, although the descriptors were evaluated over two different datasets.
By capturing evolutionary information about residue preferences at different sequence positions in two profiles, profile-profile alignment has been shown to be very powerful in fold identification. Compared with the aforementioned four descriptors, the two profile-profile alignment related descriptors achieve better performance, and both descriptors allow successful fold identification for more than 50% of the tested protein sequences. Comparatively, the PPA descriptor is more powerful, and it outperforms the PSPA descriptor by nearly two percentiles (Table 1). Regarding the PSPA descriptor, the profile for one protein is derived from structural alignment results, which may contain different evolutionary information than the sequence profile inferred from the Psi-blast search results. By further combining the PPA and PSPA descriptors into our DescFold system, it is hoped that the overall performance of DescFold will be considerably improved.
The overall performance of DescFold based on the SCOP_1.73_1835 dataset
The same strategy we used to evaluate the individual descriptors was used to assess the performance of DescFold (Table 2). For the purpose of comparison, computational experiments based on a combination of different descriptors were conducted. As shown in Table 2, the original DescFold (i.e., the results based on the SSEA-, Psi-blast-, Rps-blast-, and motif-based descriptors) can result in a sensitivity of about 56%. Representing local sequence features of proteins, the motif-based descriptor is alignment independent, implying that it should be complementary to the other alignment related descriptors. This can be clearly demonstrated by a 4% lower sensitivity when the motif-based descriptor was removed from the original DescFold system.
As expected, the two profile-profile alignment related descriptors do provide considerable contributions to the new DescFold method, with has a nearly 16% higher sensitivity than that of the original DescFold. When the PSPA descriptor was not included in the DescFold system, a nearly 4% lower sensitivity was obtained, implying that the evolutionary information deposited in the two profile-profile alignment related descriptors are complementary to some extent. Moreover, a receiver operating characteristic (ROC)  curve, which plots true positive instances as a function of false positive instances for all possible thresholds, was also employed to measure the performance of the new version of DescFold. The improvement of DescFold resulting from the introduction of the PPA and PSPA descriptors is further revealed in the ROC curve (Figure 1). At a less than 5% false positive rate (i.e., 92 false positive instances) control, the new DescFold method is able to correctly recognize folds for 60.49% proteins, whereas only 46.16% proteins are successfully identified by the original DescFold method.
The above evaluation only reflects fold identification performance based on the generated top hits. As a more comprehensive evaluation, we also assessed DescFold's remote homology identification for all the protein pairs within the SCOP_1.73_1835 dataset via ROC analysis. As shown in Figure 2, the performance of DescFold when combining different descriptors has the same characteristics as the corresponding ROC curves in Figure 1. Additionally, the performance can be further quantified by the AUC and ROCn scores. The AUC score represents the corresponding area under the whole ROC curve, while the ROCn score is the area under the ROC curve up to the first n false positives. Since we pay more attention on the performance at low false positive rates, the ROCn score is more useful for practical applications. In addition to the AUC score, the ROC16,744, ROC83,720, and ROC167,440 scores (i.e., the ROCn values at 1%, 5%, and 10% false positive rates, respectively) are also listed in Table 3. At a less than 5% false positive rate control, the corresponding ROC83,720 score resulting from the new DescFold is approximately 0.008 higher than that of the original one (Table 3). Considering the corresponding sensitivity at this false positive rate control, the new DescFold is able to correctly identify approximately 69% of structurally similar protein pairs, providing an additional 15% improvement compared with the original DescFold (Table 3).
The performance of DescFold is further exemplified in the remote homology identification between two protein domains from the SCOP_1.73_1835 dataset (SCOP entries: d2al3a1 and d1hmsa_). Although d2a13a1 (a hypothetical protein from Arabidopsis thaliana) shares weak sequence similarity with d1hmsa (a muscle fatty acid binding protein from Homo sapiens), they are structural homologs (Figure 3) and belong to the same SCOP superfamily (lipocalins, SCOP superfamily index: b.60.1). When we searched d2a13a1 against the remaining 1,834 sequences using any individual descriptor, its superfamily partner (i.e., d1hmsa_) could not be ranked as the top hit. However, d1hmsa could be successfully assigned as the top hit when the search was carried out using our new DescFold.
The DescFold web server and a large-scale benchmarking experiment on the SCOP_1.75_1866 dataset
Using the SCOP_1.73_40% dataset as the fold library, the DescFold web server was set up and is freely accessible at http://18.104.22.168/DescFold/index.html. Currently, a four-CPU DELL Linux machine with 16 GB of main memory hosts the DescFold web server. Generally, the computational time required for recognizing a protein's fold is reasonable for the current DescFold server; it takes about ten minutes to process a query sequence of 500 amino acids. Figure 4A is the submission page of the web server, and users can simply paste a protein sequence or upload a sequence file on this page to initiate the fold recognition process. When the recognition process is complete, users will be notified by e-mail. In the result page for fold recognition (Figure 4B), the top hits' Z-Scores, SCOP entries, sequence files and PDB files are listed. To quantitatively understand the reliability of the identified templates, we point out the confidence levels for different hits. Based on the current remote homology identification tests for all the protein pairs within the SCOP_1.73_1835 dataset (Figure 2), it was estimated that a Z-Score ≥ 10.0 yields a ≤ 1% error rate (i.e., 99% confidence level) and a Z-Score ≥ 6.0 indicates a ≤ 5% error rate (i.e., 95% confidence level). Moreover, the scores for all descriptors and sequence alignments generated from Psi-blast, Rps-blast, SSEA, PPA and PSPA are also listed in the result page, which can allow users to further judge the identified templates are correct or not. Among these sequence alignments, the PPA alignment based on the COMPASS algorithm is recommended to be used to obtain a 3D model for the query sequence with the assistance of some comparative modelling packages.
By taking a similar strategy as reported in the literature of Auto-SCOP , we used a newer SCOP version (i.e., SCOP 1.75) to provide a large-scale benchmark for the current DescFold web server. 1,866 proteins were selected from SCOP 1.75 and compiled into a test dataset called SCOP_1.75_1866, which covers 171 different folds and 246 different superfamilies. All the 1,866 proteins share weak sequence similarities with the proteins in the fold library of DescFold (the Blast e-value for any protein pair between SCOP_1.75_1866 and SCOP_1.73_40% is > 0.1). On the other hand, 1,866 and 1,795 proteins in SCOP_1.75_1866 have at least one structural homolog in the fold library of DescFold at the fold and superfamily levels, respectively. Therefore, SCOP_1.75_1866 should be regarded as a good benchmarking dataset. More details about the selection of the SCOP_1.75_1866 dataset are outlined in the Methods section. We processed these 1,866 sequences via the current DescFold server and recorded the top hit for each sequence. According to the SCOP classification scheme, we measured the performance at the fold and superfamily levels. At the fold level, a correct prediction for a test protein can be assigned in case the top hit and the test protein belong to the same SCOP fold type. Generally, our DescFold is able to do the correct fold identification for 61.84% (i.e., 1,154/1,866 = 61.84%) test proteins, or some 21% more than a standard Psi-blast search. At a less than 5% false positive rate control, our DescFold method is able to correctly recognize folds for 46.25% proteins, whereas only 30.05% proteins are successfully identified by the standard Psi-blast search (Figure 5A). Note that the parameter settings of the standard Psi-blast search were the same as those used in deriving the Psi-blast-based descriptor. When assessing the performance at the superfamily level, a correct prediction means the top hit and the test protein should from the same SCOP superfamily. DescFold can correctly recognize structural homologs at the superfamily level for 57.05% (i.e., 1,024/1,795 = 57.05%) test proteins, which outperforms Psi-blast by a nearly 17% higher recognition rate. As further illustrated in the ROC curve (Figure 5B), DescFold also reveals a much better performance than the standard Psi-blast search.
Comparison with some well-established fold recognition methods
In this work, our DescFold method was first benchmarked against some state-of-the-art fold recognition methods based on the LiveBench targets. As a real-time fold recognition benchmark program, every week the LiveBench server submits newly released PDB proteins to the participating fold-recognition servers, and evaluates the corresponding results. Here, we have selected the LiveBench-2008.1 targets (283 proteins) and LiveBench-2008.2 targets (513 proteins) as two reference test sets to compare the performance of DescFold and some well-established fold recognition methods. Although many fold recognition severs participated in the LiveBench-2008.1 and Livebench-2008.2 experiments, we compared our DescFold method with only five popular fold-recognition methods among them: 3D-PSSM , Fugue , mGenThreader , Inub  and FFAS .
Table 4 summarizes the performance of DescFold on the LiveBench-2008.1 targets, which is measured by the number of correct predictions with higher reliability than the 1-10 false prediction and the total number of correct predictions (i.e., sensitivity). Generally, the performance of DescFold is fully comparable to the five other fold recognition methods. Considering performance within ≤ 10 false positives, DescFold exhibits an overall higher fold identification rate than 3D-PSSM, a slightly better performance than Fugue and mGenThreader, and a lower identification rate than FFAS and Inub. Regarding the total number of correct predictions, DescFold is able to correctly identify fold types for 134 targets, which is also competitive to the five well-established methods. As defined by the developer of LiveBench, the targets can be divided into three categories: trivial, easy and hard targets. We separately list the corresponding sensitivity values on these three types of targets in Table 4. Generally, DescFold also shows reasonable performance in any category, although its relative rankings change slightly in three different categories.
The performance of DescFold on the LiveBench-2008.2 targets is also comparable to the five other fold recognition methods (Table 5). Considering performance within ≤ 10 false positives, FFAS is still the best performing method among the five other fold recognition methods, whereas 3D-PSSM is ranked as the worst one again. The performance of DescFold is between these two, which is close to the three other methods (Inub, Fugue and mGenThreader) (Table 5). In our previous work, the same benchmark experiment was carried out based on the LiveBench-8 targets. Taking Fugue as a reference method, our original DescFold was benchmarked to have a considerably lower fold identification rate . However, the new DescFold shows fully competitive performance with Fugue in both LiveBench-2008.1 and LiveBench-2008.2 experiments, suggesting that a clear improvement to DescFold has been made in this work.
The Lindahl dataset  was also employed to further benchmark the performance of our DescFold method. Based on the SCOP database (version 1.39), the Lindahl dataset contains 976 proteins, in which the sequence identity for any protein pair is < 40%. In this dataset, 555, 434 and 321 sequences have at least one matching structural homolog at the family, superfamily and fold levels, respectively. Taking the same strategy and procedures as we used with the SCOP_1.73_1835 dataset to develop the DescFold method, we retrained the DescFold method based on the Lindahl dataset. By employing the same assessment procedure as reported in the literature [16, 25, 40], the top 1 and the top 5 matched templates for each query sequence were used to evaluate the sensitivity of recognition performance. Since the Lindahl dataset was based on an old version of SCOP, it may be quite subjective to benchmark different methods based on this dataset. Ideally, the sequence and structural information of these 976 proteins should not be included in deriving the DescFold prediction models. More stringently, the sequence and structural homologs of these 976 proteins should also not be used. In the present study, we used the SCOP database (version 1.73) to derive the PSPA and motif-based descriptors. For instance, the PSPA descriptor used the SCOP_1.73_40% dataset to construct the structure-seeded profile, which may inevitably contain structural homologs of these 976 proteins. Meanwhile, the motif-based descriptor relied on the SCOP_1.73_95% dataset to derive the motif-fold compatibility, which may also utilize some sequence homologs of these 976 proteins. To allow for a fair comparison, we designed two DescFold predictors. In the first predictor (DescFold_I), both the PSPA and motif-based descriptors were skipped. In the second predictor (DescFold_II), the PSPA descriptor was still not considered, while the motif-based descriptor was kept. To derive the motif-based descriptor, however, these 976 proteins' sequence homologs in the SCOP_1.73_95% database were filtered by a Blast e-value threshold of 0.01.
We compared the performance of our DescFold with eight other fold recognition methods, including the standard Psi-blast search, HHpred , FOLDpro , Sparks , SP3 , SP4 , SP5  and Fugue . The corresponding results for these eight methods were cited from Refs. and . Table 6 shows the sensitivities of DescFold and the other well-established methods at the family, superfamily and fold levels, for the top 1 and top 5 matched templates, respectively. Although the PSPA was not considered, the performance of DescFold (i.e., DescFold_II) is fully comparable with the other methods. For prediction at the family level, the performance of DescFold is very close to that of well-established methods. For prediction at the superfamily level, DescFold is the best-performing method. Regarding the top 1 prediction at the fold level, DescFold surpasses all the tested methods except SP5. It is also worth mentioning that our DescFold (i.e., DescFold_I) is still competitive even when both the PSPA and motif-based descriptors are discarded.
Although many efforts were taken to make sure that the above two benchmark experiments were intensive and strict, we are still not able to guarantee a fully unbiased assessment. Regarding the benchmark based on the LiveBench targets, the fold libraries are different for the assessed methods, which may have some effect on the performance of the corresponding methods. For the comparative analysis based on the Lindahl dataset, the performance of other methods was originally collected from different literature. In this case, the sequence databases used to generate the profiles are not the same, which may result in different performance to some extent. Meanwhile, some methods may already have been significantly updated since their benchmark performance on the Lindahl dataset was published. As pointed out by Cheng and Baldi , such benchmark experiments can only provide a rough assessment rather than a very precise measurement. Even so, both of the aforementioned two benchmark experiments conclude that the performance of DescFold is fully comparable to some well-established peer methods.
In this work, we developed an improved DescFold method by combining two new profile-profile alignment related descriptors (i.e., the PPA and PSPA descriptors). Due to the fact that the profile-profile alignment is able to capture more evolutionary information which was missed in our original DescFold, the new DescFold leads to a much better performance. The new DescFold method was benchmarked against some other state-of-the-art fold recognition techniques by using the LiveBench targets and Lindahl dataset. Our DescFold method demonstrates competitive performance in comparison to the existing methods. To allow for practical applications, we have made it freely accessible to the community through a user-friendly web-server.
Concerning future development, the following two efforts should be taken to maintain DescFold as a competitive fold recognition system. Firstly, the fold library of DescFold should be regularly updated. To provide a more comprehensive fold library, those experimentally determined structures which are not included in the SCOP database should also be taken into account. Secondly, seeking new descriptors is still the most important direction for development of a better predictor. On the one hand, machine learning based-methods allow the incorporation of more descriptors into a fold recognition system, which may yield better performance. On the other hand, the introduced descriptors will inevitably increase the complexity of the prediction model and obscure the contribution of each individual descriptor. Therefore, a new descriptor candidate should be carefully assessed before its acceptance for inclusion in the future versions of DescFold. Thus, we expect such machine learning-based methods will not only result in a fold recognition system with higher accuracy, but also strengthen our fundamental understanding of the evolutionary relationship between protein sequence and structure.
In this work, we heavily rely on the SCOP database (version 1.73)  to construct the DescFold method. The corresponding SCOP sequences and structural data were obtained from the ASTRAL website http://astral.berkeley.edu/. To train and test the DescFold prediction models, two SCOP protein sequence subsets filtered by a 10% cut-off for sequence identity and an e-value threshold of 0.01 were downloaded from the ASTRAL website separately. Then, only sequences occurred in both of the above subsets were further kept. We also excluded sequences that are too short (less than 60 amino acids). Moreover, only a representative protein was reserved for each SCOP family. Finally, 1,835 protein sequences were kept and compiled into a dataset, which we named SCOP_1.73_1835 [see Additional file 1]. To construct the fold library of the DescFold web server, the SCOP_1.73_40% database with a total of 9,282 proteins was downloaded, in which the sequence identity among the proteins is equal to or less than 40%. The SCOP_1.73_40% database was also used as the database to search for structural neighbors for each template. Additionally, we also used the SCOP_1.73_95% dataset to derive the motif-based descriptor, in which the sequence identity for any sequence pair is ≤ 95%. A total of 15,273 protein sequences in the current SCOP_1.73_95% dataset were downloaded.
To perform a large-scale benchmarking on our DescFold server, a stringent test set was selected from a newer SCOP version (i.e., SCOP 1.75) based on the following criteria. Firstly, all proteins existed in SCOP 1.75 but not in SCOP 1.73 were downloaded. Secondly, only proteins sharing the fold types already existed in SCOP 1.73 were retained. Thirdly, proteins sharing a Blast e-value less than 0.1 with any protein in the SCOP_1.73_40% library were further discarded. Finally, 1,866 proteins from the SCOP 1.75 version were compiled into a test dataset called SCOP_1.75_1866 [see Additional file 2].
The NCBI non-redundant (NR) sequence database was downloaded from ftp://ncbi.nlm.nih.gov/blast/ (November, 2008). The NR database was further clustered at a cut-off of 90% identity (global alignment mode) by using CD-hit  and the resulting NR90 database, containing 4,205,215 sequences, was used to perform the Psi-blast search. To derive the motif-based descriptor, the PROSITE database (release 20.9) , which contains 1,322 patterns and 720 profiles, was obtained from http://www.expasy.org/prosite/.
The Psi-blast-based descriptor for a sequence pair A and B was obtained through the following steps. First, sequence A was searched against the NR90 database by Psi-blast for three iterations to generate a profile (i.e., profile A). The e-value cut-off for recruiting sequences in the profile was set as 0.001. Second, a Psi-blast search was performed on profile A against sequence B for another round. The above Psi-blast search resulted in two parameters, the expected value evaluePsi-blast(A, B) and the bit score ScorePsi-blast(A, B). In this work, evaluePsi-blast(A, B) was further modified according to the following equation.
Thus, the Psi-blast-based descriptor (i.e., evalue_modPsi-blast(A, B) and Score Psi-blast(A, B)), can be used to measure the sequence similarity between A and B.
The Psi-blast search can be conducted in a reverse way via Rps-blast (i.e., profile B against sequence A). As we derived the Psi-blast-based descriptor, the Rps-blast-based descriptor also results in two parameters evalue_modRps-blast(A, B) and ScoreRps-blast(A, B).
To derive the SSEA-based descriptor for two query sequences A and B, the following three steps were involved. First, the secondary structures of the two query sequences were predicted by PSIPRED . Second, the predicted secondary structural string for each sequence was converted into secondary structure elements such that "H" represents a helix element, "E" denotes a strand element, and "C" stands for a coil element. Third, the two secondary structure elements were aligned using a dynamic programming algorithm  with a scoring scheme proposed by Przytycka et al. . The resulting alignment score SSEA(A, B), ranging from 0 to 1, was regarded as the SSEA-based descriptor. For more details about the SSEA-based descriptor, please refer to our previous work .
In this work, the PROSITE motif library was used to derive the motif-based descriptor. First, the motif-fold correlation  in the SCOP database (i.e., SCOP_1.73_95%) can be quantified by a log-odds score S defined as:
where p(motif) and p(fold) are the individual probabilities of finding a particular sequence motif and a particular fold in the SCOP database, and p(fold, motif) is the corresponding joint probability. Furthermore, the motif-based compatibility between a query sequence and given folds can be expressed as:
where S(fold|motif) was calculated from equation 2 and the summation was performed over all motifs found in the query sequence and fulfilling the following criteria:
where C is an adjustable parameter, with 0.1 being an optimized value in this work. For a query sequence, the potential fold (PF) should be identified as the fold where S motif (fold | sequence) achieves a maximum. Then, the motif-based descriptor between two sequences A and B is defined as:
Profile-profile-alignment-based (PPA) descriptor
The COMPASS algorithm [23, 32] was employed to derive a profile-profile-alignment-based descriptor between proteins A and B. First, a Psi-blast search was carried out to generate sequence profiles A and B, with the same parameter settings as we used to calculate the Psi-blast-based descriptor. Second, the two multiple alignments generated from the Psi-blast search (i.e., profiles A and B) were processed by COMPASS to obtain a profile-profile alignment. The resulting two parameters, evalue PPA (A, B) and Score PPA (A, B) were regarded as the similarity measurement between A and B (i.e., the PPA descriptor). Similar to Eq.(1), the evalue PPA (A, B) was further converted into evalue_mod PPA (A, B).
Profile-structural-profile-alignment-based (PSPA) descriptor
Considering a protein pair A and B in the context of fold recognition, protein A is regarded as the query sequence and protein B is a structural template. Thus, the profile for protein B can also be obtained by searching its structural neighbours. To derive a PSPA descriptor between A and B, sequence profile A and structure-seeded profile B were generated. Sequence profile A was generated as described in deriving the Psi-blast-based descriptor, while the structure-seeded profile was obtained through the following steps. First, we searched structural template B against the SCOP_1.73_40% structural database using the TM-align structural alignment method  with default parameters. The search resulted in 9282 pair-wise structural alignments. Second, only those structural hits with a TM-align score > 0.6 were kept. Generally, a structural hit with a TM-align score > 0.6 is considered significant, meaning protein B and the corresponding hit share significant structural similarity. Moreover, we took sequence B as the reference sequence and no gaps were allowed, while we trimmed the structural hits' residues if they were aligned with the gap regions of sequence B in the corresponding pair-wise alignment. Finally, the corresponding pair-wise sequence alignments were combined into a multiple sequence alignment (i.e., structure-seeded profile B). When sequence profile A and structure-seeded profile B were prepared, the COMPASS algorithm was used again to derive the PSPA descriptor (evalue_mod PSPA (A, B) and Score PSPA (A, B)).
Construction of DescFold
Based on the same strategy as detailed in our previous work, the aforementioned descriptors were combined into a fold recognition system termed DescFold with the assistance of SVMs. Similar to a 5-fold cross-validation, the protein pairs in the SCOP_1.73_1835 dataset (i.e., 1835 × 1834/2 = 1,682,695 pairs) were divided into five subsets of nearly equal size. Here, the SVM was trained to distinguish two different types of protein pairs (i.e., structurally similar and structurally dissimilar pairs). For the first type of protein pairs (i.e., positive instances), both proteins belong to the same superfamily. For the second type of protein pairs (i.e., negative instances), the two proteins are from different superfamilies. Of the total 1,682,695 protein pairs, 8,244 pairs were considered positive instances and their labels were set to + 1, while1,674,451 pairs were considered negative instances and their labels were set to -1. The aforementioned six descriptors were input as the feature vector for each protein pair, which contains a total of ten parameters. Taking a protein pair A and B as an example, the corresponding ten parameters are evalue_modPsi-blast(A, B), ScorePsi-blast(A, B), evalue_modRps-blast(A, B), ScoreRps-blast(A, B), SSEA(A, B), Motif_Score(A, B), evalue_mod PPA (A, B), Score PPA (A, B), evalue_mod PSPA (A, B), and Score PSPA (A, B).
To predict whether a given protein pair were structurally similar or dissimilar, the subset to which this pair belongs was labeled the "test" set, whereas the four remaining subsets were labeled "training" sets. SVM models were developed for each of the "training" sets. The ratio of the positive to negative instances in each training dataset is approximately 1:200. An unbalanced training dataset will affect the prediction performance of the established SVM models and we found that the optimal ratio in the training set was 1:2.5. Each training dataset was adjusted by discarding a random selection of the negative pairs prior to training. The whole training resulted in four separate SVM models, the prediction score being obtained as an average value over the decision values from the four different SVM models. Furthermore, the raw prediction score (RPS) was further converted into a Z-Score. We randomly selected 3000 pairs from the 1,682,695 protein pairs, and calculated the average value (AVE) and standard deviation (SD) of these pairs' prediction scores. For a query sequence, a Z-Score can then be calculated: Z = (RPS - AVE)/SD.
Libsvm  was employed as the SVM algorithm in our work. The applied kernel was the linear function and the other parameters were set to their default values. We also tried the automatic parameter optimization provided by Libsvm, but it did not result in a better performance. Instead of performing any further parameter optimization, we only used the default SVM parameters in our DescFold method. According to the randomized grouping of five subsets, the 5-fold cross-validation was repeated 5 times. Finally, the average performance was reported.
Of the ten input features (parameters) used in building the SVM models, it is interesting to quantify the relative importance of each feature in classifying structurally similar and dissimilar protein pairs. The feature selection tool fselect.py http://www.csie.ntu.edu.tw/~cjlin/libsvmtools/#6 provided by the Libsvm developer was employed to measure the relative importance of each feature. For each feature, an F-score can be calculated from fselect.py. Generally, the larger the F-score is, the more important this feature is. As shown in Table 7, Score PSPA (A, B) tends to be the most important, while Motif_Score(A, B) is ranked as the weakest feature.
Construction of the web server of DescFold
To aid the research community, a web server for DescFold was constructed and is freely available at http://22.214.171.124/DescFold/index.html. To sufficiently represent the known protein structural space, the 9,282 proteins in the SCOP_1.73_40% dataset were used as the fold library. For computational efficiency, the Psi-blast-derived profiles, predicted secondary structure elements, S motif (fold|sequence), and structure-seeded profiles of the template proteins were pre-calculated. To search a query sequence against the fold library (i.e., SCOP_1.73_40%), a total of 9,282 protein pairs were involved. For each protein pair, the corresponding six descriptors were calculated. Then, the resulting ten parameters were used as the input for five SVM models trained in the above section, and the prediction score was obtained as an average value over the decision scores from the five different SVM models. Moreover, the prediction scores for all protein pairs were converted into Z-Scores. Finally, the top hits ranked by Z-Scores were reported. Users have options to display the top hits by setting the number of hits and the cut-off of Z-Score. The default number is ten and the maximal number is 50.
Availability and requirements
Project Name: DescFold
Project home page: http://126.96.36.199/DescFold/index.html
Operating system: Online service is web based; local version of the software should be run on a Linux platform.
Programming language: Perl.
Other requirements: None.
Any restrictions to use by non-academics: None.
Petrey D, Honig B: Protein structure prediction: inroads to biology. Mol Cell 2005, 20(6):811–819. 10.1016/j.molcel.2005.12.005
Altschul SF, Gish W, Miller W, Myers EW, Lipman DJ: Basic local alignment search tool. J Mol Biol 1990, 215(3):403–410.
Pearson WR: Rapid and sensitive sequence comparison with FASTP and FASTA. Methods in enzymology 1990, 183: 63–98. full_text
Smith TF, Waterman MS: Identification of common molecular subsequences. J Mol Biol 1981, 147(1):195–197. 10.1016/0022-2836(81)90087-5
Needleman SB, Wunsch CD: A general method applicable to the search for similarities in the amino acid sequence of two proteins. J Mol Biol 1970, 48(3):443–453. 10.1016/0022-2836(70)90057-4
Altschul SF, Madden TL, Schaffer AA, Zhang J, Zhang Z, Miller W, Lipman DJ: Gapped BLAST and PSI-BLAST: a new generation of protein database search programs. Nucleic Acids Res 1997, 25(17):3389–3402. 10.1093/nar/25.17.3389
Schaffer AA, Wolf YI, Ponting CP, Koonin EV, Aravind L, Altschul SF: IMPALA: matching a protein sequence against a collection of PSI-BLAST-constructed position-specific score matrices. Bioinformatics 1999, 15(12):1000–1011. 10.1093/bioinformatics/15.12.1000
Sonnhammer EL, Eddy SR, Durbin R: Pfam: a comprehensive database of protein domain families based on seed alignments. Proteins 1997, 28(3):405–420. 10.1002/(SICI)1097-0134(199707)28:3<405::AID-PROT10>3.0.CO;2-L
Rost B: Twilight zone of protein sequence alignments. Protein Eng 1999, 12(2):85–94. 10.1093/protein/12.2.85
Jaroszewski L, Rychlewski L, Li Z, Li W, Godzik A: FFAS03: a server for profile--profile sequence alignments. Nucleic Acids Res 2005, (33 Web Server):W284–288. 10.1093/nar/gki418
Kelley LA, MacCallum RM, Sternberg MJ: Enhanced genome annotation using structural profiles in the program 3D-PSSM. J Mol Biol 2000, 299(2):499–520. 10.1006/jmbi.2000.3741
Shi J, Blundell TL, Mizuguchi K: FUGUE: sequence-structure homology recognition using environment-specific substitution tables and structure-dependent gap penalties. J Mol Biol 2001, 310(1):243–257. 10.1006/jmbi.2001.4762
McGuffin LJ, Jones DT: Improvement of the GenTHREADER method for genomic fold recognition. Bioinformatics 2003, 19(7):874–881. 10.1093/bioinformatics/btg097
Ginalski K, Pas J, Wyrwicz LS, von Grotthuss M, Bujnicki JM, Rychlewski L: ORFeus: Detection of distant homology using sequence profiles and predicted secondary structure. Nucleic Acids Res 2003, 31(13):3804–3807. 10.1093/nar/gkg504
Wu S, Zhang Y: MUSTER: Improving protein sequence profile-profile alignments by using multiple sources of structure information. Proteins 2008, 72(2):547–556. 10.1002/prot.21945
Zhang W, Liu S, Zhou Y: SP5: improving protein fold recognition by using torsion angle profiles and profile-based gap penalty model. PLoS One 2008, 3(6):e2325. 10.1371/journal.pone.0002325
Moult J, Fidelis K, Kryshtafovych A, Rost B, Hubbard T, Tramontano A: Critical assessment of methods of protein structure prediction-Round VII. Proteins 2007, 69(Suppl 8):3–9. 10.1002/prot.21767
Fischer D, Barret C, Bryson K, Elofsson A, Godzik A, Jones D, Karplus KJ, Kelley LA, MacCallum RM, Pawowski K, et al.: CAFASP-1: critical assessment of fully automated structure prediction methods. Proteins 1999, (Suppl 3):209–217. Publisher Full Text 10.1002/(SICI)1097-0134(1999)37:3+%3C209::AID-PROT27%3E3.0.CO;2-Y
Rychlewski L, Fischer D: LiveBench-8: the large-scale, continuous assessment of automated protein structure prediction. Protein Sci 2005, 14(1):240–245. 10.1110/ps.04888805
Yona G, Levitt M: Within the twilight zone: a sensitive profile-profile comparison tool based on information theory. J Mol Biol 2002, 315(5):1257–1275. 10.1006/jmbi.2001.5293
Panchenko AR: Finding weak similarities between proteins by sequence profile comparison. Nucleic Acids Res 2003, 31(2):683–689. 10.1093/nar/gkg154
Rychlewski L, Jaroszewski L, Li WZ, Godzik A: Comparison of sequence profiles. Strategies for structural predictions using sequence information. Protein Sci 2000, 9(2):232–241.
Sadreyev R, Grishin N: COMPASS: a tool for comparison of multiple protein alignments with assessment of statistical significance. J Mol Biol 2003, 326(1):317–336. 10.1016/S0022-2836(02)01371-2
Zhang Z, Kochhar S, Grigorov MG: Descriptor-based protein remote homology identification. Protein Sci 2005, 14(2):431–444. 10.1110/ps.041035505
Cheng J, Baldi P: A machine learning information retrieval approach to protein fold recognition. Bioinformatics 2006, 22(12):1456–1463. 10.1093/bioinformatics/btl102
Rangwala H, Karypis G: Building multiclass classifiers for remote homology detection and fold recognition. BMC Bioinformatics 2006, 7: 455. 10.1186/1471-2105-7-455
Rangwala H, Karypis G: Profile-based direct kernels for remote homology detection and fold recognition. Bioinformatics 2005, 21(23):4239–4247. 10.1093/bioinformatics/bti687
Leslie C, Eskin E, Noble WS: The spectrum kernel: a string kernel for SVM protein classification. Pac Symp Biocomput 2002, 564–575.
Kuang R, Ie E, Wang K, Siddiqi M, Freund Y, Leslie C: Profile-based string kernels for remote homology detection and motif extraction. J Bioinform Comput Biol 2005, 3(3):527–550. 10.1142/S021972000500120X
Leslie CS, Eskin E, Cohen A, Weston J, Noble WS: Mismatch string kernels for discriminative protein classification. Bioinformatics 2004, 20(4):467–476. 10.1093/bioinformatics/btg431
Hofmann K, Bucher P, Falquet L, Bairoch A: The PROSITE database, its status in 1999. Nucleic Acids Res 1999, 27(1):215–219. 10.1093/nar/27.1.215
Sadreyev RI, Tang M, Kim BH, Grishin NV: COMPASS server for remote homology inference. Nucleic Acids Res 2007, (35 Web Server):W653–658. 10.1093/nar/gkm293
Zhang Y, Skolnick J: TM-align: a protein structure alignment algorithm based on the TM-score. Nucleic Acids Res 2005, 33(7):2302–2309. 10.1093/nar/gki524
Murzin AG, Brenner SE, Hubbard T, Chothia C: SCOP: a structural classification of proteins database for the investigation of sequences and structures. J Mol Biol 1995, 247(4):536–540.
Chen K, Kurgan L: PFRES: protein fold classification by using evolutionary information and predicted secondary structure. Bioinformatics 2007, 23(21):2843–2850. 10.1093/bioinformatics/btm475
Fontana P, Bindewald E, Toppo S, Velasco R, Valle G, Tosatto SC: The SSEA server for protein secondary structure alignment. Bioinformatics 2005, 21(3):393–395. 10.1093/bioinformatics/bti013
Gribskov M, Robinson NL: Use of receiver operating characteristic (ROC) analysis to evaluate sequence matching. Computers & chemistry 1996, 20(1):25–33. 10.1016/S0097-8485(96)80004-0
Gewehr JE, Hintermair V, Zimmer R: AutoSCOP: automated prediction of SCOP classifications using unique pattern-class mappings. Bioinformatics 2007, 23(10):1203–1210. 10.1093/bioinformatics/btm089
Fischer D: Hybrid fold recognition: combining sequence derived properties with evolutionary information. Pac Symp Biocomput 2000, 119–130.
Lindahl E, Elofsson A: Identification of related proteins on family, superfamily and fold level. J Mol Biol 2000, 295(3):613–625. 10.1006/jmbi.1999.3377
Soding J, Biegert A, Lupas AN: The HHpred interactive server for protein homology detection and structure prediction. Nucleic Acids Res 2005, (33 Web Server):W244–248. 10.1093/nar/gki408
Zhou H, Zhou Y: Single-body residue-level knowledge-based energy score combined with sequence-profile and secondary structure information for fold recognition. Proteins 2004, 55(4):1005–1013. 10.1002/prot.20007
Zhou H, Zhou Y: Fold recognition by combining sequence profiles derived from evolution and from depth-dependent structural alignment of fragments. Proteins 2005, 58(2):321–328. 10.1002/prot.20308
Liu S, Zhang C, Liang S, Zhou Y: Fold recognition by concurrent use of solvent accessibility and residue depth. Proteins 2007, 68(3):636–645. 10.1002/prot.21459
Andreeva A, Howorth D, Brenner SE, Hubbard TJ, Chothia C, Murzin AG: SCOP database in 2004: refinements integrate structure and sequence family data. Nucleic Acids Res 2004, (32 Database):D226–229. 10.1093/nar/gkh039
Li W, Godzik A: Cd-hit: a fast program for clustering and comparing large sets of protein or nucleotide sequences. Bioinformatics 2006, 22(13):1658–1659. 10.1093/bioinformatics/btl158
Jones DT: Protein secondary structure prediction based on position-specific scoring matrices. J Mol Biol 1999, 292(2):195–202. 10.1006/jmbi.1999.3091
Przytycka T, Aurora R, Rose GD: A protein taxonomy based on secondary structure. Nature structural biology 1999, 6(7):672–682. 10.1038/10728
Salwinski L, Eisenberg D: Motif-based fold assignment. Protein Sci 2001, 10(12):2460–2469.
Chang CC, Lin CJ: LIBSVM: a library for support vector machines. Computer Program 2001.
Shindyalov IN, Bourne PE: Protein structure alignment by incremental combinatorial extension (CE) of the optimal path. Protein Eng 1998, 11(9):739–747. 10.1093/protein/11.9.739
We thank the anonymous referees whose constructive comments were very helpful in improving the quality of this work.We are grateful to Drs. Ruslan Sadreyev and Nick Grishin in the Howard Hughes Medical Institute for kindly providing the standalone version of COMPASS package. We also extend our gratitude to Dr. Yang Zhang at the University of Kansas, whose TM-align program was used to derive the structure-seeded profiles in this work. This research was supported by grants from the State High Technology Development Program (2008AA02Z307) and the National Key Basic Research Project of China (2009CB918802).
RXY wrote codes, developed the web server, and drafted the manuscript. JNS and CW participated in the method assessment. ZZ directed the research and critically revised the manuscript. All authors read and approved the final manuscript.
Electronic supplementary material
Additional file 1: All the sequences are provided with FASTA format. (TXT 559 KB)
Additional file 2: All the sequences are provided with FASTA format. (TXT 488 KB)
About this article
Cite this article
Yan, RX., Si, JN., Wang, C. et al. DescFold: A web server for protein fold recognition. BMC Bioinformatics 10, 416 (2009). https://doi.org/10.1186/1471-2105-10-416
- Protein Pair
- Fold Recognition
- Sequence Profile
- Scop Superfamily
- Fold Recognition Method