M-ZDOCK: a grid-based approach for Cn symmetric multimer docking.

Bioinformatics

Bioinformatics Program, Boston University, Boston, MA, USA.

Published: April 2005

Unlabelled: Computational protein docking is a useful technique for gaining insights into protein interactions. We have developed an algorithm M-ZDOCK 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 ZDOCK 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 computation is reduced. This program has been tested on several known multimer complexes from the Protein DataBank, 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 30-40% faster for M-ZDOCK.

Availability: M-ZDOCK is freely available to academic users at http://zlab.bu.edu/m-zdock/

Contact: zhiping@bu.edu

Supplementary Information: http://zlab.bu.edu/m-zdock.

Download full-text PDF

Source
http://dx.doi.org/10.1093/bioinformatics/bti229DOI Listing

Publication Analysis

Top Keywords

symmetric multimers
8
m-zdock
4
m-zdock grid-based
4
grid-based approach
4
approach symmetric
4
symmetric multimer
4
multimer docking
4
docking unlabelled
4
unlabelled computational
4
computational protein
4

Similar Publications

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!