Monte Carlo Search with Many CPUs: Application to 6 dim. Molecular Replacement

Masato Yoshimura, Aki Nagata, Takanori Matsuura, Youhei Kondou, Atsushi Nakagawa, Tomitake Tsukihara

Institute for Protein Research, Osaka University. Osaka, Japan

XX Congress of the International Union of Crystallography (Florence, Italy, 2005.8.23-31)

Monte Carlo search is the simple method that the solution is searched by iterating the many trials for given random parameters. By randomness, every trial is assured that the searching region is different from that of the rest. And, all the trials are completely independent, that is, it is not necessary to wait the result of the other trials at all. With this method, we are able to flexibly use the whole power of many CPUs without losing its efficiency.

It is able to use a lot of computers by a modern internet technology. If it is a calculation to which the Monte Carlo search method can apply, it is possible to achieve it comparatively easily even by an enormous calculation.

We applied this method to search the six dimensional parameters at once for the rotation and the translation of molecular replacement. An initial model was obtained for the unknown protein molecular structure:SHPS-1. It was hard to find solutions by traditional way, because the peaks of the correct solutions for rotation functions are low as about two sigma level of random noises.

Space group of the crystal is P622 and the size of the cell is long as about 100 angstrom. There are two molecules in asymmetric unit. To find the correct solutions, it took about 10 days by using at most 30 various kinds of CPUs “non-exclusively”.

Back toResearch Activity

MATSUURA Takanori (Please change the mark “%” to “@”)

Valid XHTML 1.1! Valid CSS!