Skip to main content

Enzyme mechanism prediction: a template matching problem on InterPro signature subspaces



We recently reported that one may be able to predict with high accuracy the chemical mechanism of an enzyme by employing a simple pattern recognition approach: a k Nearest Neighbour rule with k = 1 (k1NN) and 321 InterPro sequence signatures as enzyme features. The nearest-neighbour rule is known to be highly sensitive to errors in the training data, in particular when the available training dataset is small. This was the case in our previous study, in which our dataset comprised 248 enzymes annotated against 71 enzymatic mechanism labels from the MACiE database. In the current study, we have carefully re-analysed our dataset and prediction results to “explain” why a high variance k1NN rule exhibited such remarkable classification performance.


We find that enzymes with different chemical mechanism labels in this dataset reside in barely overlapping subspaces in the feature space defined by the 321 features selected. These features contain the appropriate information needed to accurately classify the enzymatic mechanisms, rendering our classification problem a basic look-up exercise. This observation dovetails with the low misclassification rate we reported.


Our results provide explanations for the “anomaly”—a basic nearest-neighbour algorithm exhibiting remarkable prediction performance for enzymatic mechanism despite the fact that the feature space was large and sparse. Our results also dovetail well with another finding we reported, namely that InterPro signatures are critical for accurate prediction of enzyme mechanism. We also suggest simple rules that might enable one to inductively predict whether a novel enzyme possesses any of our 71 predefined mechanisms.


Identification of unknown protein functions is essential for understanding biological processes and beyond [1, 2]. Enzymes are proteins whose function is to catalyse chemical reactions in a living cell. Ascertaining enzymatic mechanisms can have important applications for pharmaceutical and industrial processes in which catalysts are involved [1]. For example, identifying the catalytic mechanism(s) of an enzyme could lead to designing new biocatalysts that give significant cost savings over non-biological alternatives in sectors such as laundry, deodorants, foods and agriculture [1].

Unlike predicting enzymatic functions at the level of the chemical reaction performed [24], the problem of predicting by which molecular mechanism a particular enzyme operates has not been well researched [1]. Two of us, De Ferrari and Mitchell, have recently looked into this question. In that work, we utilised a pattern recognition approach to predict chemical mechanisms from enzyme sequences [1]—to the best of our knowledge, that study was the first attempt to predict enzymatic mechanism in this way.

One notable aspect of that work was the excellent prediction success rate of over 96 % for 248 test enzymes—albeit in a leave-one-out setting—even though the training dataset was small and the simple k Nearest Neighbour rule with k = 1 (k1NN) [5, 6] was the algorithm employed for pattern classification. The k1NN rule is well known to be highly sensitive to errors in the training set [7], in particular when the training dataset is small [79]. For example, the number of training examples required for a k1NN rule to achieve high classification or prediction accuracy grows exponentially with the number of irrelevant features (noise) [7, 9].

In the light of the “anomaly” described above, we have re-analysed that mechanism dataset and our previous classification results—mainly to understand and explain, if possible, the high prediction success rate achieved.

In the following section, we briefly describe our previous work. The “Results” section presents our new findings, and the final section gives our concluding remarks.

To our knowledge, our study was the first attempt at bulk prediction of enzymatic mechanism from protein sequence [1]. The predictive model was an empirical and observational model [10] based on the concept of pattern classification.

Formally, a pattern classification problem deals with the optimal assignment of an object to one of J predefined classes, categories or labels, \(\Omega = \left\{ {\omega_{1} ,\omega_{2} , \ldots ,\omega_{J} } \right\}\), whereby it is assumed that the object is adequately characterized by L features, x i with i = 1, 2, …, L. Typically, the object is represented by an L-dimensional vector x, whose elements (x 1, x 2  …, x i ) are discriminatory features that ideally can identify the object with a low misclassification error rate. In this regard, the classification task is equivalent to establishing a mapping

$$f:\chi \to \Omega$$

from the feature space χ into the class space Ω, such that \(x \in \chi\) is assigned to its appropriate class label \(\omega_{j} \in \Omega\), where j = 1, 2, …, J. Each point in the class space has a corresponding region(s) or subspace(s) in the feature space defined by the L features.

In our previous study, the feature x i denotes absence (0) or presence (1) of an InterPro signature for an enzyme sequence, i.e., \(x_{i} = \{ 0,1\}\). In other words, χ was a binary feature space \(\chi = \left\{ {0,1} \right\}^{L}\). The class space Ω comprised J discrete points each representing one of the enzyme mechanism labels ω j , extracted from Version 3.0 of the MACiE (Mechanism, Annotation and Classification in Enzymes) database [1113].

The mapping algorithm was the simple k1NN classifier. This algorithm can be basically viewed as a dictionary search [14]. That is to say, all the data points allotted for training are stored in a memory (a dictionary in χ), and a test data point is classified to the class label or labels \(\omega_{j}\) of the closest point in the dictionary, i.e., in χ. The specific implementation used in our calculations was Mulan’s BRKNN algorithm [5, 15].

Generally speaking, the integration process carried out by InterPro’s curators removes many of the redundant signature matches that might otherwise occur. This results in a relatively small number of InterPro signatures being present for the typical sequence in this dataset. Thus, the squared nearest neighbour distance often takes small integer values, and it is common to find plural nearest neighbours an equal distance away. In this case, the label (or label set) most common amongst the ring of nearest neighbours is assigned.

The mechanism dataset consists of 248 enzymes annotated against 71 MACiE labels, where each enzyme is represented by 321 InterPro signatures—i.e., L and J are 321 and 71, respectively. We employed a leave-one-out validation scheme: 247 of the enzymes whose mechanisms were known were utilised as a “dictionary” and the mechanism(s) of the one remaining enzyme was predicted, this processes being repeated 248 times. The simple pattern recognition approach yielded an excellent prediction success rate of over 96 % for the 248 test enzymes.


In the present work, we are not directly concerned with the question of defining enzyme mechanisms; instead, we just use the mechanism dataset. We focus on finding the reasons why the k1NN rule gave us such good classification results for this small dataset, its size being limited by the considerable experimental effort required to characterise enzyme mechanisms.

While directly visualising the 321 dimensional feature space \(\chi = \left\{ {0,1} \right\}^{L = 321}\) would be impossible, we were able to go through the dataset manually. The mechanism dataset was represented by a 248-by-323 matrix whose rows were the 248 enzymes, and the first and last columns contained the enzyme names (the enzyme sequence’s UniProt accession number) and their associated mechanism class labels, respectively. The remaining 321 columns denoted the 321 InterPro signature features.

We systematically swapped the 321 columns containing the InterPro signature features while keeping the rows and the first and last columns of the matrix fixed.


After a number of iterations, we ended up with a block diagonal version of the original data matrix, see Fig. 1. The figure, a heat map of the data matrix, seems to explain why k1NN yielded the excellent classification results [1]. In the figure, the abscissa denotes InterPro signatures, whereas the vertical axis represents the enzyme sequence’s UniProt accession number and the corresponding MACiE enzymatic mechanism labels of the form M0123. The colour yellow signifies that feature x i (InterPro signature) is present for the enzyme, while the red colour indicates that feature x i is absent for the enzyme.

Fig. 1

Heatmap of our data matrix. The horizontal axis denotes InterPro signatures, whereas the vertical axis represents the enzyme sequence’s UniProt accession number and the corresponding MACiE enzymatic mechanism labels of the form M0123. The yellow colour signifies that feature x i (InterPro signature) is present for the enzyme, while the red colour indicates that x i is absent for this enzyme. Enzymes that possess the same MACiE mechanism label reside in a subspace of the feature space χ, which barely overlaps with other subspaces associated with other mechanisms. The inset depicts the heatmap for the dataset matrix corresponding to the InterPro signatures and names of enzymes with the MACiE enzymatic mechanism label M0218

According to Fig. 1, the 321 InterPro signatures are highly discriminating features. Enzymes that possess the same enzymatic mechanism \(\omega_{j}\) reside in a subspace (region) in \(\chi = \left\{ {0,1} \right\}^{L = 321}\) which barely overlaps with neighbouring regions. The inset in Fig. 1 depicts the heatmap of the portion of the dataset that corresponds to the enzymes (and their InterPro signature features) that have MACiE enzymatic mechanism label M0218, i.e. \(\omega_{j} = M0218\). Note that a subspace for a given mechanism can be a composite (union) of non-overlapping “sub-subspaces”. The sharing of the M0218 label by two separate non-homologous sequences illustrates the presence of two distinct proteins, firstly pancreatic lipase and secondly colipase, in the reactive complex.

Out of our 71 regions, only the two regions representing enzymes with MACiE mechanisms \(\omega_{j = 30} = M0348\) and \(\omega_{j = 35} = M0269\) completely overlap. The same four InterPro signature features represent the enzymes that show mechanisms M0348 and M0269, highlighted in red in Table 1.

Table 1 Enzymatic MACiE mechanism labels w j and the number of enzymes reported to possess this mechanism w j

We suggest that our block data-matrix could be employed as an enzymatic mechanism prediction tool—a template against which to match novel enzymes to ascertain their potential enzymatic mechanisms in regard to the 71 mechanisms in the mechanism dataset.

In this work, our mechanism dataset was re-analysed to ascertain as to why a simple but high variance classifier yielded such excellent classification results.

We hope that we have provided a reasonable explanation; the mechanism dataset matrix is block diagonal in the feature and class spaces. In other words, the features (almost) uniquely codify the chemical mechanism of a given enzyme.

Based on these observations, we have also made the suggestion that one might be able to utilise the dataset matrix as an enzymatic mechanism prediction tool.



mechanism, annotation and classification in enzymes


k(=1) Nearest Neighbour


  1. 1.

    De Ferrari L, Mitchell JBO. From sequence to enzyme mechanism using multi-label machine learning. BMC Bioinform. 2014;15:150.

    Article  Google Scholar 

  2. 2.

    Cai CZ, Han LY, Ji ZL, Chen YZ. Enzyme family classification by support vector machines. Proteins Struct Funct Bioinform. 2004;55:66–76.

    Article  CAS  Google Scholar 

  3. 3.

    Cai CZ, Han LY, Ji ZL, Chen YZ. SVM-Prot: web-based support vector machine software for functional classification of a protein. Nucleic Acids Res. 2003;31:3692–7.

    PubMed Central  Article  CAS  PubMed  Google Scholar 

  4. 4.

    De Ferrari L, Aitken S, van Hemert J, Goryanin I. EnzML:multi-label prediction of enzyme classes using InterPro signatures. BMC Bioinform. 2012;13:61.

    Article  Google Scholar 

  5. 5.

    Spyromitros E, Tsoumakas G, Vlahavas I. An empirical study of lazy multilabel classification algorithms. Lect Notes Comput Sci. 2008;5138:401–6.

    Article  Google Scholar 

  6. 6.

    Duda RO, Hart PE. Pattern classification and scene analysis. Chapter 4. New York: Wiley; 1973. p. 85–126.

  7. 7.

    Wittek P. Quantum machine learning: what quantum computing means to data mining. Chapter 2. London: Academic press; 2014. p. 11–24.

  8. 8.

    Theodoridis S, Koutroumbas K. Pattern recognition. 4th ed. Chapter 2. London: Academic press; 2009. p. 13–89.

  9. 9.

    Langley P, Sage S. Oblivious decision trees and abstract cases. In: Working notes of the AAAI-94 workshop on case-based reasoning; 1994. p. 113–117.

  10. 10.

    Diggle PJ, Chetwynd AG. Statistics and scientific method. Chapter 7. Oxford: Oxford University Press; 2011. p. 79–113.

  11. 11.

    Holliday GL, Andreini C, Fischer JD, Rahman SA, Almonacid DE, Williams ST, Pearson WR. MACiE: exploring the diversity of biochemical reactions. Nucleic Acids Res. 2012;40:D783–9.

    PubMed Central  Article  CAS  PubMed  Google Scholar 

  12. 12.

    Holliday GL, Bartlett GJ, Almonacid DE, O’Boyle NM, Murray-Rust P, Thornton JM, Mitchell JBO. MACiE: a database of enzyme reaction mechanisms. Bioinformatics. 2005;21:4315–6.

    PubMed Central  Article  CAS  PubMed  Google Scholar 

  13. 13.

    Holliday GL, Almonacid DE, Bartlett GJ, O’Boyle NM, Torrance JW, Murray-Rust P, Mitchell JBO, Thornton JM. MACiE (mechanism, annotation and classification in enzymes): novel tools for searching catalytic mechanisms. Nucleic Acids Res. 2007;35:D515–20.

    PubMed Central  Article  CAS  PubMed  Google Scholar 

  14. 14.

    Fukunga F. Introduction to statistical pattern recognition. 2nd ed. Chapters 6 and 7. Academic press; 1992. p. 254–366.

  15. 15.

    Tsoumakas G, Spyromitros-Xioufis E, Vilcek J, Vlahavas I. Mulan: a java library for multi-label learning. J Mach Learn Res. 2011;12:2411–4.

    Google Scholar 

Download references

Authors’ contributions

LDF generated the datasets. HYM performed the re-analyses of the dataset. JBOM initiated the main theme (applying pattern recognition to predicting enzymatic mechanisms). All authors read and approved the final manuscript.


We thank the BBSRC for funding this research through grant BB/I00596X/1 and are also grateful to the Scottish Universities Life Sciences Alliance (SULSA) for financial support.

Availability of supporting data

The Additional Files from our previous study [1], of which this work is an extension, are available at: There are no further supporting data associated with this report.

Competing interests

The authors declare that they have no competing interests.

Author information



Corresponding authors

Correspondence to Hamse Y. Mussa or John B. O. Mitchell.

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (, 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 ( applies to the data made available in this article, unless otherwise stated.

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Mussa, H.Y., De Ferrari, L. & Mitchell, J.B.O. Enzyme mechanism prediction: a template matching problem on InterPro signature subspaces. BMC Res Notes 8, 744 (2015).

Download citation


  • Enzyme mechanism
  • InterPro signatures
  • Nearest-neighbour