- Research article
- Open Access
Automated Alphabet Reduction for Protein Datasets
BMC Bioinformatics volume 10, Article number: 6 (2009)
We investigate automated and generic alphabet reduction techniques for protein structure prediction datasets. Reducing alphabet cardinality without losing key biochemical information opens the door to potentially faster machine learning, data mining and optimization applications in structural bioinformatics. Furthermore, reduced but informative alphabets often result in, e.g., more compact and human-friendly classification/clustering rules. In this paper we propose a robust and sophisticated alphabet reduction protocol based on mutual information and state-of-the-art optimization techniques.
We applied this protocol to the prediction of two protein structural features: contact number and relative solvent accessibility. For both features we generated alphabets of two, three, four and five letters. The five-letter alphabets gave prediction accuracies statistically similar to that obtained using the full amino acid alphabet. Moreover, the automatically designed alphabets were compared against other reduced alphabets taken from the literature or human-designed, outperforming them. The differences between our alphabets and the alphabets taken from the literature were quantitatively analyzed. All the above process had been performed using a primary sequence representation of proteins. As a final experiment, we extrapolated the obtained five-letter alphabet to reduce a, much richer, protein representation based on evolutionary information for the prediction of the same two features. Again, the performance gap between the full representation and the reduced representation was small, showing that the results of our automated alphabet reduction protocol, even if they were obtained using a simple representation, are also able to capture the crucial information needed for state-of-the-art protein representations.
Our automated alphabet reduction protocol generates competent reduced alphabets tailored specifically for a variety of protein datasets. This process is done without any domain knowledge, using information theory metrics instead. The reduced alphabets contain some unexpected (but sound) groups of amino acids, thus suggesting new ways of interpreting the data.
The prediction of the 3D structure of protein chains, known as Protein Structure Prediction (PSP), is a key challenge in structural bioinformatics. Not only there is a lack of consensus on how to approach PSP, but for some of the current methods, especially ab-initio ones, computations are exceedingly demanding. Rosetta@home , one of the top predictors in the CASP7 (Critical Assessment of techniques for protein Structure Prediction) experiment, used up to 10000 computing days to model a single protein. One way in which PSP calculations might be accelerated is by using a divide-and-conquer approach, where the problem of predicting the tertiary structure of a given sequence is split into smaller challenges, such as predicting secondary structure, solvent accessibility, coordination number, etc. and then using the solutions for these simpler problems as constraints, i.e. building blocks, for the original 3D prediction. A complementary strategy would be to reduce the size of the alphabet of the variables that are involved in the prediction of tertiary structure, and solve the previously mentioned sub-problems using the reduced alphabets. The alphabet by which the sequence of a protein is represented would be an obvious focus for any reduction mechanism.
An example of a widely used reduction is the two-letter hydrophobic/polar (HP) alphabet . This reduction is usually followed by constraining the residue locations of the protein to those of a 2D/3D lattice [3, 4]. Sometimes this HP alphabet reduction is applied to off-lattice proteins. For example, in a recent paper  we compared predictions of residue contact numbers (CN) for lattice and off-lattice proteins using both the HP alphabet and the amino acid (AA) alphabet. The HP alphabet gave predictions significantly less accurate than the AA alphabet, although the difference was not large (at most 3.8%). The reduction of alphabets for PSP related problems brings to the fore some important questions. (1) Is it possible to reduce alphabet size without significantly losing information and hence degrading performance? (2) Is there a single reduced alphabet for all problems? Or would, for example, the prediction of disulfide bonds necessitate a different alphabet than, for instance, the prediction of contact numbers?
The alphabet reduction problem in the context of PSP can be summarized in a simple question: which is the minimum number of AAs that is able to represent the structural information of a protein? That is, when is the loss of information intrinsic in the alphabet reduction problem going to affect crucial data? In general this kind of process involves deciding on three aspects: (1) how are we going to represent the protein structural information? (2) how are we going to quantify how good is the reduced alphabet to maintain the crucial information held in the representation from point 1 and (3) how are we going to obtain the optimal reduced alphabet based on the metric of point 2.
The work of Solis and Rackovsky  is one of the earliest alphabet reduction methods that, like our approach, uses information theory to quantify the quality of the reduced alphabets. They propose an information gain function that measures how different the entropy of the structural patterns represented by a given reduced alphabet is from a random distribution of patterns, and then optimize this function using a Monte Carlo method to obtain their optimal reduced alphabet. Two representations of a protein structure were evaluated in that work, one based on bond lengths, bond angles and dihedral angles of the protein's backbone and another one based on secondary structure states of the protein residues. Other work of these authors combining information theory and reduced alphabets includes  and . The latter one also introduces the simultaneous generation of multiple reduced alphabets for different parts of the protein representation, which is similar to our DualRMI strategy.
Other methods [9, 10] base their metrics on the Miyazawa-Jernigan interaction matrix , while others  are based on the BLOSUM substitution matrix . Another work  uses the Kullback-Leibler distance  between probability distributions as their metric to evaluate reduced alphabets, applied to a four-state secondary structure representation. One example of the application of an Evolutionary Algorithm to alphabet reduction is . In this case, a genetic algorithm (GA) was used to optimize a five-letter alphabet for sequence alignment. The GA was used to maximize the difference between the sequence identity of the training alignments and a set of random alignments based on the same sequences. Another approach  applied Mutual Information to optimize alphabet reduction for contact potentials. Meiler et al.  proposed a method whereby, instead of treating each AA type at a symbolic level, they were characterized through several physical features and a neural network was applied to generate a lower dimensionality representation of these features. Wrabl and Grishin  used the Monte Carlo method to optimize groups of amino acids that maximize the total variance of amino acid frequencies applied to multiple sequence alignments. A different structural representation was used by , where the 3D structure of a protein is mapped into protein blocks of five residues long containing eight consecutive (ψ, φ) dihedral angles. The distributions of AAs in the protein blocks were used to group together those having similar local structure.
Reduced alphabets for protein sequences have other traditional uses besides PSP, such as protein design and mutation, where the goal is to obtain sequences, either generating them from scratch or modifying previously known proteins, that fold in a certain specific way or to obtain/maintain certain functional properties. To that end, it is important to known which AAs can be exchanged with which others without impacting in the fold or the function/stability/etc. of the protein. That is, which AAs can be grouped together because they behave similarly. A classic example of this kind of research is , where several proteins with a certain specific alternation of polar/nonpolar residues were designed and all of them folded into four helix bundle proteins. The specific AA sequence of each protein varied, but the pattern of polar/nonpolar residues was always the same. Another example is , where an enzyme used for D-amino acids production was randomly mutated, and the individual AA substitutions that maintained the enzyme function and increased its thermostability were identified. In  a 213-residue E. Coli enzyme was mutated with the objective of obtaining a functionally similar protein having a reduced set of amino acids. In the final variant of the enzyme, after 73 substitutions, nine AA types occupied 88% of its sequence, and seven AA types were never present.
In recent work  we proposed an automated method to perform alphabet reduction. This method uses ECGA  to optimize the distribution of the 20 letters of the AA alphabet into a predefined number of categories, using the Mutual Information (MI) metric, as an objective function. This measure relates the dependence between two variables: the input attributes and the feature we are predicting. By optimizing this measure we are looking for the alphabet reduction that maintains as much of the useful information as possible existing in the input attributes related to the predicted feature. We applied this measure to predict CN , optimizing alphabets ranging from two to five letters. Afterwards, the dataset with reduced representation was fed into the BioHEL machine learning method  to determine if the reduced alphabet was able to perform competently. It was possible to obtain an alphabet of three letters with similar performance to the full AA alphabet using a protein-wise accuracy metric.
However, when the sample size was small, e.g. trying to optimize alphabets with more than three symbols, the MI was unable to find a reduced alphabet without losing performance. Table 1 contains, for each tested alphabet size in our previous work, the percentage of possible input patterns actually represented in the dataset. We were predicting the CN of a residue using as input information the AA type of a window of ± 4 residues around the target. Therefore, if a two-letter alphabet was used to represent these data, there would be a total of 512 possible input patterns (two letters and nine window positions). If we were using a three letters alphabet, we would have 19683 possible input patterns. As the training set contained around 230000 instances, with two and three letters it was (almost) possible to have at least one occurrence of all possible input patterns. However, beyond three letters only a fraction of the input patterns is available, and mostly with a single instance per pattern. An extreme case that illustrates the small sample size issue is if we were to compute this percentage of represented patterns for the original 20-letter AA alphabet. The difference between the size of the, already large, training set and the size of the input space is many orders of magnitude. MI needs redundancy in order to estimate properly the relation between inputs and outputs, and there is almost no redundancy in the dataset for alphabets with more than three letters. This objective function cannot provide appropriate information for a successful alphabet optimization. Our experiments confirmed a performance degradation for alphabets of four and five letters and, moreover, it was difficult to extract meaningful explanations for the resulting reduced alphabets. In this paper we use an existing method  to increase the robustness of the MI metric, which is implemented into two of our alphabet reduction strategies, RMI and DualRMI (defined in next section).
In this paper, we address these issues by extending our previous work . Given a dataset and a feature to predict (structural representation) one may ask "what is the optimal alphabet that must be used to represent and exploit the available data?" This is, in essence, an optimization problem for which, as stated above, a suitable objective function and optimization algorithm must be found. In this paper we propose that an existing robust MI estimation method  is a very strong candidate for a good objective function, while a state-of-the-art evolutionary algorithm, ECGA , is used to explore the vast and complex search space associated with alphabet minimization. We test our protocol on two structural bioinformatics problems, namely, contact number (CN) and relative solvent accessibility (RSA) prediction. That is, we used the automatically reduced alphabets to predict CN and RSA profiles for proteins and compared their accuracy against those of the full alphabet, reduced alphabets found in the literature  and with some expert-designed ones. Our results indicate that we can obtain reduced alphabets of only five letters that give an accuracy within 1% of that obtained with the full AA alphabet, and higher accuracy than the other reduced alphabets included in the comparison. The differences between the reduced alphabets are quantitatively analyzed. As a final experiment to show the generality and scientific relevance of this work, we used five-letter alphabet obtained with our protocol to reduce a protein representation using evolutionary information, namely a position-specific scoring matrix (PSSM)  representation, and then we repeated the process of learning from both the reduced and the original representation and compare their performance.
Dataset and predicted PSP features
The CN of a certain AA is a specific feature of a protein's 3D structure. That is, in the native state, each residue will have a set of other residues that are its spatial nearest neighbours. The number of nearest neighbours of a given residue is its contact number. A variety of machine learning paradigms have been used to predict this feature [26, 30, 31]. The CN definition we have used is the one proposed by Kinjo et al. . It is defined using the C β atom (C α for glycine) of the residues. The boundary of the sphere around a residue, defined by the distance cutoff d c ∈ ℜ+, is made smooth by using a sigmoid function. A minimum chain separation of two residues is required. Formally, the CN, , of residue i in protein chain p is computed as:
where r ij is the Euclidean distance between the C β atoms of the i th and j th residues. The constant w determines the sharpness of the boundary of the sphere. In this paper we used a distance cutoff d c of 10 Å and a w of 3. The real-valued definition of CN has been discretized in order to transform the dataset into a classification problem that can be mined by machine learning methods. We divide the range of CN values into two states (low/high CN) by cutting the CN range by its middle point. To predict the CN of each residue in a protein we use the set of input attributes labelled as CN1 in : the input data consist of the AA type of the residues in a window of four residues at each side of the target.
In the final experiment using the PSSM representation, this information was computed by using the PSI-BLAST program  following the procedure suggested in . Each residue in the chain is represented by 20 continuous variables. We use the same window size of ± 4 residues. Thus, each instance has 180 attributes.
Relative Solvent Accessibility
Another interesting PSP feature is the solvent accessibility (SA) of residues. Prediction of this feature is usually addressed after a certain AA-wise normalization, where the SA of a residue is divided by the maximum accessible surface in the extended conformation of its AA type in what is known as relative solvent accessibility (RSA) . In order to predict this continuous feature some works use regression methods  while other works predict whether the RSA of a residue is, for instance, lower/higher than some threshold (Buried/Exposed), treating this prediction as a classification problem [34, 36]. We have used the DSSP program  to obtain the actual SA of each residue in the dataset. Next, we compute the RSA by dividing the SA of each residue by the maximum SA values specified in  for each AA type. The continuous RSA was transformed into a classification problem, by dividing the domain into buried/exposed states, placing a cut point at 25% RSA, as in . The input data used to predict RSA are analogous to the data used for the CN dataset: the AA type of the residues in a window of ± 4 residues around the target. The PSSM representation for RSA is also equivalent to the one used for CN: 180 continuous attributes.
We have used the dataset and training/test partitions proposed by Kinjo et al. . The protein chains were selected from PDB-REPRDB  with the following conditions: less than 30% of sequence identity, sequence length greater than 50, no membrane proteins, no nonstandard residues, no chain breaks, resolution better than 2 Å and a crystallographic R factor better than 20%. Chains that had no entry in the HSSP database  were discarded. The final dataset contains 1050 protein chains and 257560 residues. Data were partitioned into training and test sets using an iterated hold-out procedure (very close to the standard stratified ten-fold cross-validation procedure). The proteins included in training/test pair of sets are reported in http://www.infobiotic.net/papers/AlphaRed/fold_definitions.tar.gz. The original and alphabet-reduced datasets for both CN and RSA prediction and all the training/test partitions are available at http://www.infobiotic.net/papers/AlphaRed/DatasetsAlphaRed.tar.gz (368 MB).
Automated Alphabet Reduction protocol
The experimental protocol follows two main stages. In the first one, ECGA is used to optimize a reduced alphabet. MI is used as the objective function. In the second stage, BioHEL  is used to validate the reliability of the optimized alphabet found in the first stage by training classifiers, i.e. predictors, for CN and RSA. The following protocol was used for our experiments. For each dataset (CN and RSA) and for each tested alphabet size (from two to five letters) ECGA is used to find the optimal alphabet reduction of the predetermined size using the MI-based objective function. Three MI strategies are used: MI, RMI and DualRMI (explained in the next subsection). Next, the alphabet reduction policy is applied to the dataset. Finally, the BioHEL classification method is applied to the dataset with the optimally reduced alphabet found in the previous stage. We have tested alphabets of up to five letters only, because we are (1) interested in determining the smallest possible alphabet size that suffers from only a marginal information loss and (2) because recent literature focuses on alphabets of similar sizes .
Optimization of reduced alphabets
ECGA  is an optimization method belonging to the family of Estimation of Distribution Algorithms (EDA) . EDAs are Evolutionary Computation Techniques that employ statistical learning or machine learning methods to estimate the structure of the problem, and employ these estimations to perform an intelligent exploration of the search space. In the ECGA, the structure of the population is modelled as a set of non-overlapped groups of variables. The variables in each group interact strongly among themselves, and interact less with variables in other groups. Next, an exploration mechanism seeks new solutions, exploiting the estimated problem structure model. We have extended a public implementation of ECGA ftp://www-illigal.ge.uiuc.edu/pub/src/ECGA/chiECGA.tgz to optimize reduced alphabets. The source code of the program is available from http://www.infobiotic.net/papers/AlphaRed.
The aim of the alphabet reduction optimization is to simplify the representation of the dataset with the goals of (1) making the problem easier to learn and (2) enhancing the interpretability of the resulting classifiers. These two goals are, of course, counterbalanced with the need to maintain the essential information contained in the original dataset. Therefore, the objective function for such a process should give an estimation of what the reduced input information can infer about the output.
MI is a measure that quantifies how much information one variable holds about the other . It is defined as:
where p(x) and p(y) are, respectively, the probabilities of appearance of x and y, and p(x, y) is the probability of having x, y at the same time in the dataset. In our case, we use MI to measure the quantity of information that the input variables of the alphabet-reduced dataset have in relation to the states in which the protein structural feature is partitioned. That is, for a given instance, x represents a string that concatenates the input variables of the instance, while y encodes the associated class for that instance.
Alphabet reduction strategies
We describe next the three studied reduction strategies. The first corresponds to the strategy tested in our previous work , while the latter two represent substantial improvements.
Mutual Information strategy
This strategy is composed of a representation of the reduced alphabet and an objective function that evaluates such reduction. The representation is simple: it has one variable for each letter of the original alphabet (the 20 AA types plus the end-of-chain symbol) encoding the group of letters where this AA type is assigned. This variable can take a value in the range 0..N - 1, where N is the predefined number of symbols of the reduced alphabet. Table 2 illustrates an example of such encoding for a reduction process into two groups. The objective function that evaluates the reduction is the original MI metric as per eq. 2.
Each objective function computation follows these steps: first, the reduction mappings are extracted from the representation. Next, the instances of the training set are transformed into the low cardinality alphabet based on the extracted mappings creating a set of pairs (x1, y1), (x2, y2), ..., (x n , y n ). Then, MI is computed from the data, MI = I(X, Y). The objective function of this alphabet reduction is its dataset Mutual Information.
Robust Mutual Information
As discussed in the introduction, the performance of MI as a good objective function degrades when applied to small samples. Hence, we also use the approach proposed in . The strategy is known as Robust Mutual Information (RMI). It uses the same representation encoding as in the MI strategy, but a different objective function, that is computed as follows: first, the reduction mappings are extracted from the representation and the MI measure is computed as in the previous strategy. Next, we scramble the pairs of (x i , y i ), i ∈ 1..n joining randomly some x i with some y j , but maintaining all X and Y from the original dataset. The shuffling process is repeated N times with different random seeds, and the MI measures computed from each shuffling are averaged. . Finally, the objective function of this alphabet reduction is the dataset MI minus the average shuffled MI: obj func = MI - MI s . Intuitively, MI s is an estimation of the sampling bias existing in the data, unrelated to the relationship between X and Y. By removing it from the MI, we obtain a better estimation of the amount of information that X and Y share.
Dual Robust Mutual Information
The third reduction strategy is motivated by our findings , that suggested that the target AA and its environment (the window composed of the nearest neighbours of the target in the protein chain) might benefit from two different reductions. This observation leads us to think that it might be sensible to test the performance of a dual alphabet reduction: one reduction policy specifically for the target residue and another reduction policy for the other residues in the window. This strategy will be used in combination with RMI with the name Dual Robust Mutual Information (DualRMI) strategy.
Verification of the reduced alphabets
To verify the results of the first stage of our protocol, we use the BioHEL machine learning method to learn the dataset with reduced representation. BioHEL (Bioinformatics-oriented Hierarchical Evolutionary Learning) is an Evolutionary-Computation based Machine Learning system following the Iterative Rule Learning approach . BioHEL is also strongly influenced by GAssist  which is a Pittsburgh GBML system. The system applies a generational Genetic Algorithm (GA) with elitism, which evolves individuals that are classification rules. Rules are obtained by an iterative process. After each rule is obtained, the training examples that are covered by this rule are removed from the training set, to force the GA at the next iteration to explore other areas of the classification space. The performance of BioHEL is enhanced by running it several times with different initial random seeds on the same data. Afterwards, the rule sets obtained by each run are combined to form an ensemble that generates consensus prediction using a simple majority vote. For specific details of the design and objective function of BioHEL, see . The source code of the program is available from http://www.infobiotic.net/papers/AlphaRed.
Results and discussion
Contact Number prediction
ECGA was used to find alphabet reductions into alphabets of two, three, four and five symbols following the MI, RMI and Dual RMI strategies. Figure 1 shows the reductions obtained; for visualization of the physico-chemical properties of the AA groups obtained, we have colored each AA type differently according to the properties discussed in . We have aligned as much as possible the amino acids between the reduction groups of increasing alphabet size. This allows us to observe how the optimization method rearranges the groups when the alphabet size grows. Also, we have marked with a solid rectangle the amino acids that remain within the same group with at least one other amino acid for all the four tested alphabet sizes. For simplicity, we show only the reductions obtained from the first of the ten training sets. The reduction groups for the other training sets are reported in Additional File 1. These reduction groups, although slightly different for each training set (especially in the MI strategy, quite noisy because of the small sample issue explained in the background section), provide similar statistical and predictive properties.
When ECGA is used with the RMI strategy to search the space of possible reduced alphabets with the goal of designing a five letters alphabet, it does not find a solution with five letters and reports instead a candidate alphabet with four letters. DualRMI did find a five-letter alphabet for the target residue, but only a four-letter alphabet for the other residues. Thus, we overcame the RMI limitations with this heuristic approach.
Counting the number of framed amino acids for each reduction strategy provides a simple metric of the results of these experiments. For the MI strategy, only nine AA always stay in the same group, while for the RMI strategy 19 of the 20 AA do. This simple metric shows how the objective function is more stable and thus the obtained alphabets are easier to understand, (for instance, most of the charged residues belong to the same reduction group). Moreover, later in this subsection we will show how this strategy also gives better performance when learning from the reduced alphabets. For the DualRMI strategy, 17 AA of the target residue and 15 of the other residues in the window remain in the same group. These numbers are less than the 19 AA of the RMI strategy, but RMI had no five-letter alphabet and therefore it is easier for this strategy to maintain the groups.
When optimizing for a two-letter alphabet, both MI and RMI find two identical groups of AA types that separate the hydrophobic residues (ACFGHILMVWY) from the rest (Histidine is sometimes considered as Hydrophobic ). Hydrophobicity is one of the main factors in the folding process of proteins, so it is natural that a reduction process into only two symbols is equivalent to identifying the hydrophobic residues. The DualRMI strategy also gives similar reduction groups, but with small differences between the reduction of the target residue, where the hydrophobic group is smaller, and the reduction for the other residues, where the hydrophobic group contains more AA types.
Looking at the physico-chemical properties of the four and five-letter alphabets a clear difference emerges (reflected in performance, as shown later) between the reduction groups for the MI strategy and those for the other two strategies. All MI groups have very mixed properties, while in RMI and DualRMI there is a clear difference between groups that include hydrophobic residues or not. However, some groups are difficult to explain, such as the GHTS group for the DualRMI five-letter alphabet. G, T and S are small amino acids, H is large. G and H are hydrophobic, while the other two are not. H is aromatic and has a high coil propensity.
A retrospective analysis of the dataset reveals why GHTS are clustered together. Table 3 shows, for each AA type, the proportion of residues in the dataset that belong to the high CN class, sorted by increasing order. The groups correlate almost perfectly with the sorted residues in the table, showing that G, H, T and S have similar properties in terms of CN.
The reduced alphabets were used to represent the CN datasets, which were then used to train and test BioHEL. Table 4 contains the results of the learning process. For each reduction strategy and alphabet size we have reported three measures. As a performance measure we have included the test accuracy. To illustrate the interpretability and explanatory power of the reduced datasets, we have included two complexity metrics for the classifiers: average number of rules and average number of relevant attributes in each rule. As a baseline, the performance and complexity obtained with the full AA type representation is also included (labelled orig.). These results were analyzed using statistical t-tests (99% conf.) to determine if the differences in accuracy were significant. The Bonferroni correction for multiple comparisons was employed.
The results for the MI strategy are similar to those presented in previous work. Only the dataset with the three-letter alphabet gives a performance statistically comparable to the performance given by the original dataset. Larger alphabet sizes degraded the results. On the other hand, both RMI and DualRMI obtain their best results in the four and five-letter alphabets, closing the performance gap with the full AA alphabet to 0.7% (for the DualRMI strategy and four-letter alphabet). DualRMI always obtains better results than RMI, except for the three-letter case, showing the usefulness of this strategy. These results (together with the results for the RSA dataset, shown later in this section) answer the first of the questions that we wanted to address in this paper, determining the minimum alphabet size that obtains similar results to the full AA representation. Moreover, the rules learned using the reduced datasets are more compact and human readable, in both the number of rules and the number of expressed attributes, than the solutions produced from the original dataset.
Relative Solvent Accessibility prediction
ECGA, with each of the three reduction strategies (MI, RMI and DualRMI) was also used to find alphabet reductions to two, three, four and five symbols for RSA prediction. Figure 2 describes the reductions obtained, using the same visualization techniques employed previously. The comparison between the alphabets in figure 1 with those in figure 2, generated for CN, shows several differences. For instance, the alphabets for RSA contains more groups of polar residues, while most of the hydrophic residues are grouped together. On the other hand, several groups of hydrophobic residues exist in the CN alphabets, while the polar residues are grouped together.
Given that both features are strongly anti-correlated (Pearson's correlation coefficient of -0.55 for our dataset), one could expect that the reduced alphabets found for CN would be useful for RSA too. This turns out not to be the case and the differences between the two features are successfully captured by the alphabet reduction process. Moreover, these differences further justify the automated procedure presented in this paper, which tailors the reduction specifically to each problem.
The number of amino acids that remain grouped together in the MI strategy is 13, while in the RMI strategy it is 18. For the DualRMI strategy, 18 AA types also stay in the same group for the target residue, while 16 of them do for the other residues. Again, no alphabet with five letters was found for the RMI strategy and we find, again, a group of AA types formed by GHTS in RMI and DualRMI alphabets. If we sort the amino acids by their proportion of exposed instances in the dataset (reported in table 5) we can see how the reduction groups match perfectly the order of AA types in the table, similarly to what happened in the case of the CN dataset.
We also observe some interesting facts that are particular to this dataset, namely the presence of reduction groups including only one amino acid type: the A type for the DualRMI strategy with five-letter alphabet and target residue and G for the other residues, and X in RMI with four letters and DualRMI with four and five letters. The end-of-chain symbol, X, only appears in 3.2% of the instances in the dataset. However, this symbol has the highest proportion, 72.4%, of exposed instances of all 21 alphabet letters. In comparison, the second letter with highest proportion of exposed residues is Lys with only 49.9% of exposed instances. Thus, it makes sense for the protocol to create a reduction group containing only X. We also observe other very small groups, like EK.
The reduced alphabets were used to represent the RSA datasets, which were then used to train and test BioHEL. Table 6 contains the results of the learning process, which are quite different from the results for CN. Here only the DualRMI strategy (using the four and five-letter alphabets) achieves a performance statistically similar to that obtained by learning the dataset with full alphabet. There is a significant performance difference between RMI and DualRMI in the RSA, which was not observed for the CN dataset. Moreover, the performance gap between the best reduced alphabet, using DualRMI and five letters and the original alphabet with full AA type representation is 0.4%, even less than for the CN dataset. For the predictions of RSA, an alphabet representation with only two or three symbols degrades the classification performance severely. This matches with our previous observation of having very small reduction groups in some of the DualRMI alphabets (such as A, G or EK). If an alphabet of two or three letters contains one letter with such small groups it means that there must be another letter grouping a large number of letters, and the likelihood that such large group is meaningful is very low, because it is over-simplifying the representation. Table 7 shows two rule sets generated by BioHEL, one for CN, the other for RSA, both obtained from the full AA alphabet. We can observe very specific predicates associated to the target residue, especially for the RSA dataset. It would be practically impossible to generate equivalent rules when learning from alphabets with only two or three letters.
Comparison against other reduced alphabets
We compared the performance of the five-letter reduced alphabets obtained using the DualRMI strategy, the most successful of those presented in this paper, against other alphabets summarized in table 8. The first four are taken from the literature . For the specific usage in this work it has been necessary to extend them with an extra letter, the end-of-chain symbol (X), which is used to identify when the window of residues around the target overlaps with one end of the chain. We would like to clarify that these alphabets from the literature were not optimized for CN or RSA prediction, but for other tasks such as sequence alignment. Thus, we expect our alphabets to perform better because they have been explicitly optimized for the features at hand. Our goal in this experiment is to check how adaptable these reduced alphabets are across different PSP-related problems. Our aim is, by no means, to find a single best alphabet that is good for all protein problems.
Moreover, we have manually designed three reduced alphabets based on physico-chemical properties. The first alphabet uses four properties: size, hydrophobicity, coil propensity and aromatic nature. The second alphabet adds another property to the first one: charged residues, and the third alphabet adds another property to the second one: those amino acids having sulphur atoms. The goal of this comparison is to check how far in performance terms a generic reduced alphabet is from an optimized reduced alphabet. Table 9 contains these comparisons. The automatically derived reduced alphabets obtain higher performance than all the other reduced alphabets. The performance degradation of these alternative alphabets, when compared to the full AA representation, was significant according to the t-tests for all the alphabets in the RSA dataset, and for the MU4 alphabet in the CN dataset. The three human-designed alphabets, despite having more letters than the other alphabets, perform poorly. A less reduced alphabet, if improperly designed, will lose as much information or more than a more compact alphabet.
Even though that the performance differences between the other reduced alphabets and the AA representation were significant, these differences are not very large. This observation might be taken to suggest that developing new reduced alphabets adapted for CN or RSA may not be worthiwhile. We do not agree with this contention for several reasons. First of all, the automated alphabet reduction proposed in this paper is very generic and flexible. Thus, generating new reduced alphabets tailored to new features can be done easily and without much effort. Secondly, the previous alphabets, despite still being able to hold quite a large amount of information, are not able to capture totally the crucial information for an optimal prediction of CN and RSA. To illustrate this claim we have regenerated tables 3 and 5 (that showed the reduction groups of the DualRMI strategy sorted by the ratio of high CN/exposed residues in the dataset) to compare our DualRMI alphabets to the four alphabets from the literature. The new tables are table 10 (for CN) and table 11 (for RSA).
To quantify the differences between the reduced alphabets we have computed two simple statistics: (1) counting the number of transitions between reduction groups through the sorted list of AA and (2) computing the range of each reduction group, that is, the difference between the maximum and minimum high CN/exposed ratio of the AAs in the same group, and averaging these ranges. Both a low number of transitions and a small average range indicate that the AA grouped together have similar behavior in terms of CN or RSA. The alphabets generated by our DualRMI strategy present always the lowest number of transitions and average range from all the compared alphabets. Except for the MM5 alphabet, all the other three alphabets from the literature have a number of transitions that, at least, almost doubles the number of groups of DualRMI.
With these statistics we have quantified the differences of the compared alphabets in relation to CN and RSA. However, why do several of these alphabets have poor performance for CN or RSA? Tables 10 and 11 can also answer this question. In MM5, Lys (with 81.9% of exposed residues) and Thr (with 47.1% of exposed residues) are in the same group. For MU4, Lys and His (43.8% of exposed residues) are in the same group. For SR5, Lys is in the same group as Ala (33.6% of exposed residues. Finally, for WW5 Lys is in the same group as Ser (48.0% of exposed residues). These ranges of exposed ratios are very large, effectively treating equally AA types with very different behavior. In DualRMI this situation does not happen, and the largest range is only 12.8% wide. For the CN dataset all ranges of high CN ratio for all alphabets are much smaller, and this is reflected in the much smaller performance differences between all reduced alphabets. The principal difference between the alphabet with worse performance (MM4) and the others, besides having one less letter, is having clustered together Ala and Pro. None of the other alphabets has both AAs in the same group. A further investigation would be necessary to quantify the impact of such a group.
As a final experiment, we test the performance of the reduced alphabet obtained from the RSA dataset in learning CN and also using the CN reduced alphabet to learn RSA. This latter option is labelled DualRMI-alt. The results of this experiment are in table 12. The optimized alphabet using DualRMI for RSA performed well when applied to the CN feature. However, the reverse is not the case. The alphabet optimized for CN data performs poorly when applied to the RSA data. The reason for this is that the CN alphabet misses a specific reduction group only for Glu and Lys and, in consequence, having the same problem that we have discussed above about the alphabets from the literature. The rule sets in table 7 also showed this difference between CN and RSA. The predicates associated to the target residue were quite different between features. This observation shows that reduced alphabets should be tailored to the specific problem at hand, even if the problems are as similar as CN and RSA.
Extrapolating the obtained alphabets to reduce an evolutionary information-based representation
The experiments performed so far have been applied to proteins represented using their primary sequence. This representation contains limited amount of information when compared to other, more modern, approaches such as PSSM representations that take into account evolutionary information of proteins. In the final experiments reported in this paper we now evaluate the generality of the results (reduced alphabets) obtained so far by our protocol. To do so we are going to adapt the alphabet reduction process from the primary sequence representation to a PSSM representation.
In the primary sequence representation, each residue is characterized by a single discrete variable with 20 possible values (the AA alphabet). On the other hand, in the PSSM representation, each residue is characterized by 20 continuous variables. Each of the 20 variables indicates, for the associated AA type, its degree of preference for the corresponding residue position in the chain. Each letter in a reduced alphabet groups a set of AA types that should be treated as if they all were the same. Given all this, the application of our current reduced alphabet to a PSSM representation (represented in figure 3) is very simple:
Each residue will be characterized by N continuous variables, where N is the number of letters of our reduced alphabet.
The value of each of these attributes will be computed by averaging the variables of the PSSM profile associated to the AA types that were grouped to form that letter of the reduced alphabet.
In the case of using a dual alphabet (from the DualRMI strategy), we will apply one reduction to the PSSM profile of the target residue and the other reduction to the PSSM profiles of the other residues in the window.
As an example, if we were to apply this process, using the five-letter DualRMI alphabet, we would take the original dataset of 180 variables (20 PSSM values × 9 window positions) and transform it into a dataset of 37 variables, that is 5 variables for the target residue and 4 variables for the other 8 window positions. As we explained previously, the RMI and DualRMI (for the non-target alphabet) strategies converged to four-letter alphabets even if they were trying to optimize a five-letter alphabet.
The validation of this reduced PSSM representation is the same as used before. We will train BioHEL to predict CN and RSA using two representations: (1) the original PSSM representation of 180 attributes and (2) the reduced PSSM representation (using the DualRMI strategy) consisting of 37 attributes and we will compare the obtained accuracies. Table 13 contains the results of these experiments. We show four different performance metrics. Besides reporting test accuracy, and number of rules and number of expressed attributes per rule, as we did in the previous experiments, we also report the average run-time of each BioHEL training process. A full experiment consists of 400 runs of BioHEL: 10 cross-validation training sets × 40 models in each ensemble. The reported run-time metric is the average of these 400 runs. This metric is relevant in this context, because the training process using the reduced representation is much lower, and given the magnitude of the time values, this run-time reduction becomes an important factor. All experiments were performed on the Jupiter supercomputer of the University of Nottingham, using Opteron-248 processors running at 2.2 GHz, the Linux operating system and a C++ implementation of BioHEL.
The results reported in table 13 indicate that the performance gap between both representations, like in the previous experiments is small: 0.6% for CN, 0.9% for RSA. Moreover, the solutions generated by BioHEL when learning from the reduced representation are more compact in terms of number of rules and number of variables used in each rule. The number of variables per rule for these experiments is only a fraction (very small for the PSSM representation) of the attributes. Moreover, the run-time of the training process was approximately 1.6 times faster for both datasets, and considering that the run-times are reported in hours, this reduction is quite considerable in absolute terms.
The predictability of these models is quite comparable to other work from the literature. Kinjo et al  report 76.3% accuracy on two-state CN prediction, although their class definition criterion is slightly different from ours, and they use a distance threshold of 12 Å instead of 10 Å. Dor and Zhou  recently obtained 78.6% accuracy on two-state RSA prediction from a PSSM representation (accuracy was increased to 79.2% with additional input information) with a 25% RSA cutoff, the same as we have employed in this paper. Thus, our alphabet reduction protocol can be applied to state-of-the-art representations and obtains accuracy levels that are quite similar to the performance reported in the literature for predicting CN and RSA. This last experiment has helped to illustrate the generality of our findings.
This paper develops the use of information theory based automated procedures for alphabet reduction in PSP datasets. Our investigations indicate that: (1) finding a reduced alphabet with a performance that is statistically equivalent to the performance obtained with the full AA type representation is possible, (2) this does not compromise accuracy and enhances interpretability and (3) different problems might require different reductions and (4) the alphabets obtained from primary sequence data can be successfully adapted to richer representations using evolutionary information. These four observations taken together point to the need for a robust automated method, such as the one described in this paper, for tackling alphabet reduction. The tests with the three reduction strategies tell us that the DualRMI strategy can give a significant advantage, as has been shown for the solvent accessibility dataset. The reduction groups that our automated procedure finds translate quite well to physico-chemical characteristics such as hydrophobicity, but not completely. We find groups of letters such as GHTS that are difficult to explain. A retrospective analysis of the dataset shows that the reduction groups are sound, because they are a consequence of the underlying data that we are mining. Moreover, the learned reductions suggested a new way of interpreting the data, which a priori would have made no sense. That is, our results show that this automated procedure is sound, is not bound by any preconceptions the experimenter might have, tailors the alphabet reduction specifically for each dataset and obtains higher performance than other reduced alphabets available in the literature or human-design alphabet reductions. It can be applied with performance comparable to state-of-the-art protein representations, while at the same time it is able to provide new insight into the available data.
In future work, we will test alternative objective functions as well as other robust MI estimations. It would also be interesting to check if it is possible to find alphabets of slightly higher cardinality than the ones studied in this paper that are able to close even more the performance gap with the original representation. We also would like to apply this protocol to protein design problems. Finally, it would be interesting to apply this protocol to datasets with more than two classes or, even, regression datasets, although we expect that this option will require a much more robust fitness function, as this means (a) making worse the sample size problem of the MI metric and (2) MI has to be estimated in some way if applied to regression problems, as it originally only deals with discrete variables.
Misura KM, Chivian D, Rohl CA, Kim DE, Baker D: Physically realistic homology models built with ROSETTA can be more accurate than their templates. Proc Natl Acad Sci USA 2006, 103: 5361–5366.
Dill KA: Theory for the folding and stability of globular proteins. Biochemistry 1985, 24: 1501–1509.
Yue K, Fiebig KM, Thomas PD, Chan HS, Shakhnovich EI, Dill KA: A test of lattice protein folding algorithms. Proc Natl Acad Sci USA 1995, 92: 325–329.
Krasnogor N, Blackburne B, Burke E, Hirst J: Multimeme Algorithms for Protein Structure Prediction. Proceedings of the Parallel Problem Solving from Nature VII. Lecture Notes in Computer Science 2002, 2439: 769–778.
Stout M, Bacardit J, Hirst JD, Krasnogor N, Blazewicz J: From HP Lattice Models to Real Proteins: Coordination Number Prediction Using Learning Classifier Systems. In Applications of Evolutionary Computing, EvoWorkshops 2006. Springer LNCS 3907; 2006:208–220.
Solis AD, Rackovsky S: Optimized representations and maximal information in proteins. Proteins 2000, 38: 149–164.
Solis AD, Rackovsky S: Optimally informative backbone structural propensities in proteins. Proteins 2002, 48: 463–486.
Solis AD, Rackovsky S: Improvement of statistical potentials and threading score functions using information maximization. Proteins 2006, 62: 892–908.
Wang J, Wang W: A computational approach to simplifying the protein folding alphabet. Nat Struct Biol 1999, 6: 1033–1038.
Cieplak M, Holter NS, Maritan A, Banavar JR: Amino acid classes and the protein folding problem. Chem Phys 2001, 114: 1420–1423.
Miyazawa S, Jernigan RL: Residue-residue potentials with a favorable contact pair term and an unfavorable high packing density term, for simulation and threading. J Mol Biol 1996, 256: 623–644.
Li T, Fan K, Wang J, Wang W: Reduction of protein sequence complexity by residue grouping. Protein Eng 2003, 16: 323–330.
Henikoff S, Henikoff JG: Amino acid substitution matrices from protein blocks. Proc Natl Acad Sci USA 1992, 89: 10915–10919.
Liu X, Zhang LM, Guan S, Zheng WM: Distances and classification of amino acids for different protein secondary structures. Phys Rev E Stat Nonlin Soft Matter Phys 2003, 67(5 Pt 1):051927.
Kullback S, Leibler RA: On Information and Sufficiency. The Annals of Mathematical Statistics 1951, 22: 79–86.
Melo F, Marti-Renom M: Accuracy of sequence alignment and fold assessment using reduced amino acid alphabets. Proteins 2006, 63: 986–995.
Mintseris J, Weng Z: Optimizing protein representations with information theory. Genome Informatics 2004, 15: 160–169.
Meiler J, Müller M, Zeidler A, Schmäschke F: Generation and evaluation of dimension-reduced amino acid parameter representations by artificial neural networks. J Mol Model 2001, 7: 360–369.
Wrabl JO, Grishin NV: Grouping of Amino Acid Types and Extraction of Amino Acid Properties from Multiple Sequence Alignments Using Variance Maximization. Proteins 2005, 61: 523–534.
Etchebest C, Benros C, Bornot A, Camproux AC, de Brevern A: A reduced amino acid alphabet for understanding and designing protein adaptation to mutation. European Biophysics Journal 2007, 36: 1059–1069.
Kamtekar S, Schiffer J, Xiong H, Babik J, Hecht M: Protein design by binary patterning of polar and nonpolar amino acids. Science 1993, 262: 1680–1685.
Ikenaka Y, Nanba H, Yajima K, Yamada Y, Takano M, Takahashi S: Increase in Thermostability of. N-Carbamyl-D-Amino Acid Amidohydrolase on Amino Acid Substitutions. Bioscience, Biotechnology, and Biochemistry 1998, 62: 1668–1671.
Akanuma S, Kigawa T, Yokoyama S: Combinatorial mutagenesis to restrict amino acid usage in an enzyme to a reduced set. Proc Natl Acad Sci USA 2002, 99: 13549–13553.
Bacardit J, Stout M, Hirst JD, Sastry K, Llorà X, Krasnogor N: Automated alphabet reduction method with evolutionary algorithms for protein structure prediction. In GECCO '07: Proceedings of the 9th annual conference on Genetic and evolutionary computation. New York, NY, USA: ACM Press; 2007:346–353.
Harik G: Linkage Learning via Probabilistic Modeling in the ECGA. Tech. Rep. 99010, Illinois Genetic Algorithms Lab, University of Illinois at Urbana-Champaign; 1999.
Bacardit J, Stout M, Krasnogor N, Hirst JD, Blazewicz J: Coordination number prediction using learning classifier systems: performance and interpretability. In GECCO '06: Proceedings of the 8th annual conference on Genetic and evolutionary computation. ACM Press; 2006:247–254.
Bacardit J, Krasnogor N: BioHEL: Bioinformatics-oriented Hierarchical Evolutionary Learning. Nottingham ePrints report 482, University of Nottingham; 2006.
Cline MS, Karplus K, Lathrop RH, Smith TF, Rogers RG, Haussler D: Information-Theoretic Dissection of Pairwise Contact Potentials. Proteins 2002, 49: 7–14.
Gribskov M, McLachlan AD, Eisenberg D: Profile analysis: detection of distantly related proteins. Proc Natl Acad Sci USA 1987, 84: 4355–4358.
Kinjo AR, Horimoto K, Nishikawa K: Predicting Absolute Contact Numbers of Native Protein Structure From Amino Acid Sequence. Proteins 2005, 58: 158–165.
Pollastri G, Baldi P, Fariselli P, Casadio R: Prediction of coordination number and relative solvent accessibility in proteins. Proteins 2002, 47: 142–153.
Altschul SF, Madden TL, Schäer AA, Zhang J, Zhang Z, Miller W, Lipman DJ: Gapped BLAST and PSI-BLAST: a new generation of protein database search programs. Nucleic Acids Res 1997, 25: 3389–3402.
Wood MJ, Hirst JD: Protein secondary structure prediction with dihedral angles. Proteins 2005, 59: 476–481.
Rost B, Sander C: Conservation and Prediction of Solvent Accessibility in Protein Families. Proteins 1994, 20: 216–226.
Wang JY, Lee HM, Ahmad S: Prediction and Evolutionary Information Analysis of Protein Solvent Accessibility Using Multiple Linear Regression. Proteins 2005, 61: 481–491.
Qin S, He Y, Pan XM: Predicting Protein Secondary Structure and Solvent Accessibility with an Improved Multiple Linear Regression Method. Proteins 2005, 61: 473–480.
Kabsch W, Sander C: Dictionary of Protein Secondary Structure: Pattern Recognition of Hydrogen-Bonded and Geometrical Features. Biopolymers 1983, 22: 2577–2637.
Noguchi T, Matsuda H, Akiyama Y: PDB-REPRDB: a database of representative protein chains from the Protein Data Bank (PDB). Nucleic Acids Res 2001, 29: 219–220.
Sander C, Schneider R: Database of homology-derived protein structures and the structural meaning of sequence alignment. Proteins 1991, 9: 56–68.
Larrañaga P, Lozano J, Eds: Estimation of Distribution Algorithms, A New Tool for Evolutionnary Computation. Genetic Algorithms and Evolutionnary Computation, Kluwer Academic Publishers; 2002.
Cover TM, Thomas JA: Elements of Information Theory. John Wiley & Sons; 1991.
Venturini G: SIA: A Supervised Inductive Algorithm with Genetic Search for Learning Attributes Based Concepts. In Machine Learning: ECML-93 – Proc of the European Conference on Machine Learning. Edited by: Brazdil PB. Berlin, Heidelberg: Springer-Verlag; 1993:280–296.
Bacardit J: Pittsburgh Genetics-Based Machine Learning in the Data Mining era: Representations, generalization, and run-time. PhD thesis. Ramon Llull University, Barcelona, Catalonia, Spain; 2004.
Livingstone CD, Barton GJ: Protein sequence alignments: a strategy for the hierarchical analysis of residue conservation. Computer Applications in the Biosciences 1993, 9: 745–756.
Dor O, Zhou Y: Achieving 80 secondary structure prediction by large-scale training. Proteins 2007, 66: 838–845.
Murphy LR, Wallqvist A, Levy RM: Simplified amino acid alphabets for protein fold recognition and implications for folding. Protein Eng 2000, 13: 149–152.
We acknowledge the support of the UK Engineering and Physical Sciences Research Council (EPSRC) under grant GR/T07534/01. We are grateful for the use of the University of Nottingham's High Performance Computer.
JB participated in the conception and design of the study, carried out the experiments and statistical analysis reported in this paper and drafted the manuscript. MS helped to draft the manuscript. JH participated in the design of the study and helped to draft the manuscript. RS and AV participated in the design of the study. NK participated in the conception and design of the study and helped to draft the manuscript. All authors read and approved the final manuscript.
Electronic supplementary material
Additional file 1: Reduction groups obtained for all the training sets. This document lists 6 tables (3 reduction strategies and two datasets) containing the details of the reduction groups generated by our protocol for each of the ten training sets. (PDF 67 KB)
About this article
Cite this article
Bacardit, J., Stout, M., Hirst, J.D. et al. Automated Alphabet Reduction for Protein Datasets. BMC Bioinformatics 10, 6 (2009). https://doi.org/10.1186/1471-2105-10-6
- Mutual Information
- Reduction Group
- Protein Structure Prediction
- Amino Acid Type
- Contact Number