An important aspect of the functional annotation of enzymes is not only the type of reaction catalysed by an enzyme, but also the substrate specificity, which can vary widely within the same family. In many cases, prediction of family membership and even substrate specificity is possible from enzyme sequence alone, using a nearest neighbour classification rule. However, the combination of structural information and sequence information can improve the interpretability and accuracy of predictive models. The method presented here, Active Site Classification (ASC), automatically extracts the residues lining the active site from one representative three-dimensional structure and the corresponding residues from sequences of other members of the family. From a set of representatives with known substrate specificity, a Support Vector Machine (SVM) can then learn a model of substrate specificity. Applied to a sequence of unknown specificity, the SVM can then predict the most likely substrate. The models can also be analysed to reveal the underlying structural reasons determining substrate specificities and thus yield valuable insights into mechanisms of enzyme specificity. We illustrate the high prediction accuracy achieved on two benchmark data sets and the structural insights gained from ASC by a detailed analysis of the family of decarboxylating dehydrogenases. The ASC web service is available at http://asc.informatik.uni-tuebingen.de/.
Prediction of enzymatic function of experimentally uncharacterised sequences is an important task in annotation of sequence databases. While all the information on an enzyme's specificity is necessarily contained in its sequence, prediction methods using sequence alone often do not perform all that well. Obviously, structural information – if available – will yield precious hints on the function and relative importance of specific sequence positions with respect to substrate specificity. We propose a novel method (Active Site Classification, ASC) for enzyme classification bringing together structural information and sequence information. Our ASC web server allows users to build predictive models in an automated way focused on relevant enzyme residues and furthermore to interpret the models to gain insights into the mechanism of enzyme substrate specificity.
Citation: Röttig M, Rausch C, Kohlbacher O (2010) Combining Structure and Sequence Information Allows Automated Prediction of Substrate Specificities within Enzyme Families. PLoS Comput Biol6(1): e1000636. https://doi.org/10.1371/journal.pcbi.1000636
Editor: Chris P. Ponting, University of Oxford, United Kingdom
Received: June 11, 2009; Accepted: December 8, 2009; Published: January 8, 2010
Copyright: © 2010 Röttig et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
Funding: This work was supported in part by Deutsche Forschungsgemeinschaft (DFG, grant SFB 766/A9). The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.
Competing interests: The authors have declared that no competing interests exist.
The number of protein sequences in public databases has been growing almost exponentially due to great advances in sequencing technologies and a decline in sequencing costs. However, as the number of experimentally characterised sequences does not grow at the same speed, the fraction of protein sequences without any functional annotation also increases. An experimental investigation of all these new sequences would be too time-consuming and too costly. Consequently, the fraction of enzyme sequences in current databases with experimentally characterised function is around 5% only . Therefore, automated computational methods are needed to assign a putative function to uncharacterised sequences reliably.
To predict the putative function of a protein, currently established methods rely on the fact that two proteins with similarities between their sequences have similar structures and also a similar function . An uncharacterised enzyme sequence can often be associated with a putative function by searching against sequences of functionally characterised enzymes, using BLAST  or Hidden Markov Models (HMMs) , and annotating the query sequence with the function of the best hit.
There were several studies that tried to find a critical point for the minimum degree of similarity that is required to make a transfer of function safe when using such sequence-based tools to infer enzymatic function by similarity –. In general, one can assume an accuracy of at least 90% when transferring the function, as defined by the full enzyme commission (EC) number, between sequence pairs that have at least 60% sequence identity ,. For sequence identities below 60% the accuracy decreases quite rapidly, making transfer of function by homology increasingly error prone. At 40% sequence identity the accuracy of function transfer already dropped to 50%. This is due to the fact that at high sequence identity, most pairs are genuine orthologous sequence pairs. However, at a lower sequence identity the probability that paralogs get paired with the query sequence increases, because the nearest ortholog to the query sequence might be missing in the set of annotated sequences and so the nearest paralog is chosen instead. This was also pointed out by Chen and Jeong , who concluded that the crucial task of finding annotated orthologous sequences to infer enzyme function should be solved using detailed information about the residues lining the active site or other residues identified by experiment. They argued that in this way one can reliably separate orthologs from paralogs, thereby making the transfer of functional annotation safe.
Incorporation of structural information into the process of building a predictive model for enzyme specificity was also suggested by Stachelhaus et al.  and Challis et al.  for Nonribosomal Peptide Synthetases (NRPS). They tried to infer a specificity-conferring code of the active site, which could predict what substrate would be used, based on the residues lining the active site and sequence data. Subsequently, Rausch et al. combined these approaches with Support Vector machines (SVMs) for classification and achieved significantly improved prediction performance .
Similarly, the EFICAz method devised by Tian et al.  operates on functionally discriminating residues (FDR) that are detected by analysing homofunctional and heterofunctional multiple sequence alignments (MSAs) of members of an enzyme family using information theoretic measures. However, no structural information is used when determining those FDRs. Prediction of enzyme function is then based on these FDRs and combined with PROSITE pattern matches and familiy specific thresholds for sequence identity.
The recent extension of this method named EFICAz2 further added a SVM-based component built upon the positions of the query sequence aligned to the MSA of the enzyme family  and also a final Decision Tree model to increase the prediction accuracy when making predictions for sequences that are more distant to the training set. An approach similar to the FDR-based method of EFICAz was devised by Hannenhalli and Russell and based predictions of class membership only on those columns of a family MSA that had a positive relative entropy (sub-profile method) .
In this work, we propose a generalisation of the approach by Stachelhaus and Challis to base function predictions on active site residues and make it amenable to any enzyme family that has associated structural information. Thus, classification errors induced by using only the simple descriptor of global sequence identity, which often fails when predicting more distant sequences, could be ameliorated by the incorporation of additional structural information about the active site configuration of the enzymes. Our new approach, called Active Site Classification (ASC), can be used for a family of enzyme sequences where all members perform the same type of reaction but with different substrates. The only requirement is a training set of annotated sequences and one homologous crystal structure. The program will then train a SVM model that can be used to predict the specificity of unclassified sequences. Furthermore, the model can be used to infer which residues and properties are important for each sub-specificity.
In the following sections we will show the very good performance of ASC on two benchmark data sets and that the performance gain is achieved by concentrating on the active site residues. We will also show how the determined ASC model can be used to learn more about the importance of each active site residue and interpret their putative function in the structural context of the active site.
Materials and Methods
Acquisition of sequence data
All sequences used in this study were extracted from the UniProt release 15.8 from September 2009 . SwissProt served us as a source of reliable EC number assignment for the training sequences used in this study. Sequences annotated as fragment, tagged as probable or annotated with multiple EC numbers were removed.
Benchmark data sets
The first benchmark data set was used by Hannenhalli and Russel  to evaluate their sub-profile method and is a set of enzyme classification problems that have clearly defined subtypes, which are not easily discernible by sequence comparison or phylogenetic analysis of the MSAs. This data set contains nucleotidyl cyclases (EC 126.96.36.199, 188.8.131.52), eukaryotic protein kinases (EC 2.7.11.-, 2.7.10.-), trypsin-like serine proteases (EC 184.108.40.206, 220.127.116.11, 18.104.22.168, 22.214.171.124) and lactate/malate dehydrogenases (EC 126.96.36.199, 188.8.131.52). For the kinase family we used the alignments of the Protein Kinase Resource  and all other sequences were retrieved from SwissProt according to their EC number.
The second benchmark was extracted from a data set compiled by Capra and Singh . Their data set contains MSAs of EC annotated sequences that share a specific Pfam domain. Each MSA contains two subtypes of an enzyme family, which share the first three digits but differ in the fourth digit. Furthermore, columns within the MSAs are also annotated whether they are in proximity to a substrate in a representative template structure, the distance cutoff is 5 Å. With this information we could extract the active site residues and train our SVM models to benchmark ASC on this data set. Of the original 284 pairs of subtype MSAs we selected all MSAs with at least 15 sequences in each class to be able to train statistical meaningful models during model validation. After this filtering step we had 48 MSAs for benchmarking ASC.
The nearest neighbour classifier (1NN) is an instance-based classifier. The 1NN classifier makes predictions for a test data point by searching for the nearest data point , according to some distance function, in the training set and reports the label of as the predicted label for the test data point . The distance between two enzymes is defined as the number of mismatching residues in a sequence alignment of the complete enzyme sequences.
Support vector machines
SVMs are supervised classification models that can be used to train a classification model on a given set of training samples where is the class label of the data point . The SVM model consists of a hyperplane that partitions into two half-planes, one for each class. The functional form of the SVM model is given by in its dual formulation. The hyperplane is determined using the maximum-margin concept, thereby making the SVM model per design more resilient to overfitting than many other classification models . The training problem of the SVM model in its dual formulation can be solved efficiently using quadratic programming routines or specialised SVM libraries. We used the popular LIBSVM implementation  to train the SVM models. Another advantage of SVMs is the easy step from linear to non-linear classification models by the use of kernels . Multiclass classification problems are solved by training pairwise classification models and then using a test sequence with all pairwise models that give votes for either class or class . In a final step, all votes are summed and the class receiving most of the votes is the predicted class label.
Kernel methods like SVMs can also operate directly on the objects to classify without prior encoding of these objects into numerical feature vectors. This is made possible by the use of kernel functions that are defined on those objects and represent a similiarity measure. Within ASC we make use of several kernel functions that are defined on the set of signature sequences. The first one is a simple string kernel that uses the number of matching symbols as a similarity measure. The second kernel is the BLOSUM kernel that uses the summed similarity score of the BLOSUM62 matrix between pairs of signature sequences as a kernel. The BLOSUM62 matrix has to be transformed from its log-odds form back into the substitution probability form  to construct a valid Mercer kernel defined on aligned pairs of amino acids, where and are indicator vectors encoding the two aligned amino acids. The kernel on sequences can then be defined by summing the kernel values over all aligned positions of two signature sequences . The third kernel can be defined by using the positive semi-definite chemical similiarity matrix MCLA720101 from the AAindex database instead of the transformed BLOSUM matrix . Our last kernel is defined by encoding each signature amino acid into three descriptors and using the scalar product between the feature vectors in the space of encoded sequences as a kernel function. The descriptors were derived by Wold et al.  and encode information about hydrophobicity, size and electronic properties. For comparison purposes we also made use of the RBF kernel defined on the full MSA as introduced by Arakaki et al. .
Interpretation of SVM models
Importance of specific signature positions for the classifcation models can be either quantified by calculating the primal weight vector of the SVM model and then sort the weights by absolute magnitude to get a ranking of the importance of each variable and its corresponding signature position. This can only be done with kernels having a primal representation, like the Wold kernel and the simple string kernel . For kernels that are defined in the dual space only, one can quantify the influence of a signature position by restricting kernel computation to a single column of the signatures during a full cross-validation (CV) run. The importance of each position is then given by its achieved classification accuracy. In a multiclass setting the accuracy of each pairwise classification model is taken as the score of a signature position for discriminating between the two respective classes.
Training and performance measures
We evaluated the performance of our ASC method in a fashion similar to the evaluation of the EFICAz method by ensuring that the training set sequences are not too similar to the test sequences (according to sequence identity) . The similarity of the test and training set sequences is controlled by the maximum training to testing sequence identity (MTTSI). We used the sequence identity computed over all aligned residues as similarity measure. The models were trained using nested cross-validation (CV). The outer CV-loop leaves one data point out and does model-selection on all remaining data points that do not have a sequence identity higher than a given MTTSI value by using 5-fold cross-validation in the inner loop. The model-selection routine in the inner loop searches for the hyperparameter that yields the best SVM model using only the retained data. Model selection is guided by the accuracy estimated in the inner CV-loop. The selected model is then used to predict the class of the left-out data point. The generalisation capability of the SVM model is estimated by computing for each class the and and averaging these statistics over all classes. The overall accuracy of a model is then given by the harmonic mean of these two measures , called the F-measure.
The ASC method
The ASC method utilises SVMs to build a model that discriminates between two or more classes of enzymatic activity. It starts with training data in the form of sequences from each sub-specificity class and a PDB structure  that serves as a structural template. The location of the enzyme's active site is identified by specifying a certain residue or substrate contained in the template PDB structure. If there is no co-crystal structure with substrate available, but the spatial location of the active site is known, three dimensional coordinates can be supplied alternatively to define the active site.
In a preprocessing step, all sequences with a sequence identity to the template that is too low (20%) are discarded. In the first step the five most diverse sequences from each class are chosen and aligned using 3D-Coffee  to get a guide MSA to which all other sequences are subsequently aligned (Figure 1A). In the second step, all residues that are close enough to the active site of template structure (normally within 6 Å) and receive a high CORE score by 3D-Coffee () are extracted (Figure 1B) . These signature subsequences from each sequence represent residues occupying spatially equivalent regions in the active site (Figure 1C). The active site signatures are then transformed into numeric feature vectors by encoding each amino acid from a signature into the three descriptors , and (Figure 1D). Gaps are encoded by three zeros. The resulting labelled feature vectors are then used to train a SVM to get the final classification model (Figure 1E). Alternatively, kernel functions can be used to work directly on the signature sequences. The weights are sorted according to their absolute magnitudes, yielding a ranking of the importance of the active site residues. Residues whose descriptors receive higher weights are more important for the classification of the enzymes.
(A) In the first step training sequences are aligned using 3DCoffee to get an MSA. (B) In a second step residues lining the active site are extracted from the template structure. (C) The third step maps the extracted residues along the MSA to get a signature of the active site for each sequence. (D) These signatures are then encoded into feature vectors using the three descriptors . Alternatively, kernels may be used. (E) The final ASC model is trained using the generated feature vectors.
Previous studies already showed that functional annotation of a test sequence is easy, if the sequence identity to an annotated sequence is above 60%, since the probability of error when transferring the annotated function of the hit to the query sequence is rather low ,. Thus, we assessed the performance of ASC by trying to predict the function of test sequences that are more distant to the training set. Therefore, we choose a MTTSI that is generally below 60%. However, the exact value where function annotation becomes trivial depends also on the enzyme family under study. Tian et al.  already defined family-dependent sequence identity thresholds (SIT) for each EC class where annotation based on sequence identity becomes very reliable. Thus, we tried to choose the MTTSI threshold below these determined SITs. However, we also had to ensure that the MTTSI is not too low to have enough training sequences to build our ASC models during the nested validation runs. We compared ASC to the 1NN classifier, serving as our baseline. The 1NN classifier can be seen as a more sophisticated BLAST classifier, since the alignment of the query is based on the full MSA and is not a simple pairwise alignment. To rule out that improvements of ASC over the 1NN classifier are not simply due to the use of SVMs, we also give the performance of the SVM classifier based on the whole MSA. This classifier can be seen as an ASC model with infinite cutoff distance. Arakaki et al.  already observed a performance increase when using SVM classifiers based on the MSA within EFICAz2 compared to the FDR-based classifier used in the first version of EFICAz. We applied all defined kernels, including the RBF kernel of EFICAz2, when building the ASC and MSA-based SVM models, and report only the performance of the best model. In this way we can also compare the performance of ASC to the best performing classification component of the EFICAz2 system by including the performance of the SVM based on the full MSA. In both benchmarks the performance is given by the F-measure achieved by the classifiers. Detailed tables containing F-measure, precision, recall and best performing kernels can be found in the supplementary material (Text S1, Text S2).
Overall, the ASC model had three wins against the 1NN classifier and two wins against the SVM classifier based on the full MSA (Table 1). Thus, ASC clearly outperformed the sequence-distance based 1NN classifier, delivering very good performance in all four cases. Moreover, the classification improvement was achieved by using the active-site signatures instead of the full MSA, because the MSA-based model is also outperformed by the ASC model in two cases. The residues found most relevant for the ASC model were those that were already identified by experiment and also detected by the sub-profile method. We will describe the ASC results on the four enzyme families in more detail now.
Protein kinase family
We used the crystal structure of the ternary complex of a protein kinase (PDB-Id: 1ATP, ) to determine the active site residues that are within 6 Å of the substrate ATP. The kinase family was modelled well with a maximal F-measure of 100% by all three methods. The 1NN classifier already achieved optimal performance on this family (Table 1). However, the ASC model also achieved optimal performance using only a fraction of the residues. The three most important residues for the ASC model were positions Thr201 (accuracy = 99.6%), Lys168 (accuracy = 99.2%) and Glu170 (accuracy = 97.7%). The importance of each signature position is given by the accuracy of the ASC model trained on solely this position. These residues were also detected by the sub-profile method devised by Hannenhalli and are known as putative modulating positions ,.
Nucleotidyl cyclase family
Clear performance improvements achieved by the ASC method over the two baseline classifiers can be seen for the cyclase family. The ASC model was built using the crystal structure of an adenyly cyclase (PDB-Id: 1AB8, ) and a distance cutoff of 5 Å. The 1NN classifier and the classifier based on the full MSA failed to achieve satisfying F-measures, whereas the ASC classifier achieved a very high F-measure of 97% (Table 1). The four most important residues, according to their influence on the ASC classification model, were Asp1018 (accuracy = 98.5%), Ile1019 (accuracy = 97.7%), Trp1020 (accuracy = 93.9%) and Lys938 (accuracy = 87.4%). These residues are known to have influence on the substrate specificity of nucleotidyl cyclases as shown by Tucker et al. . These residues were also detected by the sub-profile method .
The ASC model for the trypsin family was built using a crystal structure of a serine protease (PDB-Id: 1AQ7, ) and a distance cutoff of 5 Å. The ASC classifier achieved a satisfying F-measure of 90%, whereas the 1NN and MSA-based classifier achieved a F-measure of roughly 80% only (Table 1). The three top-ranking residues that discriminate between chymotrypsin and trypsin were positions Asp189 (accuracy = 98.2%), Gly226 (accuracy = 92.4%), Gly219 (accuracy = 90%) and Ala221 (accuracy = 84.4%). Asp189, Gly226 and Ala221 were also detected by the sub-profile method and two of them, namely Asp189 and Ala221, are long known modulators of protease specificity .
Malate/lactate dehydrogenase family
The ASC model for the dehydrogenase family was built using the crystal structure of a malate dehydrogenase from E. coli (PDB-Id: 1EMD, ) and a distance cutoff of 5 Å. Generally, this family was modelled well by all three classifiers with F-measures above 90% and there were only minor differences among the models. The residues with the greatest influence on the ASC model were Met227 (accuracy = 98.2%) and Arg81 (accuracy = 97.4%). Especially, the Arg81 residue is a proven specificity modulating position because mutating this residue to glutamine is known to confer lactate specificity .
To get a better impression of the performance of our new method, we applied the ASC, 1NN and full MSA classifiers to a larger benchmark data set of 48 enzyme pairs extracted from the data set compiled by Capra and Singh . Table 2 gives the performance of the classifiers as quantified by the F-measure. The first striking fact is that the 1NN classifier was quite competitive even in MTTSI ranges below 70%. There are 22 enzyme pairs where ASC and the 1NN classifier performed equally well. However, there were also 21 cases where the ASC model outperformed the 1NN classifier along with only 5 losses. The SVM models based on the full MSA were also quite competitive having 16 cases of equal performance with ASC and 8 cases where ASC performed worse. However, there are 24 cases where ASC outperformed the MSA-based classifier. The averaged F-measures of the MSA-based classifier, 1NN and ASC were 90%, 92% and 95%, respectively. Thus, the ASC method based on active site signatures is a clear step to more accurate function prediction especially for sequences with a greater distance to the training set. This is exemplified by the 11 cases where the ASC models could perfectly discriminate between the classes with a F-measure of 100% whereas the 1NN classifier clearly failed to achieve the same performance on these cases. Most often the simple string kernel sufficed to build the best ASC or MSA-based model, with the other kernels showing similar performance. However, for some cases only one kernel excelled over the others. Some cases could be better modelled by the BLOSUM kernel, whereas other cases were better modelled by the Wold kernel . Thus, it is advisable to try all kernel functions when building ASC models and keep the best performing one.
To exemplify the interpretability of the ASC models we present a full analysis of the family of decarboxylating dehydrogenases. This family features enzymes that catalyse the dehydration and decarboxylation of several malate derivatives, namely isocitrate, 3-isopropylmalate and tartrate . The substrates have a malate in common but differ in their -substituents. It was shown that the 3-isopropylmalate dehydrogenase (IPMDH) does not utilise isocitrate as substrate and also that the isocitrate dehydrogenase (ICDH) does not utilise isopropylmalate as substrate . Furthermore, IPMDH shows a relaxed specificity for alkylmalates, and accepts a wide range of substrates alkylated at the -site .
We could extract 61, 286 and 8 sequences from SwissProt that were annotated as isocitrate (EC 184.108.40.206), 3-isopropymalate (EC 220.127.116.11) or tartrate dehydrogenases (EC 18.104.22.168), respectively. EC class 22.214.171.124 contains enzymes that are also members of this family and utilise D-malate. But they were not included as a separate class in this set, since these enzymes seem to be equivalent to the enzymes from EC class 126.96.36.199. The tartrate enzymes readily utilise D-malate as substrate, according to the and values given by the BRENDA database  for the enzymes of class 188.8.131.52. Hence, we put the eight tartrate- and eight D-malate-specific sequences into one class. For the ASC analysis of this set of sequences, we used the crystal structure of a 3-isopropymalate dehydrogenase from Thiobacillus ferrooxidans (PDB-Id: 1A05, ) as the structural template and extracted all residues within 6 Å of the cognate substrate 3-isopropylmalate. Because it is known that IPMDH forms homo-dimeric complexes, we chose this crystal structure of the homo-dimeric form of the enzyme to enable ASC to select residues from all chains of the enzyme that are in contact with the substrate . In the initial filtering step, 333 sequences could be aligned with sufficient sequence identity to the template sequence and a reliable guide MSA with an overall CORE score of 69 could be built. From this MSA, 17 residues lining the active site were extracted (Table 3). The resulting ASC model, using the string kernel , achieved a F-measure of 99% (precision = 99%, recall = 100%) when evaluated at an MTTSI of 60%.
Model interpretation: Isocitrate vs. isopropylmalate specificity
The two top-ranked features of the model discriminating isocitrate-specific enzymes from isopropylmalate-specific enzymes were residues Leu91 (accuracy = 98.2%) and Val193 (accuracy = 97.2%) in the template structure 1A05. The enzymes acting on isocitrate, with its charged -site that accepts hydrogen bonds, prefer asparagine residues at position Leu91. Whereas enzymes acting on isopropylmalate prefer leucine. When inspecting the superimposed structures of the two enzymes shown in Figure 2, the preference of replacing Leu91 with asparagine in the isocitrate dehydrogenase can be explained by the hydrogen bond formed between the carboxylate group at the -site of isocitrate and the terminal amino group of asparagine. The isopropylmalate enzymes replace the hydrogen bonding asparagine with the hydrophobic Leu91, which can interact optimally with the aliphatic -site of isopropylmalate.
The first chain of the homo-dimeric enzyme is represented by its solvent-excluded surface. The second chain is depicted in a backbone representation. The two substrates isocitrate (purple) and isopropylmalate (green) lie in the interface of the two chains. IPMDH sidechains are coloured green and sidechains from ICDH (PDB-Id: 1AI2, ) are coloured purple. This figure was created using BALLView .
At position Val193, the ICDH enzymes prefer an isoleucine whereas IPMDH enzymes prefer valine. One possible explanation for these preferences might be that the isocitrate -site is more flexible due to the additional carbon atom and is oriented to the asparagine residue at position Leu91. The shorter isopropyl lacks this flexibility and is therefore located near position Val193, where IPMDH enzymes prefer the smaller valine. The larger isoleucine placed by ICDH enzymes might function as a further switch to filter out substrates featuring rigid isopropyl substituents at the -site. The -site of the cognate substrate isocitrate of ICDH would orient itself to the asparagine, whereas the isopropyl group of isopropylmalate molecules would clash with the large isoleucine residue that is preferred at position Val193 by the ICDH enzymes.
Model interpretation: Tartrate vs. isopropylmalate specificity
The two most important residues in the model that discriminates between the substrates tartrate and isopropylmalate were Glu88 (accuracy = 100%) and Val193 (accuracy = 97%). Enzymes specific for tartrate or malate prefer the large amino acid tryptophan at the position corresponding to Glu88, whereas the enzymes specific for substrates with larger substituents at the -site prefer amino acids like glutamate or arginine. Tryptophan may act as a filter to prevent substrates with larger -substituents to bind efficiently to the active site. The substitution pattern at site Val193 seems to be coupled to the placement of the tryptophan. Enzymes having a tryptophan at position Glu88 prefer a glycine or alanine at the position corresponding to Val193, probably to prevent steric clashes with the tryptophan now located nearby.
Availability of the predictive web server
The whole workflow for combining sequence and structural data, building the classification model and interpreting the model parameters in the context of the enzyme's structure is made available to users by the means of a web service. ASC itself is implemented in C++ and makes use of the BALL library to process protein structures . The web server also offers a specialised report page for model interpretation, where the sequence signatures are linked to the structure of the active site in an interactive fashion using a Jmol applet to visualise the structure. A typical result page can be found in the supplementary material (Text S3). When labelled sequence data is scarce a special extract-only mode of ASC can give a first overview of the active site conservation by only extracting the active site signatures. The ASC web service is available at http://asc.informatik.uni-tuebingen.de/.
We have presented our new method ASC for enzyme sequence classification, which combines sequence data and structural data. By using structural information, we can focus the classification task on features that are most likely relevant for modulating substrate specificity, namely the residues lining the active site. The two benchmarks showed that classification accuracy can be clearly improved by concentrating on the extracted active site signatures and that this improvement is not simply due to the use of SVMs, because the ASC models also outperformed the SVM models trained on the full MSA in many cases. Futhermore, ASC also provides a ranking of the active site residues based on their influence on the decision function. The application of ASC on the benchmark data set by Hannenhalli showed that the set of residues found most relevant for the ASC classification model very often coincided with those residues found relevant by experimental analysis or detected by other computational methods like the sub-profile method. Unlike sequence based classification or FDR-determining methods, ASC had of course the advantage of using structural information and could pre-filter the list of putative specificity modulating residues. Therefore, a direct comparison with those methods would be unfair. However, we think that using this additional source of information is essential for building more accurate function prediction models.
In general, one has to keep in mind that ASC can fail in cases where residues modulate specificity, that are not located in the vicinity of the active site, since the premise of ASC is to use only active site residues. This is not necessarily a limitation of the method though. The absence of any active site signature differences between enzymes with differing class labels can serve as an indication to search for allosteric influences on substrate specificity or to check if the annotation really is correct and both enzymes in reality may be utilising the same substrates or show some cross-specificity.
Applications for our ASC method lie especially in the use of the trained models as predictors of enzymatic function within an enzyme family for sequences that are more remote to the training set and could be predicted more reliably using the extracted active site signatures. But also detection of new subtypes is possible by searching for novel active site signatures in the pool of all extracted signatues of an enzyme family with subsequent experimental validation. Regarding the applicability of ASC, even remote structural homologs might suffice to extract active site residues for novelty detection and classification purposes. Thus, ASC models might be built for many enzyme families to further improve annotation accuracy within current genome annotation pipelines.
Moreover, one can try to verify experimentally the findings gathered in the model interpretation step by mutating residues found relevant to discriminate between two specificities to design mutated enzymes with reduced or even switched substrate specificity. This was exemplified by the dehydrogenase example where we could pinpoint the influence of the residues found relevant on a detailed structural level by inspecting the superimposed active sites of the two enzymes, thereby making predictions of the model more transparent. Finally, our ASC web service allows users to interpret the learned ASC model in the context of the template structure and can yield insight into the mechanisms of substrate specificity by focusing on residues in proximity to the active site and analysing the allowed sequence variation in the corresponding columns of the family MSA.
ASC performance on Hannenhalli benchmark
(0.08 MB PDF)
ASC performance on Capra benchmark
(0.09 MB PDF)
Conceived and designed the experiments: MR CR OK. Performed the experiments: MR. Analyzed the data: MR OK. Contributed reagents/materials/analysis tools: CR. Wrote the paper: MR CR OK.
- 1. Valencia A (2005) Automatic annotation of protein function. Curr Opin Struct Biol 15: 267–274.A. Valencia2005Automatic annotation of protein function.Curr Opin Struct Biol15267274
- 2. Chothia C, Lesk AM (1986) The relation between the divergence of sequence and structure in proteins. EMBO J 5: 823–826.C. ChothiaAM Lesk1986The relation between the divergence of sequence and structure in proteins.EMBO J5823826
- 3. Altschul SF, Madden TL, Schaeffer AA, Zhang J, Zhang Z, et al. (1997) Gapped BLAST and PSI-BLAST: a new generation of protein database search programs. Nucleic Acids Res 25: 3389–3402.SF AltschulTL MaddenAA SchaefferJ. ZhangZ. Zhang1997Gapped BLAST and PSI-BLAST: a new generation of protein database search programs.Nucleic Acids Res2533893402
- 4. Durbin R, Eddy S, Krogh A, Mitchison G (1998) Biological sequence analysis: probabilistic models of proteins and nucleic acids. Cambridge University Press. R. DurbinS. EddyA. KroghG. Mitchison1998Biological sequence analysis: probabilistic models of proteins and nucleic acidsCambridge University Press
- 5. Finn RD, Mistry J, Schuster-Boeckler B, Griffiths-Jones S, Hollich V, et al. (2006) Pfam: clans, web tools and services. Nucleic Acids Res 34: D247–D251.RD FinnJ. MistryB. Schuster-BoecklerS. Griffiths-JonesV. Hollich2006Pfam: clans, web tools and services.Nucleic Acids Res34D247D251
- 6. Rost B (2002) Enzyme function less conserved than anticipated. J Mol Biol 318: 595–608.B. Rost2002Enzyme function less conserved than anticipated.J Mol Biol318595608
- 7. Devos D, Valencia A (2000) Practical limits of function prediction. Proteins 41: 98–107.D. DevosA. Valencia2000Practical limits of function prediction.Proteins4198107
- 8. Tian W, Skolnick J (2003) How well is enzyme function conserved as a function of pairwise sequence identity? J Mol Biol 333: 863–882.W. TianJ. Skolnick2003How well is enzyme function conserved as a function of pairwise sequence identity?J Mol Biol333863882
- 9. Chen R, Jeong SS (2000) Functional prediction: identification of protein orthologs and paralogs. Protein Sci 9: 2344–2353.R. ChenSS Jeong2000Functional prediction: identification of protein orthologs and paralogs.Protein Sci923442353
- 10. Stachelhaus T, Mootz HD, Marahiel MA (1999) The specificity-conferring code of adenylation domains in nonribosomal peptide synthetases. Chem Biol 6: 493–505.T. StachelhausHD MootzMA Marahiel1999The specificity-conferring code of adenylation domains in nonribosomal peptide synthetases.Chem Biol6493505
- 11. Challis GL, Ravel J, Townsend CA (2000) Predictive, structure-based model of amino acid recognition by nonribosomal peptide synthetase adenylation domains. Chem Biol 7: 211–224.GL ChallisJ. RavelCA Townsend2000Predictive, structure-based model of amino acid recognition by nonribosomal peptide synthetase adenylation domains.Chem Biol7211224
- 12. Rausch C, Weber T, Kohlbacher O, Wohlleben W, Huson DH (2005) Specificity prediction of adenylation domains in nonribosomal peptide synthetases (NRPS) using transductive support vector machines (TSVMs). Nucleic Acids Res 33: 5799–5808.C. RauschT. WeberO. KohlbacherW. WohllebenDH Huson2005Specificity prediction of adenylation domains in nonribosomal peptide synthetases (NRPS) using transductive support vector machines (TSVMs).Nucleic Acids Res3357995808
- 13. Tian W, Arakaki AK, Skolnick J (2004) EFICAz: a comprehensive approach for accurate genome-scale enzyme function inference. Nucleic Acids Res 32: 6226–6239.W. TianAK ArakakiJ. Skolnick2004EFICAz: a comprehensive approach for accurate genome-scale enzyme function inference.Nucleic Acids Res3262266239
- 14. Arakaki AK, Huang Y, Skolnick J (2009) EFICAz2: enzyme function inference by a combined approach enhanced by machine learning. BMC Bioinformatics 10: 107.AK ArakakiY. HuangJ. Skolnick2009EFICAz2: enzyme function inference by a combined approach enhanced by machine learning.BMC Bioinformatics10107
- 15. Hannenhalli SS, Russell RB (2000) Analysis and prediction of functional sub-types from protein sequence alignments. J Mol Biol 303: 61–76.SS HannenhalliRB Russell2000Analysis and prediction of functional sub-types from protein sequence alignments.J Mol Biol3036176
- 16. Bairoch A, Apweiler R, Wu CH, Barker WC, Boeckmann B, et al. (2005) The Universal Protein Resource (UniProt). Nucleic Acids Res 33: D154–D159.A. BairochR. ApweilerCH WuWC BarkerB. Boeckmann2005The Universal Protein Resource (UniProt).Nucleic Acids Res33D154D159
- 17. Smith CM, Shindyalov IN, Veretnik S, Gribskov M, Taylor SS, et al. (1997) The protein kinase resource. Trends Biochem Sci 22: 444–446.CM SmithIN ShindyalovS. VeretnikM. GribskovSS Taylor1997The protein kinase resource.Trends Biochem Sci22444446
- 18. Capra JA, Singh M (2008) Characterization and prediction of residues determining protein functional specificity. Bioinformatics 24: 1473–1480.JA CapraM. Singh2008Characterization and prediction of residues determining protein functional specificity.Bioinformatics2414731480
- 19. Vapnik V (1998) The Nature of Statistical Learning Theory. Wiley-Interscience. V. Vapnik1998The Nature of Statistical Learning TheoryWiley-Interscience
- 20. Chang CC, Lin CJ (2001) LIBSVM: a library for support vector machines. CC ChangCJ Lin2001LIBSVM: a library for support vector machines.Software available at http://www.csie.ntu.edu.tw/~cjlin/libsvm. Software available at http://www.csie.ntu.edu.tw/~cjlin/libsvm.
- 21. Schölkopf B, Tsuda K, Vert J (2004) Kernel Methods in Computational Biology. MA MIT Press. B. SchölkopfK. TsudaJ. Vert2004Kernel Methods in Computational BiologyMA MIT Press
- 22. Sulimova V, Mottl V, Mirkin B, Muchnik IB, Kulikowski CA (2009) A Class of Evolution-Based Kernels for Protein Homology Analysis: A Generalization of the PAM Model. In: Mandoiu II, Narasimhan G, Zhang Y, editors. Bioinformatics Research and Applications. Springer, volume 5542 of Lecture Notes in Computer Science. pp. 284–296.V. SulimovaV. MottlB. MirkinIB MuchnikCA Kulikowski2009A Class of Evolution-Based Kernels for Protein Homology Analysis: A Generalization of the PAM Model.II MandoiuG. NarasimhanY. ZhangBioinformatics Research and Applications. Springer, volume 5542 of Lecture Notes in Computer Science284296
- 23. Cristianini N, Shawe-Taylor J (2000) An Introduction to Support Vector Machines and Other Kernel-based Learning Methods. Cambridge University Press. N. CristianiniJ. Shawe-Taylor2000An Introduction to Support Vector Machines and Other Kernel-based Learning MethodsCambridge University Press
- 24. Kawashima S, Kanehisa M (2000) AAindex: amino acid index database. Nucleic Acids Res 28: 374.S. KawashimaM. Kanehisa2000AAindex: amino acid index database.Nucleic Acids Res28374
- 25. Wold S, Eriksson L, Hellberg S, Jonsson J, Sjoestroem M, et al. (1987) Principal property values for six non-natural amino acids and their application to a structure activity relationship for oxytocin peptide analogues. Can J Chem 65: 1814–1820.S. WoldL. ErikssonS. HellbergJ. JonssonM. Sjoestroem1987Principal property values for six non-natural amino acids and their application to a structure activity relationship for oxytocin peptide analogues.Can J Chem6518141820
- 26. Berman HM, Westbrook J, Feng Z, Gilliland G, Bhat TN, et al. (2000) The Protein Data Bank. Nucleic Acids Res 28: 235–242.HM BermanJ. WestbrookZ. FengG. GillilandTN Bhat2000The Protein Data Bank.Nucleic Acids Res28235242
- 27. O'Sullivan O, Suhre K, Abergel C, Higgins DG, Notredame C (2004) 3DCoffee: combining protein sequences and structures within multiple sequence alignments. J Mol Biol 340: 385–395.O. O'SullivanK. SuhreC. AbergelDG HigginsC. Notredame20043DCoffee: combining protein sequences and structures within multiple sequence alignments.J Mol Biol340385395
- 28. Notredame C, Abergel C (2003) Bioinformatics and Genomes: Current Perspectives - Using Multiple Alignment Methods to Assess the Quality of Genomic Data Analysis. Horizon Scientific Press. pp. 30–50.C. NotredameC. Abergel2003Bioinformatics and Genomes: Current Perspectives - Using Multiple Alignment Methods to Assess the Quality of Genomic Data AnalysisHorizon Scientific Press3050
- 29. Zheng J, Trafny EA, Knighton DR, Xuong NH, Taylor SS, et al. (1993) 2.2 A refined crystal structure of the catalytic subunit of cAMP-dependent protein kinase complexed with MnATP and a peptide inhibitor. Acta Crystallogr D Biol Crystallogr 49: 362–365.J. ZhengEA TrafnyDR KnightonNH XuongSS Taylor19932.2 A refined crystal structure of the catalytic subunit of cAMP-dependent protein kinase complexed with MnATP and a peptide inhibitor.Acta Crystallogr D Biol Crystallogr49362365
- 30. Hanks SK, Hunter T (1995) Protein kinases 6. The eukaryotic protein kinase superfamily: kinase (catalytic) domain structure and classification. FASEB J 9: 576–596.SK HanksT. Hunter1995Protein kinases 6. The eukaryotic protein kinase superfamily: kinase (catalytic) domain structure and classification.FASEB J9576596
- 31. Taylor SS, Radzio-Andzelm E, Hunter T (1995) How do protein kinases discriminate between serine/threonine and tyrosine? Structural insights from the insulin receptor protein-tyrosine kinase. FASEB J 9: 1255–1266.SS TaylorE. Radzio-AndzelmT. Hunter1995How do protein kinases discriminate between serine/threonine and tyrosine? Structural insights from the insulin receptor protein-tyrosine kinase.FASEB J912551266
- 32. Zhang G, Liu Y, Ruoho AE, Hurley JH (1997) Structure of the adenylyl cyclase catalytic core. Nature 386: 247–253.G. ZhangY. LiuAE RuohoJH Hurley1997Structure of the adenylyl cyclase catalytic core.Nature386247253
- 33. Tucker CL, Hurley JH, Miller TR, Hurley JB (1998) Two amino acid substitutions convert a guanylyl cyclase, RetGC-1, into an adenylyl cyclase. Proc Natl Acad Sci U S A 95: 5993–5997.CL TuckerJH HurleyTR MillerJB Hurley1998Two amino acid substitutions convert a guanylyl cyclase, RetGC-1, into an adenylyl cyclase.Proc Natl Acad Sci U S A9559935997
- 34. Sandler B, Murakami M, Clardy J (1998) Atomic Structure of the Trypsin-Aeruginosin 98-B Complex. JAmChemSoc 120: 595–596.B. SandlerM. MurakamiJ. Clardy1998Atomic Structure of the Trypsin-Aeruginosin 98-B Complex.JAmChemSoc120595596
- 35. Hall MD, Banaszak LJ (1993) Crystal structure of a ternary complex of Escherichia coli malate dehydrogenase citrate and NAD at 1.9 A resolution. J Mol Biol 232: 213–222.MD HallLJ Banaszak1993Crystal structure of a ternary complex of Escherichia coli malate dehydrogenase citrate and NAD at 1.9 A resolution.J Mol Biol232213222
- 36. Wilks HM, Hart KW, Feeney R, Dunn CR, Muirhead H, et al. (1988) A specific, highly active malate dehydrogenase by redesign of a lactate dehydrogenase framework. Science 242: 1541–1544.HM WilksKW HartR. FeeneyCR DunnH. Muirhead1988A specific, highly active malate dehydrogenase by redesign of a lactate dehydrogenase framework.Science24215411544
- 37. Imada K, Inagaki K, Matsunami H, Kawaguchi H, Tanaka H, et al. (1998) Structure of 3-isopropylmalate dehydrogenase in complex with 3-isopropylmalate at 2.0 A resolution: the role of Glu88 in the unique substrate-recognition mechanism. Structure 6: 971–982.K. ImadaK. InagakiH. MatsunamiH. KawaguchiH. Tanaka1998Structure of 3-isopropylmalate dehydrogenase in complex with 3-isopropylmalate at 2.0 A resolution: the role of Glu88 in the unique substrate-recognition mechanism.Structure6971982
- 38. Barthelmes J, Ebeling C, Chang A, Schomburg I, Schomburg D (2007) BRENDA, AMENDA and FRENDA: the enzyme information system in 2007. Nucleic Acids Res 35: D511–D514.J. BarthelmesC. EbelingA. ChangI. SchomburgD. Schomburg2007BRENDA, AMENDA and FRENDA: the enzyme information system in 2007.Nucleic Acids Res35D511D514
- 39. Kohlbacher O, Lenhof HP (2000) BALL–rapid software prototyping in computational molecular biology. Biochemicals Algorithms Library. Bioinformatics 16: 815–824.O. KohlbacherHP Lenhof2000BALL–rapid software prototyping in computational molecular biology. Biochemicals Algorithms Library.Bioinformatics16815824
- 40. Mesecar AD, Stoddard BL, Koshland DE (1997) Orbital steering in the catalytic power of enzymes: small structural changes with large catalytic consequences. Science 277: 202–206.AD MesecarBL StoddardDE Koshland1997Orbital steering in the catalytic power of enzymes: small structural changes with large catalytic consequences.Science277202206
- 41. Moll A, Hildebrandt A, Lenhof HP, Kohlbacher O (2006) BALLView: a tool for research and education in molecular modeling. Bioinformatics 22: 365–366.A. MollA. HildebrandtHP LenhofO. Kohlbacher2006BALLView: a tool for research and education in molecular modeling.Bioinformatics22365366