 Research article
 Open access
 Published:
Foldspecific sequence scoring improves protein sequence matching
BMC Bioinformatics volumeÂ 17, ArticleÂ number:Â 328 (2016)
Abstract
Background
Sequence matching is extremely important for applications throughout biology, particularly for discovering information such as functional and evolutionary relationships, and also for discriminating between unimportant and disease mutants. At present the functions of a large fraction of genes are unknown; improvements in sequence matching will improve gene annotations. Universal amino acid substitution matrices such as Blosum62 are used to measure sequence similarities and to identify distant homologues, regardless of the structure class. However, such single matrices do not take into account important structural information evident within the different topologies of proteins and treats substitutions within all protein folds identically. Others have suggested that the use of structural information can lead to significant improvements in sequence matching but this has not yet been very effective. Here we develop novel substitution matrices that include not only general sequence information but also have a topology specific component that is unique for each CATH topology. This novel feature of using a combination of sequence and structure information for each protein topology significantly improves the sequence matching scores for the sequence pairs tested. We have used a novel multistructure alignment method for each homology level of CATH in order to extract topological information.
Results
We obtain statistically significant improved sequence matching scores for 73Â % of the alpha helical test cases. On average, 61Â % of the test cases showed improvements in homology detection when structure information was incorporated into the substitution matrices. On average zscores for homology detection are improved by more than 54Â % for all cases, and some individual cases have zscores more than twice those obtained using generic matrices. Our topology specific similarity matrices also outperform other traditional similarity matrices and single matrix based structure methods. When default amino acid substitution matrix in the Psiblast algorithm is replaced by our structurebased matrices, the structure matching is significantly improved over conventional Psiblast. It also outperforms results obtained for the corresponding HMM profiles generated for each topology.
Conclusions
We show that by incorporating topologyspecific structure information in addition to sequence information into specific amino acid substitution matrices, the sequence matching scores and homology detection are significantly improved. Our topology specific similarity matrices outperform other traditional similarity matrices, single matrix based structure methods, also show improvement over conventional Psiblast and HMM profile based methods in sequence matching. The results support the discriminatory ability of the new amino acid similarity matrices to distinguish between distant homologs and structurally dissimilar pairs.
Background
With more and more genomes being sequenced and the resulting problem of poor annotations becoming more critical it is important to turn attention to improving sequence matching to enable better identification of function. The most common way to annotate genes and identify the function of a new gene is based on identifying a similar sequence by sequence matching against proteins of known function. However, this remains a challenge [1â€“8], and it is generally thought that ~40Â % of genes do not have a known function. Also for protein structure prediction, sequence matching of protein sequences is the standard way to identify protein homologs  the first step in protein homology model building. The huge numbers of protein sequences with unknown structures and unknown functions cannot be identified by the present sequence matching with the present sets of annotated sequences and structures. Thus, improving protein sequence matching should enable improving both the identification of remote homologs, for the predictions of the structures and function of large numbers of protein sequences.
The quality of sequence alignments and the similarity scores used for sequence matching depend critically on the amino acid substitution matrices that are used. Substitution matrices are developed by alignment of protein sequences. Alignment is important in biology and can reveal crucial information about evolution. These alignments can identify patterns of sequence conservation of proteins that belong to fold families. Although sequence alignments are popular and far more frequently performed they are not very reliable whenever sequences are too different showing little sequence similarity. These are cases sometimes called the twilight and midnight zones. There are cases where similar structures have extremely little or no sequence similarity. Moreover, there are also structures that have sequences that are very similar but have completely different folds [9]. When the sequence identity between two related proteins falls below 30Â %, sequencebased search methods do not perform well [10].
However, when protein structures are more conserved than their sequences [11] it will be more reliable to align structures instead of sequences. Improved substitution matrices can be built from structure alignments, based on the amino acid identities of proximate pairs in the aligned structure pair. Better substitution matrices can capture distant evolutionary relationships and can more reliably detect distant evolutionary relationships. Success will depend on how well these newly developed matrices can detect the sequence similarities among distantly related sequences.
Amino acid substitutions do not obey universal rules. There are some amino acid substitutions that more commonly occur in related proteins. It is important for the substituted amino acids to be compatible with the protein structure and function. Some have postulated that a specific amino acid in one position is conserved for different reasons than at other positions [12â€“14]. If a substitution is not compatible, then a single mutation can modify the protein structure and sometimes, though rarely, even disrupt the whole protein function or denature the protein. Often, these substitutions are preferential for chemically similar or size similar amino acids or similar in charge. However, other changes may also occur to compensate for neighboring changes â€“socalled compensatory mutations. Residues on the surface can often be substituted with nearly any type of amino acid, unless it is a critical functional residue. If we know the specific types of changes that are most and least common within a large number of proteins, this information can assist with sequence matching. But combining information from many different types of structures means that the substitution metric loses much of its specificity. The availability of a large body of sequence and structure information can aid in expanding these types of statistical computational methods.
Sequencebased similarity matrices
The earliest similarity matrices were the Pam matrices from from Margaret Dayhoffâ€™s group [15], which were based upon extremely small numbers of manually aligned sequences and then the Blosum matrices [16], which were developed later using much more. These matrices are statistical matrices where the frequency of occurrence of mutations is used for their derivation. Another type of substitution matrix that is based on amino acid contact frequencies in proteins was reported by Miyazawa and Jernigan [17]. Statistical amino acid contact potential based similarity matrices have also been developed [18]. Contact propensity of amino acids is a strongly conserved feature of each position of a protein, and amino acid matrices can be obtained from the correlations within the pairwise amino acid contact potentials. Vilim et al. developed substitution matrices employing a method similar to Blosum. However, instead of focusing on positions that are strongly conserved they considered particularly positions that are different within a family of proteins [19].
There are also studies where multiple sequence information was used to develop Hidden Markov Models for families of proteins [20, 21]. In another study, Kuznetsov et al. compared general purpose matrices and found that the maximum likelihood method [22] is the best performing standard matrix [23]. However, they also stated that no generic matrix can outperform all other matrices for all protein structural folds. Some of the other similarity matrices developed in the past include those of Luthy et al., Niefind et al., Overington et al., Koshi et al., and Russell et al. [24â€“28]. Tomii et al. [29] obtained mutation matrices using amino acid indices which are a set of numerical values representing any of the different physicochemical and biochemical properties of amino acids. They used 42 published matrices and performed cluster analysis to construct a substitution matrix. They also tried to reproduce these starting substitution matrices by combining amino acid indices and found that matrices like PAM and volume and hydrophobicity of amino acids are correlated. In a recent study done by Yamada and Tomii [30], they developed a principal component analysis based matrix using existing substitution matrices, Blosum, VTML [22] and BCG [31]. Their results proved were improved compared to generic purpose substitution matrices.
Structure information in similarity matrices
Since structure is more conserved than sequence [11], a more appropriate way to approach this issue is by using structure alignments. Prlic et al. used structure alignments to derive similarity matrices (PRLA1) [32]. They used a data set of superimposed protein pairs to derive evolutionary information. These pairs have high structural similarity but low sequence similarity. Structural information has also been used to enrich substitution matrices [33]. They used a linear combination of the sequence substitution matrix Blosum50 and a threading energy table Thom2. The resulting matrix was shown to improve the prediction accuracy for homology modeling in the twilight zone. It was suggested that by further incorporating protein structural descriptors such as secondary structure and exposed surface area in a linear fashion better performance could be obtained. The Johnson and Overington matrix (JOHM) takes into account not only the substitutions that occur in similar parts of protein structures but also the variable regions where gaps occur [34]. Blake and Cohen built similarity matrices (eg: BC0030) where structural superposition of protein structures was performed by using structures obtained from CATH database [35]. The structures were selected based on the sequence identities and the alignments were performed for ranges of different sequence identities. These series of matrices were used in structurefunction prediction. Some studies have shown that the use of protein family specific substitution matrices is helpful to identify orthologs that are not identified with the standard Blosum matrices [36]. In that study the authors developed parasite specific similarity matrices and were thereby able to annotate apicomplexan proteins which have unknown functions.
It is clear that structure based matrices are key for improvements in sequence matching. Although there are some methods that use structure information they fail to capture the unique information for each topology. It is important that the substituted amino acids are compatible with the protein structure and function. For most protein sequence comparisons only a single amino acid matrix is used. The overall goal in this study is to develop different amino acid substitution matrices for different topologies of proteins. The novelty in our work resides in several of its aspects. We employ a novel multistructure alignment at each homology level (H) of the CATH structures in order to extract topological information. In addition to using structure information we also use a sequence information component to find the unique evolutionary conserved residues in each CATH topology. A weighting system between these two components is used to determine the optimal portion of sequence and structure information that gives the best fit for sequence matching.
Methods
The CATH database of the hierarchical domain classification of protein structures was utilized to obtain the structures to develop our topologybased similarity matrices. The S35 family [37] of CATH data was used where structures are clustered at the 35Â % level of sequence identity. We are interested in distinctions at the topology or fold level of structures. In the fold level, structures are grouped together by the overall shape of structures and the connectivity of the secondary structure elements. One hundred ninety eight all helical topologies, 137 all beta sheet topologies and 330 alpha/beta mixed topologies were chosen (Additional file 1). We have not included topologies having little secondary structure. The amino acid compositions along with other properties of these three structural classes differ [38, 39] and therefore we wanted to treat these three classes separately.
Structures were categorized according to their CATH topology (T level). Each set of sequences that belong to the same CATH topology was further categorized into its homology level (H level). These homology level structures are categorized as sharing a common ancestor in CATH. Proteins that share the same H level are said to be evolutionarily related or homologous. Proteins belonging to different H levels are called analogous and they have no evolutionary relationships. For sequences belonging to each homology level multiple structure alignments were performed using the Mustang (MUltiple STructural AligNment AlGorithm) alignment program [40], which uses a progressive pairwise framework to build and report the multiple structure alignments and superposition of structures. At least two structures need to be available for each topology in order to perform a structure alignment. A further breakdown of topology levels into the homology level is required because the homology level structural similarity is necessary to obtain reasonably good structure alignments. Doing structure alignments at the topology level is illposed and not very sensible.
Mustang yields a sequence alignment based on the multiple structure alignment of each homology level structure set. A C^{Î±} cutoff distance was used to find the residues in each pair of structures lying close together within the alignment. If a pair of residues belonging to two different protein structures in the structure alignment were found within the cutoff distance, they were then considered to be substitutions between the two structures. This is the physical basis for our substitution matrix. If there were no amino acid pairs between a pair of structures within the cutoff distance, then this was counted as a gap in the corresponding multiple sequence alignment that is developed.
Eight distance cutoffs between 1 Ã… and 8Â Ã… were first used for our preliminary test set. All pairwise sequence comparisons were carried out on these multiple sequence alignments and the number of times one amino acid was substituted by another was counted at each homology level. A 21Ã—21 matrix (including gaps) was obtained containing the total number of counted substitutions. Normalization was performed by dividing the count for each type of substitution by the number of amino acids involved in that particular substitution. For example, if amino acid C was replaced with amino acid R x number of times, that count was then divided by the number of times C was replaced with any other amino acid that was not R (including C being replaced by a gap). All the homology level similarity matrices belonging to the same topology were added together in order to obtain the topology level substitution matrices. The normalized matrices were obtained by normalizing the maximum value of the 20Ã—20 matrix to 1. A schematic diagram of how homology level matrices are added together in order to get the corresponding topology level matrix (1.10.10) is shown in Fig.Â 1.
The topology matrices were further modified by adding in a standard similarity matrix (Blosum62 or VT160_RA [41]). The VT160_RA matrix is based on a mathematical formalism which is referred to as the resolvent approach and protein evolution is modeled as a Markov process. This method takes into account various degrees of evolutionary divergence and iteratively cycles between estimating the evolutionary distance between an alignment and updating the estimator for the matrix.
The generic matrices were added to topology based matrices with different weight coefficients (x) varying from 1 to 30 for the topologybased matrices, to obtain the final similarity matrices that incorporate the new topology information:
In our preliminary calculation using 27 topologies with weights from 1 to 100, we observed that the best weights always lie between 10 and 30. Therefore the weight range was selected to be from 10 to 30 in the subsequent studies. These combined matrices were multiplied by 100 and round to the nearest integer in order to capture all the minor variations as well. The maximum value of the matrix was set to 20.
Test dataset
We wanted to test our topology based matrices against a distant homologs protein set. Sets of structurally similar but sequence dissimilar pairs (SSSD) of proteins are used as the test dataset. These selected pairs have unique CATH topologies (Additional file 1).
The preliminary study was performed on a dataset consisting of 27 CATH topologies which were obtained by Friedberg et al. [42] and Prlic et al. 2000 [32]. The list of the test topologies and the sequences can be found on our website. These sequence pairs have less than 30Â % sequence identity. There are eight all helical sequence pairs, nine all beta sheet sequence pairs and ten alpha/beta sequence pairs in our selected set of sequence pairs. The preliminary dataset was used to obtain the best cutoff distances for structure alignment and it also gave an indication of the relative performance from using the different standard matrices used to obtain the combined matrices. The preliminary dataset has also been used to find the appropriate range of weights to investigate.
After doing the first calculations using the above mentioned preliminary dataset, a second dataset which was larger and more complete was obtained from the GG benchmark dataset [43] for the subsequent studies. Two hundred seventy six sequences belonging to 92 unique CATH topology were extracted so that each CATH topology has three sequences. All these sequences show less than 30Â % sequence identity. There are 27 all helical topologies, 19 all beta sheet and 46 alpha/beta topologies (Additional file 1). These sequences can also be downloaded from our website. Since there are three sequences for each unique topology, three sets of pairs are included for each topology. This gives three independent subsets for the second dataset. These three subsets will be referred to as test set A, test set B and test set C below. All calculations have been performed on each of these subsets, and the results are seen to agree well with each other. Results were obtained separately for each of the three classes. For each topology in each class, alignment scores were calculated for all sequence combinations using the NeedlemanWunsch algorithm from the Bioshell package [44] with default gap penalties(gap opening penaltyâ€‰=â€‰10, gap extension penaltyâ€‰=â€‰1). Here the goal was to learn whether the structurebased matrices are capable of distinguishing the structurally similar pairs of sequences from the other pairs better than can be done using standard generic matrices alone.
Suppose there are n number of topologies in the test set for one class and the sequences for the first topology is S_{1} and S_{1}â€™, and that for the n^{th} topology are S_{n} and S_{n}â€™. Then the scores are calculated for the structurally similar sequence pairs (S_{1}:S_{1}â€™, S_{2}:S_{2}â€™ â€¦ S_{n}:S_{n}â€™) and for each crosspair that does not belong to the same topology (S_{1}:S_{2}â€™, S_{1}:S_{3}â€™â€¦. S_{1}:S_{n}â€™; S_{2}:S_{1}â€™, S_{2}:S_{3}â€™, S_{2}:S_{n}â€™; S_{n}:S_{1}â€™, S_{n}:S_{n1}â€™â€¦. etc.). For topology number 1, the S_{1}:S_{1}â€™ score (which is the structurally similar score) is expected to be distinguishable from all the crosspairs for that topology (S_{1}:S_{2}â€™, S_{1}:S_{3}â€™,â€¦. S_{1}:S_{n}â€™).
For each topology, the scores were obtained for four matrices: the corresponding new combined topologybased matrix, the Blosum62 matrix, the VT160_RA matrix and the VTML200 matrix. VTML200 is another generic matrix that uses a maximum likelihood estimator [22]. The Blosum62 matrix does not take into account evolutionary distances; however, VT160_RA and VTML200 matrices do.
In order to compare the results obtained for different matrices, zscores were calculated using the mean and standard deviation (SD) of data with the following equation:
For the given example,
Scores were obtained for all the cross set sequence pairs and structurally similar sequence pairs for all topologies of the three classes. These scores correspond to different weight coefficients. Weight 0 corresponds to the standard matrix alone (Blosum62/VT160_RA). The mean and the standard deviation for each matrix were calculated and the zscores are obtained. After the zscores were obtained for each weight of the corresponding combined matrix for the topology and that for Blosum62, VT160_RA and VTML200, comparisons were carried out. Then we find the similarity matrix that gave the best zscores, that is, which matrix was able to best distinguish the structurally similar pairs from all of the other structurally dissimilar pairs. In this way we can learn which matrices are best for identifying distant homologs.
The newly developed structure based matrices were also compared with other structure based matrices in literature. As previously described zscores were calculated for topology based matrices and other structure based matrices such as BC0030 [35], JOHM [34], and PRLA1 [32]. The performance of topology based matrices was also compared with two well established methods, Psiblast and Hidden Markov Model (HMM) methods.
Psiblast
Psiblast is a frequently used search algorithm to detect homologous sequences [45]. For each class, the 2^{nd} sequence of the sequence matching pair for each topology (S_{1}â€™, S_{2}â€™, S_{3}â€™.., S_{n}â€™) was used to obtain the Psiblast database for each class and was formatted for Psiblast search. The test query sequences were S_{1}, S_{2}, S_{3}, â€¦, S_{n}. The sequences used in obtaining the topology based matrices for each topology were used as input for each topology. The multiple sequence alignments for these sequences were obtained from clustalW. Two rounds of interactions were used. For each topology, the hits for each query sequence (S1, S2, S3, â€¦, Sn) were obtained using the database that contain S1â€™, S2â€™, S3â€™.., Snâ€™. For each test query sequence, it was tested to see if the correct structure matching hit was identified from the database. Psiblast was also run by replacing the default Blosum62 matrix with the corresponding topology based matrix for each case. A matrix corresponding to weight 5 was used for each case of the topology based matrix and the values in the matrix were divided by 100 and converted to the nearest integer before being used as input into Psiblast algorithm.
Profile HMM
Hidden Markov Models (HMM) for sequence matching are probabilistic models that are found to be efficient for homology detection [46â€“48]. The sequences that were used to create each topology based matrix were used to obtain multiple sequence alignments and to generate HMM profiles for each topology. HMMER software was used for the generation of HMM profiles [49, 50]. As in Psiblast, the 2^{nd} sequence of the sequence matching pair for each topology (S_{1}â€™, S_{2}â€™, S_{3}â€™.., S_{n}â€™) was used to obtain the Psiblast database for each class. The database was searched using HMMER hmmsearch for each query sequence S_{1}, S_{2}, S_{3}, â€¦, S_{n} using the corresponding HMM profile built for each topology. Each test query sequence was tested to see if the correct structure match pair can be identified from the database.
Results and discussion
FiguresÂ 2, 3, and 4 show the maximum (best) average zscore obtained by topology matrices relative to Blosum62 matrix zscore for a range of structure alignment cutoff distances (D); Fig.Â 2 is for all helical, Fig.Â 3 is for all beta sheet and Fig.Â 4 is for alpha/beta. All three figures show a peak near 3Â Ã…, indicating this to be an optimal distance cutoff. This peak is sharpest for the all beta sheet case although the variation is small. For alpha/beta case the decrease in the zscores is small and remains nearly constant. From the figures the best distances are chosen to be three, 3 and 4Â Ã… for all helical, all beta sheet and alpha/beta respectively. Although for alpha/beta, the choice between 3 and 4Â Ã… cutoff distances do not make a significant difference, we have used 4Â Ã…. For the calculations hereafter these structure alignment cutoff distances are used. Within this cutoff distance the residue pairs are aligned from the sequence match and are considered to be substitutions.
For the selected cutoff distances, the average zscores obtained for each class with different weight coefficients are shown in Fig.Â 5. The zscores are averages over all the topologies belonging to each class. The zscores obtained using the generic matrices are also shown on the left sides for comparison. FigureÂ 5(a) shows the average zscores when topologybased matrices are obtained with Blosum62 as the basis matrix and Fig.Â 5(b) shows the zscores when the topology matrices are based on the VT160_RA matrix. There is no significant difference in zscores when the weights are changed. It can be seen that zscores level off with increasing weight but when the weights are greater thanâ€‰~â€‰40 the zscores rapidly decrease (not shown). All results shown are for test set A. Similar results are obtained for the other two test sets (B and C). The improvement using the topologybased matrices is significant and can be seen in comparison to the generic matrices on the left side. Zscores obtained for helical matrices are higher with respect to beta sheet and alpha/beta classes. Beta sheet shows the lowest zscore values for all matrices.
TablesÂ 1, 2, and 3 show the average zscores obtained for the three classes when the three generic matrices (Blosum62, VT160_RA, and VTML200) and the topologybased matrices are used. The maximum improvement obtained for each topology when the corresponding topology matrix is used is also shown for topology matrices obtained by using Blosum62 as the basis matrix and VT160_RA as the basis matrix. Here only the topologies that show improvement in zscore for both Blosum62 combined and VT160_RA combined topologybased matrices are shown. The zscores obtained for all the topologies for the three datasets are given in Additional file 1: Tables S4(a), (b) and (c). The average values of zscores of all the topologies are compared to the averages obtained only using the topologies where zscore improvements were shown in Additional file 1: Table S5.
The percent number of improvements obtained for the three classes are shown in TableÂ 4. The average percentage of improvement obtained is 61Â %. For the Blosum62 combined topologybased matrices, all helical class improvements are observed for 73Â % of the cases, all beta sheet class 53Â % and for alpha/beta 56Â %. For VT160_RA combined topologybased matrices, all helical class show improvements again for 73Â % of cases and for beta sheet class 49Â % and for alpha/beta 56Â %. Overall the number of improvements is slightly higher for the topologybased matrices obtained using Blosum62 as the basis matrix. And the best results are obtained for all helical topologies.
FigureÂ 6 compares the average zscores obtained for the all helical, the all beta sheet and the alpha/beta classes for different generic matrices and topologybased matrices. The average zscores obtained for topologybased matrices are always higher than for the standard matrices (Blosum62, VTML200 and VT160_RA). The best weight for each class is taken and is used to obtain the optimized zscore for each topology in that class. This weight is found by averaging all the zscores obtained for each weight of each topology in the class and taking the maximum average zscore given weight for that class. The maximum zscores are the best zscores for each individual topology. FigureÂ 6 shows that the maximum average zscore obtained for each class is higher than the average zscores for the optimized weight for each class (optimized zscore). The zscore corresponding to this weight is used for all the topologies in each structural class and is termed the optimized zscore for each topology. The average zscores for matrices obtained on the Blosum62 combined topologybased matrices and the VT160_RA combined topologybased matrices are approximately the same. This is true for both the optimized zscore and the maximum average zscore. Maximum average zscores obtained for the topologybased matrices show a significant improvement in comparison with the standard matrices.
The newly developed structure based matrices were also compared with other structure based matrices in literature. As previously described zscores were calculated for topology based matrices and other structure based matrices BC0030, JOHM, and PRLA1. For some cases the performance of topology based matrices clearly outperformed all three of these single matrix based matrices. For example, for all beta topologies 2.170.16 and 2.30.110 the improvements were over 20Â % and for topology 2.102.10 topology the improvement was almost 50Â %. Traditional Psiblast program picks the structurally similar pairs for 23/27 of the all alpha test cases, 16/19 of the all beta test cases and 42/46 of alpha beta test cases (see Additional file 1). Matching pairs were not found for topologies 1.10.533, 1.10.1200, 1.10.1220, 1.20.1250, 2.30.30, 2.40.128, 2.60.40, 3.10.20, 3.30.420, 3.40.630 and 3.90.550. For corresponding HMM profiles generated for topologies, matching pairs were found for 23/27 all alpha test cases, 15/19 all beta test cases, and 41/46 alpha beta test cases. Matching pairs were not identified for topologies 1.10.150, 1.10.238, 1.20.120, 1.25.10, 2.30.30, 2.40.50, 2.60.40, 2.60.120, 3.10.20, 3.20.20, 3.30.70, 3.30.450, and 3.40.630. There were 2 all beta topologies (2.30.30, 2.60.40) and 2 alpha beta topologies (3.10.20, 3.40.630) for which matching pairs were not identified by either of the two conventional methods psiblast search and HMM profile search (TableÂ 5). TableÂ 5 shows the evalues of hits for PSIblast search, profile HMM search and topology based PSIblast search for topologies that didnâ€™t give hits for Psiblast or profile HMMs. The topology based Psiblast clearly outperforms these popular conventional methods for not only these cases where hits were not obtained by conventional methods but also picks the right match for all the cases we tested. All results are included in Additional file 1.
Conclusions
Similarity matrices are used extensively in many different applications in computational biology. Standard matrices like Blosum62 have been generated without taking into account any topological information, although the statistics of amino acid substitutions vary with protein topology. There are some amino acid substitutions that occur more frequently in some topologies than in others and these are usually substitutions do not affect the function of these proteins. The hypothesis for this study has been that different protein topologies exhibit different amino acid substitution statistics. Here we have used structural alignment of protein structures belonging to each CATH topology and used these alignments to develop similarity matrices for each CATH topology by making amino acid substitution assignments directly from the structure alignments. We combine this structural information with general purpose matrices so that both sequence and structure components are incorporated into the newly generated topology specific matrices. We have tested our matrices using a dataset of distant homologous proteins that belong to unique CATH topologies. Our results show improved performances in sequence matching when we use our new combined topologybased matrices compared to using generic standard matrices such as Blosum62. Our combined topologybased matrices were able to distinguish structurally similar protein pairs with a better fidelity than the generic standard matrices such as Blosum62, VT160_RA and VTML200.
We have used generic matrices as anchor matrices for our topologybased matrices by adding these as perturbations to the standard matrices. This is specifically important for cases where there are too few structures in a protein family. It is evident from the scores obtained using VTML200 as the basis for generating combined topologybased matrices in the preliminary dataset that the improvements observed are approximately similar to those using VT160_RA. Therefore, only the Blosum62 and VT160_RA generic matrices were used for generating the combined topologybased matrices. We have used the same gap penalties (gap opening penalty of ten and gap extension penalty of 1). However, gap penalties might possibly be optimized to improve alignments to obtain further improvements. Zscores are best when the Blosum62 matrix is used as the basis for the combined topologybased matrices compared to the scores obtained by the combined topology matrices generated using VTML160_RA as the basis.
The best weight for each class is taken and is used to obtain the optimized zscore for each topology for that class. Maximum zscores are obtained for the corresponding weight that gives the best zscores for each individual topology. Maximum zscores that were obtained are always higher than the zscores obtained with the optimized weights. This shows that there may still be room for improvement to sequence alignment. Although there is not a significant difference between the two types of topologybased matrices, slightly better results are seen for topologybased matrices built upon Blosum62 as the basis matrix. Improvements of zscores obtained using topologybased matrices are significant compared to the scores obtained using any of the generic standard matrices. This demonstrates the importance of using topologybased similarity matrices when performing sequence matching. Sequence matching can be improved significantly by using the foldspecific similarity matrices, and this will aid in improving many aspects of homology modeling of proteins and gene annotation.
For the all helical cases the number of improvements observed is 73Â % for both types of combined topologybased matrices. The number of improved cases for the beta sheet class is lower than for the helical class or the alpha/beta class. In almost any protein structure prediction the accuracy for alpha helical structures is nearly always higher than for beta sheet structures. This could be due to the fact that there are more long range interactions in beta sheet structures relative to short range interactions than in alpha helices. On average for the three classes, the original zscores obtained for the generic matrices are doubled when topologybased matrices are used.
We have also repeated our calculations taking into account less detail than at the topology level. That is the second level of CATH (architecture level). However, we found that the discrimination power of the matrices decreases substantially. Hence, the best sequence matching scores are obtained when topology level matrices are used.
Results for sequence matching for Psiblast search and topology based Psiblast search, clearly show that replacing standard Blosum62 in Psiblast search results in improvements in sequence matching. Topology based Psiblast search also outperform profile based HMM for the cases tested. These results clearly show the importance of using topology specific similarity matrices instead of using standard matrices that are used in common practice today. A server for sequence matching using fold specific matrices is developed and will be made available in a subsequent publication.
Abbreviations
 CATH:

Classification of protein structures downloaded from the Protein Data Bank
 HMM:

Hidden Markov Models
 Pdb:

RCSN Protein Data Bank
References
Brent MR. Genome annotation past, present, and future: How to define an ORF at each locus. Genome Res. 2005;15:1777â€“86.
Reed J, Famili I, Thiele I, Palsson B. Towards multidimensional genome annotation. Nat Rev Genet.Â 2006;7:130â€“41.
Ashurst JL, Collins JE. Gene annotation: Prediction and testing. Annu Rev Genom Human Genet. 2003;4:69â€“88.
Yandell M, Ence D. A beginnerâ€™s guide to eukaryotic genome annotation. Nat Rev Genet. 2012;13:329â€“42.
Taylor WR. A template based method of pattern matching in protein sequences. Prog Biophys Mol Biol. 1989;54:159â€“252.
Barton GJ Protein multiple sequence alignment and flexible pattern matching. In Methods in Enzymology. Volume 183 edition: Academic Press, San Diego CA; 1990:403â€“428.
Stein L. Genome annotation: From sequence to biology. Nat Rev Genet. 2001;2:493â€“503.
Lambert C, Campenhout JV, DeBolle X, Depiereux E. Review of common sequence alignment methods: clues to enhance reliability. Curr Genomics. 2003;4:131â€“46.
Kosloff M, Kolodny R. Sequencesimilar, structuredissimilar protein pairs in the PDB. Proteins. 2008;71:891â€“902.
Rost B. Twilight zone of protein sequence alignments. Protein Eng. 1999;12:85â€“94.
Illergard K, Ardell D, Elofison A. Structure is three to ten times more conserved than sequenceâˆ’A study of structural response in protein cores. Proteins. 2009;77:499â€“508.
Solis AD, Rackovsky S. Propertybased sequence representations do not adequately encode local protein folding information. Proteins. 2007;67:785â€“8.
Rackovsky S. Sequence physical properties encode the global organization of protein structure space. Proc Natl Acad Sci. 2009;106:14345â€“8.
Rackovsky S. Sequence determinants of protein architecture. Proteins. 2013;81:1681â€“5.
Schwartz RM, Dayhoff MO. Origins of prokaryotes, eukaryotes, mitochondria, and chloroplasts. Science. 1978;199:395403.
Henikoff S, Henikoff J. Aminoacid substitution matrices from protein blocks. Proc Natl Acad Sci U S A. 1992;89:10915â€“9.
Miyazawa S, Jernigan RL. A new substitution matrix for protein sequence searches based on contact frequencies in protein structures. Protein Eng. 1993;6:267â€“78.
Tan Y, Huang H, Kihara D. Statistical potentialbased amino acid similarity matrices for aligning distantly related protein sequences. Proteins. 2006;64:587â€“600.
Vilim RB, Cunningham RM, Lu B, Kheradpour P, Stevens FJ. Foldspecific substitution matrices for protein classification. Bioinformatics. 2004;20:847â€“53.
Karplus K, Sjolander K, Barrett C, Cline M, Haussler D, Hughey R, Holm L, Sander C. Predicting protein structure using hidden Markov models. Proteins. 1998;29:134â€“9.
Di Francesco V, Geetha V, Garnier J, Munson PJ. Fold recognition using predicted secondary structure sequences and hidden Markov models of protein folds. Proteins. 1997;1:12331.
Muller T, Spang R, Vingron M. Estimating amino acid substitution models: A comparison of Dayhoffâ€™s estimator, the resolvent approach and a maximum likelihood method. Mol Biol Evol. 2002;19:8â€“13.
Kuznetsov IB. Protein sequence alignment with familyspecific amino acid similarity matrices. BMC Res Notes. 2011;4:1â€“10.
Luthy R, McLachlan AD, Eisenberg D. Secondary structurebased profiles: Use of structureconserving scoring tables in searching protein sequence databases for structural similarities. Proteins. 1991;10:229â€“39.
Niefind K, Schomburg D. Amino acid similarity coefficients for protein modeling and sequence alignment derived from mainchain folding angles. J Mol Biol. 1991;219:481â€“97.
Overington J, Donnelly D, Johnson MS, Sali A, Blundell TL. Environmentspecific amino acid substitution tables: Tertiary templates and prediction of protein folds. Protein Sci. 1992;1:216â€“26.
Koshi JM, Goldstein RA. Contextdependent optimal substitution matrices. Protein Eng. 1995;8:641â€“5.
Russell RB, Saqi MAS, Sayle RA, Bates PA, Sternberg MJE. Recognition of analogous and homologous protein folds: analysis of sequence and structure conservation. J Mol Biol. 1997;269:423â€“39.
Tomii K, Kanehisa M. Analysis of amino acid indices and mutation matrices for sequence comparison and structure prediction of proteins. Protein Eng. 1996;9:27â€“36.
Yamada K, Tomii K. Revisiting amino acid substitution matrices for identifying distantly related proteins. Bioinformatics. 2014;30:317â€“25.
Bennet SA, Cohen MA, Gonnet GH. Amino acid substitution during functionally constrained divergent evolution of protein sequences. Protein Eng. 1994;7:1323â€“32.
Prlic A, Domingues F, Sippl M. Structurederived substitution matrices for alignment of distantly related sequences. Protein Eng Des Sel. 2000;13:545â€“50.
Teodorescu O, Galor T, Pillardy J, Elber R. Enriching the sequence substitution matrix by structural information. Proteins. 2004;54:41â€“8.
Johnson MS, Overington JP. A Structural Basis for Sequence Comparisons: An Evaluation of Scoring Methodologies. J Mol Biol. 1993;233:716â€“38.
Blake JD, Cohen FE. Pairwise sequence alignment below the twilight zone. J Mol Biol. 2001;307:721â€“35.
Ali J, Thummala S, Ranjan A. The parasite specific substitution matrices improve the annotation of apicomplexan proteins. BMC Genomics. 2012;13:S19.
Orengo CA, Michie AD, Jones S, Jones DT, Swindells MB, Thornton JM. CATHa hierarchic classification of protein domain structures. Structure. 1997;5:1093â€“109.
Bahar I, Atilgan A, Jernigan R, Erman B. Understanding the recognition of protein structural classes by amino acid composition. Proteins. 1997;29:172â€“85.
Chou KC. Does the folding type of a protein depend on its amino acid composition? FEBS Lett. 1995;363:127â€“31.
Konagurthu A, Whisstock J, Stuckey P, Lesk A. MUSTANG: A multiple structural alignment algorithm. Proteins. 2006;64:559â€“74.
Muller T, Vingron M. Modeling Amino Acid Replacement. J Comput Biol. 2000;7:76176.
Friedberg I, Margalit H. Persistently conserved positions in structurally similar, sequence dissimilar proteins: Roles in preserving protein fold and function. Protein Sci. 2002;11:350â€“60.
Gniewek P, Kolinski A, Gront D. Optimization of ProfiletoProfile Alignment Parameters for OneDimensional Threading. J Comput Biol. 2012;19:87986.
Gront D, Kolinski A. BioShellâˆ’a package of tools for structural biology computations. Bioinformatics. 2006;22:621â€“2.
Altschul SF, Madden TL, Schaffer AA, Zhang J, Zhang Z, Miller W, Lipman DJ. Gapped BLAST and PSIBLAST: a new generation of protein database search programs. Nucleic Acids Res. 1997;25:3389â€“402.
Soding J. Protein homology detection by HMMÎ“Ã‡Ã´HMM comparison. Bioinformatics. 2005;21:951â€“60.
Bernardes J, Davila A, Costa V, Zaverucha G. Improving model construction of profile HMMs for remote homology detection through structural alignment. BMC Bioinformatics. 2007;8:435.
Pal A, Mishra D, Mishra S, Satapathy SK, Das K. A Study on Protein (Pglycoprotein) Homology Detection using Hidden Markov Model. Procedia Eng. 2012;38:3541â€“6.
Eddy SR. Profile hidden Markov models. Bioinformatics. 1998;14:755â€“63.
Eddy SR. Accelerated Profile HMM Searches. PLoS Comput Biol. 2011;7:e1002195.
Acknowledgements
Not applicable.
Funding
This research was supported by NIH grants GM072014 and GM081680.
Availability of data and materials
All data that was used in this project is included in the Additional file 1.
Authorsâ€™ contributions
All authors have contributed to the planning, execution and writing of this paper. All authors read and approved the final manuscript.
Competing interests
The authors declare that they have no competing interests.
Consent for publication
Not applicable.
Ethics approval and consent to participate
Neither human material nor human data were used in this project.
Author information
Authors and Affiliations
Corresponding author
Additional file
Additional file 1:
Supplementary materials. (DOCX 66 kb)
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The Creative Commons Public Domain Dedication waiver (http://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated.
About this article
Cite this article
Leelananda, S.P., Kloczkowski, A. & Jernigan, R.L. Foldspecific sequence scoring improves protein sequence matching. BMC Bioinformatics 17, 328 (2016). https://doi.org/10.1186/s128590161198z
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/s128590161198z