A post-decoding re-ranking algorithm for predicting interacting residues in proteins with hidden Markov models incorporating long-distance information. (December 2016)

• Record Type: Journal Article
• Authors: Kern, Colin; Liao, Li
• Is Part Of: Computational biology and chemistry. Volume 65(2016)
• Page Start: 21
• Page End: 28
• Publication Date: 2016-12
• Subjects: Protein–protein interaction -- Genetic algorithm; Chemistry -- Data processing -- Periodicals; Biology -- Data processing -- Periodicals; Biochemistry -- Data processing; Biology -- Data processing; Molecular biology -- Data processing; Periodicals; Electronic journals; 542.85
• DOI: 10.1016/j.compbiolchem.2016.09.015
• Languages: English
• ISSNs: 1476-9271

Abstract

Abstract : Graphical abstract: Abstract: Protein–protein interactions play a central role in the biological processes of cells. Accurate prediction of the interacting residues in protein–protein interactions enhances understanding of the interaction mechanisms and enables in silico mutagenesis, which can help facilitate drug design and deepen our understanding of the inner workings of cells. Correlations have been found among interacting residues as a result of selection pressure to retain the interaction during evolution. In previous work, incorporation of such correlations in the interaction profile hidden Markov models with a special decoding algorithm (ETB-Viterbi) has led to improvement in prediction accuracy. In this work, we first demonstrated the sub-optimality of the ETB-Viterbi algorithm, and then reformulated the optimality of decoding paths to include correlations between interacting residues. To identify optimal decoding paths, we propose a post-decoding re-ranking algorithm based on a genetic algorithm with simulated annealing and show that the new method gains an increase of near 14% in prediction accuracy over the ETB-Viterbi algorithm.