title: Automated alphabet reduction for protein datasets.
abstract: BACKGROUND
  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.
  
  
  RESULTS
  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.
  
  
  CONCLUSIONS
  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.
authors.affiliation: ASAP research group, School of Computer Science, University of Nottingham, Jubilee Campus, Wollaton Road, Nottingham, NG8 1BB, UK. jaume.bacardit@nottingham.ac.uk
authors.forename: Jaume
authors.initials: J
authors.lastname: Bacardit
authors.forename: Michael
authors.initials: M
authors.lastname: Stout
authors.forename: Jonathan D
authors.initials: JD
authors.lastname: Hirst
authors.forename: Alfonso
authors.initials: A
authors.lastname: Valencia
authors.forename: Robert E
authors.initials: RE
authors.lastname: Smith
authors.forename: Natalio
authors.initials: N
authors.lastname: Krasnogor
mesh_terms: D000465:Algorithms; D000595:Amino Acid Sequence; D000818:Animals; D019295:Computational Biology / Q000379:methods*; D003198:Computer Simulation; D030562:Databases, Protein; D006801:Humans; D010363:Pattern Recognition, Automated; D011487:Protein Conformation; D011506:Proteins / Q000737:chemistry* / Q000145:classification; D016415:Sequence Alignment; D020539:Sequence Analysis, Protein / Q000379:methods*
chemical_list: D011506:Proteins