Rxivist logo

Improving intermolecular contact prediction through protein-protein interaction prediction using coevolutionary analysis with expectation-maximization

By Miguel Correa Marrero, Richard G.H Immink, Dick de Ridder, Aalt D.J. van Dijk

Posted 28 Jan 2018
bioRxiv DOI: 10.1101/254789 (published DOI: 10.1093/bioinformatics/bty924)

Predicting residue-residue contacts between interacting proteins is an important problem in bioinformatics. The growing wealth of sequence data can be used to infer these contacts through correlated mutation analysis on multiple sequence alignments of interacting homologs of the proteins of interest. This requires correct identification of pairs of interacting proteins for many species, in order to avoid introducing noise (i.e. non-interacting sequences) in the analysis that will decrease predictive performance. We have designed Ouroboros, a novel algorithm to reduce such noise in intermolecular contact prediction. Our method iterates between weighting proteins according to how likely they are to interact based on the correlated mutations signal, and predicting correlated mutations based on the weighted sequence alignment. We show that this approach accurately discriminates between protein interaction versus non-interaction and simultaneously improves the prediction of intermolecular contact residues compared to a naive application of correlated mutation analysis. Furthermore, the method relaxes the assumption of one-to-one interaction of previous approaches, allowing for the study of many-to-many interactions. Source code and test data are available at www.bif.wur.nl/ .

Download data

  • Downloaded 921 times
  • Download rankings, all-time:
    • Site-wide: 19,211 out of 118,129
    • In bioinformatics: 2,413 out of 9,572
  • Year to date:
    • Site-wide: 74,532 out of 118,129
  • Since beginning of last month:
    • Site-wide: 105,332 out of 118,129

Altmetric data

Downloads over time

Distribution of downloads per paper, site-wide


Sign up for the Rxivist weekly newsletter! (Click here for more details.)