Bioinformatics Advance Access published online on December 21, 2004
Bioinformatics, doi:10.1093/bioinformatics/bti229
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Computational protein docking is a useful technique for gaining insights into protein interactions. We have developed an algorithm for predicting the structure of cyclically symmetric (Cn) multimers based on the structure of an unbound (or partially bound) monomer. Using a grid-based Fast Fourier Transform approach, a space of exclusively symmetric multimers is searched for the best structure. This leads to improvements both in accuracy and running time over the alternative, which is to run a binary docking program and filter the results for near-symmetry. The accuracy is improved because fewer false positives are considered in the search, thus hits are not as easily overlooked. By searching four instead of six degrees of freedom, the required amount of computations is reduced. This program has been tested on several known multimer complexes from the Protein Data Bank, including four unbound multimers: three trimers and a pentamer. For all of these cases, M-ZDOCK was able to find at least one hit, whereas only two of the four testcases had hits when using ZDOCK and a symmetry filter. In addition, the running times are significantly (30-40%) faster for M-ZDOCK. M-ZDOCK is freely available to academic users at http://zlab.bu.edu/M-ZDOCK/.
Received October 13, 2004
Revised November 10, 2004
Accepted December 13, 2004
Article
M-ZDOCK: a superior grid-based approach for Cn symmetric multimer docking
![]()
Abstract ![]()
CiteULike
Connotea
Del.icio.us What's this?
This article has been cited by other articles:
![]() |
J. T. Huiskonen, V. Manole, and S. J. Butcher Tale of two spikes in bacteriophage PRD1 PNAS, April 17, 2007; 104(16): 6666 - 6671. [Abstract] [Full Text] [PDF] |
||||
