A protein–protein docking benchmark
- 14 May 2003
- journal article
- research article
- Published by Wiley in Proteins-Structure Function and Bioinformatics
- Vol. 52 (1) , 88-91
- https://doi.org/10.1002/prot.10390
Abstract
We have developed a nonredundant benchmark for testing protein–protein docking algorithms. Currently it contains 59 test cases: 22 enzyme‐inhibitor complexes, 19 antibody‐antigen complexes, 11 other complexes, and 7 difficult test cases. Thirty‐one of the test cases, for which the unbound structures of both the receptor and ligand are available, are classified as follows: 16 enzyme‐inhibitor, 5 antibody‐antigen, 5 others, and 5 difficult. Such a centralized resource should benefit the docking community not only as a large curated test set but also as a common ground for comparing different algorithms. The benchmark is available at (http://zlab.bu.edu/∼rong/dock/benchmark.shtml). Proteins 2003;52:88–91.Keywords
This publication has 7 references indexed in Scilit:
- Docking unbound proteins using shape complementarity, desolvation, and electrostaticsProteins-Structure Function and Bioinformatics, 2002
- Protein structure alignment using a genetic algorithmProteins-Structure Function and Bioinformatics, 2000
- The Protein Data BankNucleic Acids Research, 2000
- The atomic structure of protein-protein recognition sites 1 1Edited by A. R. FershtJournal of Molecular Biology, 1999
- Gapped BLAST and PSI-BLAST: a new generation of protein database search programsNucleic Acids Research, 1997
- Computer analysis of protein-protein interactionJournal of Molecular Biology, 1978
- Hemoglobin interaction in sickle cell fibers. I: Theoretical approaches to the molecular contacts.Proceedings of the National Academy of Sciences, 1975