Estimating probabilistic context-free grammars for proteins using contact map constraints

Abstract

Learning language of protein sequences, which captures non-local interactions between amino acids close in the spatial structure, is a long-standing bioinformatics challenge, which requires at least context-free grammars. However, complex character of protein interactions impedes unsupervised learning of context-free grammars. Using structural information to constrain the syntactic trees proved effective in learning probabilistic natural and RNA languages. In this work, we establish a framework for learning probabilistic context-free grammars for protein sequences from syntactic trees partially constrained using amino acid contacts obtained from wet experiments or computational predictions, whose reliability has substantially increased recently. Within the framework, we implement the maximum-likelihood and contrastive estimators of parameters for simple yet practical grammars. Tested on samples of protein motifs, grammars developed within the framework showed improved precision in recognition and higher fidelity to protein structures. The framework is applicable to other biomolecular languages and beyond wherever knowledge of non-local dependencies is available.

References in corpus (8)

• Scikit-learn: Machine Learning in Python
• The NumPy array: a structure for efficient numerical computation
• Direct-coupling analysis of residue co-evolution captures native contacts across many protein families
• Identification of direct residue contacts in protein-protein interaction by message passing
• Accurate De Novo Prediction of Protein Contact Map by Ultra-Deep Learning Model
• Quantification of the effect of mutations using a global probability model of natural sequence variation
• Improved contact prediction in proteins: Using pseudolikelihoods to infer Potts models
• Fast and accurate multivariate Gaussian modeling of protein families: Predicting residue contacts and protein-interaction partners