The Community for Technology Leaders
Green Image
Issue No. 01 - January/February (2012 vol. 9)
ISSN: 1545-5963
pp: 203-213
A. Passerini , DISI Dipt. di Ing. e Scienza dell'Inf., Univ. degli Studi di Trento, Trento, Italy
M. Lippi , DII Dipt. di Ing. dell'Inf., Univ. degli Studi di Siena, Siena, Italy
P. Frasconi , DSI Dipt. di Sist. e Inf., Univ. degli Studi di Firenze, Firenze, Italy
Prediction of binding sites from sequence can significantly help toward determining the function of uncharacterized proteins on a genomic scale. The task is highly challenging due to the enormous amount of alternative candidate configurations. Previous research has only considered this prediction problem starting from 3D information. When starting from sequence alone, only methods that predict the bonding state of selected residues are available. The sole exception consists of pattern-based approaches, which rely on very specific motifs and cannot be applied to discover truly novel sites. We develop new algorithmic ideas based on structured-output learning for determining transition-metal-binding sites coordinated by cysteines and histidines. The inference step (retrieving the best scoring output) is intractable for general output types (i.e., general graphs). However, under the assumption that no residue can coordinate more than one metal ion, we prove that metal binding has the algebraic structure of a matroid, allowing us to employ a very efficient greedy algorithm. We test our predictor in a highly stringent setting where the training set consists of protein chains belonging to SCOP folds different from the ones used for accuracy estimation. In this setting, our predictor achieves 56 percent precision and 60 percent recall in the identification of ligand-ion bonds.
Metals, Proteins, Ions, Bonding, Greedy algorithms, Bioinformatics, Three dimensional displays

A. Passerini, M. Lippi and P. Frasconi, "Predicting Metal-Binding Sites from Protein Sequence," in IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 9, no. 1, pp. 203-213, 2011.
291 ms
(Ver 3.3 (11022016))