A recursive connectionist approach for predicting disulfide connectivity in proteins

  • Authors:
  • Alessandro Vullo;Paolo Frasconi

  • Affiliations:
  • University of Florence, Firenze, Italy;University of Florence, Firenze, Italy

  • Venue:
  • Proceedings of the 2003 ACM symposium on Applied computing
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

We are interested in the prediction of disulfide bridges in proteins, a structural feature that conveys important information about the protein conformation and that can therefore help towards the solution of the folding problem. We assume here that the disulfide bonding state of cysteines is known and we focus on the subsequent problem of disulfide bridges pairings assignment. In this paper, disulfide connectivity is modeled by undirected graphs. A graphspace search algorithm is employed to explore alternative disulfide bridges patterns and prediction consists of selecting the 'best' graph in the search space. The core of the proposed method is a recursive neural network architecture trained to score candidate graphs. We report experiments on previously published data showing that our algorithm outperforms the known alternative methods for most proteins. Furthermore, we assess the generalization capabilities testing the model on previously unpublished data.