Skip Navigation

This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow FREE Full Text (Screen PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (31)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Fariselli, P.
Right arrow Articles by Casadio, R.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Fariselli, P.
Right arrow Articles by Casadio, R.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bioinformatics Vol. 17 no. 10 2001
Pages 957-964
© 2001 Oxford University Press

Prediction of disulfide connectivity in proteins

Piero Fariselli and Rita Casadio

CIRB Biocomputing Unit, Laboratory of Biophysics, Department of Biology, University of Bologna, via Irnerio 42, 40126 Bologna, Italy

Received on April 20, 2001 ; revised on July 12, 2001 ; accepted on July 12, 2001

Motivation: A major problem in protein structure predictionis the correct location of disulfide bridges in cysteine-rich proteins. In protein-folding prediction, the location of disulfide bridges can strongly reduce the search in the conformational space. Therefore the correct prediction of the disulfide connectivity starting from the protein residue sequencemay also help in predicting its 3D structure.

Results: In this paper we equate the problem of predicting the disulfide connectivity in proteins to a problem of finding the graph matching with the maximum weight. The graph vertices are the residues of cysteine-forming disulfide bridges, and the weight edges are contact potentials. In order to solve this problem we develop and test different residue contact potentials. The best performing one, based on the Edmonds–Gabow algorithm and Monte-Carlo simulated annealing reaches an accuracy significantly higher than that obtained with a general mean force contact potential. Significantly, in the case of proteins with four disulfide bonds in the structure, the accuracy is 17 times higher than that of a random predictor. The method presented here can be used to locate putative disulfide bridges in protein-folding.

Availability: The program is available upon request from the authors.

Contact: Casadio{at}alma.unibo.it; Piero{at}biocomp.unibo.it


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
Brief Funct Genomic ProteomicHome page
R. Singh
A review of algorithmic techniques for disulfide-bond determination
Brief Funct Genomic Proteomic, March 27, 2008; (2008) eln008v1.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
R. Rubinstein and A. Fiser
Predicting disulfide bond connectivity in proteins by correlated mutations analysis
Bioinformatics, February 15, 2008; 24(4): 498 - 504.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
J. Song, Z. Yuan, H. Tan, T. Huber, and K. Burrage
Predicting disulfide connectivity from protein sequence using multiple sequence feature vectors and secondary structure
Bioinformatics, December 1, 2007; 23(23): 3147 - 3154.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
A. Ceroni, A. Passerini, A. Vullo, and P. Frasconi
DISULFIND: a disulfide bonding state and cysteine connectivity prediction server.
Nucleic Acids Res., July 1, 2006; 34(Web Server issue): W177 - W181.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
C.-H. Tsai, B.-J. Chen, C.-h. Chan, H.-L. Liu, and C.-Y. Kao
Improving disulfide connectivity prediction with sequential distance between oxidized cysteines
Bioinformatics, December 15, 2005; 21(24): 4416 - 4419.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
F. Ferre and P. Clote
DiANNA: a web server for disulfide connectivity prediction
Nucleic Acids Res., July 1, 2005; 33(suppl_2): W230 - W232.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
F. Ferre and P. Clote
Disulfide connectivity prediction using secondary structure information and diresidue frequencies
Bioinformatics, May 15, 2005; 21(10): 2336 - 2346.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
E. Zhao, H.-L. Liu, C.-H. Tsai, H.-K. Tsai, C.-h. Chan, and C.-Y. Kao
Cysteine separations profiles on protein sequences infer disulfide connectivity
Bioinformatics, April 15, 2005; 21(8): 1415 - 1420.
[Abstract] [Full Text] [PDF]


Home page
Protein Sci.Home page
G. R.S. Hartig, T. T. Tran, and M. L. Smythe
Intramolecular disulphide bond arrangements in nonhomologous proteins
Protein Sci., February 1, 2005; 14(2): 474 - 482.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
J. Lenffer, P. Lai, W. El Mejaber, A. M. Khan, J. L. Y. Koh, P. T. J. Tan, S. H. Seah, and V. Brusic
CysView: protein classification based on cysteine pairing patterns
Nucleic Acids Res., July 1, 2004; 32(suppl_2): W350 - W355.
[Abstract] [Full Text] [PDF]


Home page
Protein Eng Des SelHome page
P. L. Martelli, P. Fariselli, L. Malaguti, and R. Casadio
Prediction of the disulfide bonding state of cysteines in proteins with hidden neural networks
Protein Eng. Des. Sel., December 1, 2002; 15(12): 951 - 953.
[Abstract] [Full Text] [PDF]


Home page
Protein Sci.Home page
P. L. Martelli, P. Fariselli, L. Malaguti, and R. Casadio
Prediction of the disulfide-bonding state of cysteines in proteins at 88% accuracy
Protein Sci., November 1, 2002; 11(11): 2735 - 2739.
[Abstract] [Full Text] [PDF]



Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.