Graph-Theoretic Techniques for Macromolecular Docking
- 17 December 1999
- journal article
- research article
- Published by American Chemical Society (ACS) in Journal of Chemical Information and Computer Sciences
- Vol. 40 (2) , 273-279
Abstract
We propose a solution to the problem of docking two macromolecules. We represent each of two proteins as a set of potential hydrogen bond donors and acceptors and use a clique-detection algorithm to find maximally complementary sets of donor/acceptor pairs. Preliminary results are presented which demonstrate the feasibility of the method.Keywords
This publication has 29 references indexed in Scilit:
- Rapid refinement of protein interfaces incorporating solvation: application to the docking problemJournal of Molecular Biology, 1998
- Three-dimensional structures of the free and the antigen-complexed Fab from monoclonal anti-lysozyme antibody D44.1Journal of Molecular Biology, 1994
- The CCP4 suite: programs for protein crystallographyActa Crystallographica Section D Structural Biology, 1994
- Structure of restriction endonuclease BamHI and its relationship to EcoRINature, 1994
- Docking by least-squares fitting of molecular surface patternsJournal of Molecular Biology, 1992
- Protein docking and complementarityJournal of Molecular Biology, 1991
- Use of techniques derived from graph theory to compare secondary structure motifs in proteinsJournal of Molecular Biology, 1990
- A geometric approach to macromolecule-ligand interactionsJournal of Molecular Biology, 1982
- The protein data bank: A computer-based archival file for macromolecular structuresJournal of Molecular Biology, 1977
- Algorithm 457: finding all cliques of an undirected graphCommunications of the ACM, 1973