# Patent

## Title
System of binding structure for polymer molecule

## Abstract

A simulation system that increases a polymer molecule binding prediction speed on a parallel and distributed computer system is provided. The simulation system determines a decomposition width that decomposes a search region of polymer molecule by means of translational operation and rotational operation and the number of searches in the decomposed regions into which the search region is decomposed, determines the number of decomposed regions into which the search region is decomposed, determines the number of computing units to which the decomposed regions are to be allocated, allocates the decomposed regions to the respective computing units, determines search points within the decomposed regions, transmits data of the search points to a computing unit that computes the binding energy and the energy gradient vector, performs communication control that receives data associated with the binding energy and the energy gradient vector from the computing unit, and determines the local minimum value of the binding energy in the decomposed region and the minimum value in the search region, thereby making it possible to determine the convergence of the binding energy.

## Background
CLAIM OF PRIORITY
The present application claims priority from Japanese Application JP 2006-040685 filed on Feb. 17, 2006, the content of which is hereby incorporated by reference into this application.
BACKGROUND OF THE INVENTION
The present invention relates to a system that predicts the binding of polymer molecule which is applied to a drug discovery simulation system as well as mass analysis that measures the interaction between biopolymers or an analysis system of protein chip. In order to increase the simulation computing speed and the analyzing speed of the above type, a parallel and distributed environment using a parallel and distributed computer system is effective, and the present invention is useful in a single computer.
In the post-genome age, there has been developed a compound molecular structure as a drug that promotes or inhibits the vital function of polymer molecule for protein, DNA and RNA which are obtained from genome information. For example, the molecular species, the reactive group, or the skeleton structure of a compound is changed to design the compound molecular structure so as to enhance the binding strength of protein with respect to target protein. In the drug discovery simulation system, a binding energy is computed with respect to a large number of configuration structures of protein and compound. The binding structure having the minimum binding energy is searched to perform the optimum design of the compound molecule structure. If the binding structure having the minimum binding energy of protein and compound can be searched in a high speed, it is possible to reduce a development period of the compound molecular structure with respect to target protein. Also, it is possible to reduce the costs that experimentally produce the compound molecule and measures the binding strength of the compound molecule and protein.
FIGS. 19 to 21 are diagrams showing a general structural example of a parallel and distributed computer system in which drug discovery simulation is performed under the parallel and distributed environments.
FIG. 19 shows a state in which each of computing units 1903 that are units of computing is made up of a computing processor unit 1901 that executes computing, and a memory unit 1902 that stores input data required to execute the computing or output data obtained by execution of the computing. Also, the computing units 1903 each of which is a unit of the computing are bound in a grid pattern by data transfer networks 1904 and 1905 that execute data transfer between the respective computing units 1903. One of the data transfer networks is connected with a personal computer 100 for control. The personal computer 100 executes the input of data to be subjected to simulation, the distribution of computation to the computing units 1903, and the tabulation of the computation results between the respective computing units 1903 and of the respective computing units 1903. Also, the system is provided with, for example, a management unit 1906 of the parallel and distributed computer system at a node between the personal computer 100 and the network. The management unit 1906 collects information on the number of processors NPE which can be operated by the entire system, the type of processor of the connectable computing units, or the speed of the network, and supplies the information to the personal computer 100.
FIG. 20 is a diagram showing a structural example in which the computing unit is formed of a cluster of personal computers, or a cluster 2001 of workstations, and structured by a data transfer network that is connected in a ring configuration by insernets 2002 that execute data transfer between the respective machines. Similarly, the insernet 2002 of the data transfer network is connected with the personal computer 100 for control. In this example, the personal computer 100 for control is connected to the insernet 2002 of the data transfer network. In this example, similarly, there is provided a management unit 2003 of the parallel and distributed computer system.
FIG. 21 is a diagram showing a structural example of a wide-area distributed environment in which the computing unit is made up of plural grid machines 2101 each having a parallel computer 2103, a cluster of personal computers, and a cluster 2001 of work stations connected to each other on a high-speed network 2002 that executes high-speed data transfer, and the respective grid machines 2101 are connected to each other in the ring manner on a high-speed network 2102. Similarly, in this case, the personal computer 100 for control is connected to a high-speed network 2102 of the data transfer network, and a management unit 2003 of a parallel and distributed computer system is disposed.
FIG. 22 is a conceptual diagram showing an example of a transacting function of a related system that performs simulation which predicts a binding structure of polymer molecule on the parallel and distributed computer system of the above type. Reference numeral 100 corresponds to the personal computer of the parallel and distributed computer system which is described with reference to FIGS. 19 to 21. The personal computer 100 includes an input system 101 for inputting simulation data by a user, a transaction and control unit 102 for executing a transaction for distributing the computation of a binding energy to the respective computing units 104 from the inputted data, and for executing a transaction for distributing the results of the computation of the binding energy to the respective computing units to integrate the computing results, and an output device 103 for displaying the operation status of the transaction and control unit 102 or the integrated data. Reference numeral 104 denotes the respective computing units of the parallel and distributed computer system that is described with reference to FIGS. 19 to 21, performs the calculation according to information given by the personal computer 100 for control, and reports the computation results to the personal computer 100. Also, reference numeral 105 denotes the management unit of the parallel and distributed computer system which is described with reference to FIGS. 19 to 21. The personal computers 100, the computing units 104, and the management unit 105 of the parallel and distributed computer system are indicated by dashed lines, and connected by heavy lines in the sense that the personal computers 100, the computing units 104, and the management unit 105 are capable of mutually interchanging necessary data with each other. Also, the association between the transaction step of the transaction and control unit 102 and the transaction step of the computing units 104 are connected by thin solid lines.
The user inputs search regions with respect to the binding structure of protein which is obtained from genome information and polymer molecule to be subjected to simulation such as DNA or RNA, for example, protein and compound in water molecule, as well as the number of decomposed regions which decompose the search region (Step 2211). Also, the user inputs the number of operable computing units NPE that distribute the computation of the decomposed regions that decompose the search region (Step 2212). In this example, the number of operable computing units NPE can be obtained by using data that is supplied from the management unit 105 of the parallel and distributed computer system, or can be obtained by designating a number that is smaller than the data from the input system 101 through the user. The output data of the respective computing units is the minimum binding energy of the binding structure of protein in water molecule, and the compound atomic coordinate data of protein and compound in water molecule in the binding structure. The output system 103 outputs the data as image or numeric data that is readily visible by the user, and displays the data on a display system.
A description will be given of a procedure of computing the binding energy and tabulating the computation results by means of the computing units of the parallel and distributed computer system. Reference numeral 2241 is a step of determining the number of decomposed regions that are distributed to the respective computing units by the aid of the number of decomposed regions that decompose the search region, and the number of computing units NPE that share the decomposed regions. Reference numeral 2242 is a step of determining the search points within the decomposed regions at which the binding energy is computed in the decomposed regions that are allocated to the respective computing units. Reference numeral 2243 is a step of communication control, which transmits data of the respective search points that are allocated for calculating the binding energy to the respective computing units that have been determined in Step 2241 and Step 2242. Also, on the contrary, the binding energies at the respective search points which have been calculated in the respective computing units are received. Reference numeral 2244 is a step of determining the minimum value among the local minimum values of the binding energies that have been computed in the respective computing units 104 which have been received in Step 2243, and the local minimum value that has been calculated in all of the computing units. Reference numeral 2245 is a step of determining whether the iterative calculation is executed, or not, on the basis of the convergence of the local minimum value of the binding energy within the decomposed region.
In the case of executing the iterative calculation, control is returned to Step 2242. In the case of completing the iterative calculation, the minimum value of the binding energy of protein and compound in water molecule, and the atomic coordinate data with respect to the binding structure are outputted to the output system 103.
A description will be given of a computing procedure using a Monte Carlo method in Step 2242 that computes the binding energy of protein and compound in the decomposed regions that have been allocated to the respective computing units with reference to FIG. 23. FIG. 23 is a conceptual diagram showing a binding energy in a search region of compound and protein due to translational operation or rotational operation. The binding energy has the complicated configuration of peaks and troughs according to the translational and rotational search regions. In the Monte Carlo method, a new configuration structure due to the translational operation and the rotational operation is formed by using random numbers on the basis of the arrangement position of the compound and protein and the binding energy, and the binding energy is computed. When a binding energy difference of the new arrangement position with respect to an original arrangement position is ΔE, the probability P (ΔE) of transiting to a new configuration structure is obtained on the basis of Expression (1).

P(ΔE)=exp(−ΔE/kBT)  (1)

where kB is the Boltzmann coefficient, and T is an absolute temperature. Also, the number of searches until the configuration structure transits to the new configuration structure with the probability of Pth is given by Expression (2).





  
    
      
        
          F
          ⁡
          
            (
            
              Δ
              ⁢
              
                
              
              ⁢
              E
            
            )
          
        
        =
        
          
            log
            ⁡
            
              (
              
                1
                -
                
                  P
                  th
                
              
              )
            
          
          
            log
            ⁢
            
              {
              
                1
                -
                
                  P
                  ⁡
                  
                    (
                    
                      Δ
                      ⁢
                      
                        
                      
                      ⁢
                      E
                    
                    )
                  
                
              
              }
            
          
        
      
    
    
      
        (
        2
        )
      
    
  




BRIEF SUMMARY OF THE INVENTION
In the related system, the user inputs the search regions and the number of decomposed regions by which the search region is decomposed from the input system 101 with respect to protein that is obtained from the genome information and polymer molecule to be subjected to simulation such as DNA or RNA, and sets a decomposition width of the search region by the aid of the inputted number of decomposed regions. It is remarkably difficult for the user to determined the optimum decomposition width of the search region. When the decomposition width of the search region is too large, the binding energy in the search region has the configuration having a large number of peaks and troughs. As a result, the number of searches of Expression (2) which is represented by a difference of the binding energy increases. There is an issue that the number of searches is reduced without extremely increasing the decomposition width. On the other hand, when the division width of the search region is small, the number of decomposed regions increases. Since the number of searching the smaller decomposition regions depends on the number of peaks and troughs of the binding energy that is contained in the respective decomposed regions, and the difference in the binding energy, the number of searching the decomposed regions is not uniformly reduced. When the decomposition width of the search region is reduced without reason, the number of searches is increased according to the number of decomposed regions, and the decomposed regions that are large in the difference of the binding energy requires the large number of searches. Therefore, there is an issue that the number of searches is reduced without extremely decreasing the decomposition width.
It is estimated that the decomposition width that minimizes the number of searches exists in the decomposition widths of the search region, but it is impossible for the user to set the optimum decomposition width. In other words, in the related manner, the user has no other choice but to start to set the decomposition width from a decomposition width the user must think fit from the experience in using the system or the understanding of polymer molecule to be subjected to simulation, and to predict the appropriate decomposition width by the aid of the system while changing the decomposition widths by trial and error. An object of the present invention is to automatically set the decomposition width of the decomposed regions by the aid of a simulation system to increase the speed of computing the minimum value of the binding energy instead of setting the decomposition width by the user.
In order to achieve the above object, according to the present invention, there is provided a design system of a binding structure for polymer molecule that is useful in increasing the simulation speed of the binding structure of polymer molecule and the binding energy, which is applied to a drug discovery simulation system using a parallel and distributed computer system, as well as mass analysis that measures the interaction between biopolymers or an analysis system of protein chip.
The present invention is useful in a single computer as described above, but the following description will be given of a polymer molecule binding prediction simulation under a parallel and distributed environment.
In the present invention, the user is capable of implementing the polymer molecule prediction system by simply designating a search region for computing the binding energy of polymer molecules and the number of operable computing units NPE from an input system 101 of a personal computer 100 for control with respect to protein that is obtained from genome information and polymer molecule to be subjected to simulation such as DNA or RNA. To achieve the above object, a procedure of transacting the system is configured as follows.
In the personal computer 100 for control,
(1) the decomposition width that decomposes the search region of polymer molecule, and the number of searches in the decomposed regions into which the search region is decomposed are determined.
(2) the number of decomposed regions by which the search region is decomposed is determined.
(3) the number of computing units to which the decomposed regions are to be allocated is determined.
(4) the decomposed regions are allocated to the respective computing units.
(5) the search points within the decomposed regions are determined.
(6) a communication is controlled in which the data of the search point is transmitted to the computing units on a parallel and distributed computer system that computes the binding energy and an energy gradient vector, and data of the binding energy and the energy gradient vector is received from the computing units.
(7) the local minimum values of the binding energies in the decomposed regions, and the minimum value in the search region are determined.
(8) the convergence of the binding energy is determined.
Also, in the respective computing units of the parallel and distributed computer system,
(9) the binding energy and the energy gradient vector at the search point within the decomposed regions are computed from the data at the search point which is transmitted according to a transacting procedure 6 of the personal computer 100.
(10) the computation results are transmitted to the personal computer according to the transacting procedure 6 of the personal computer 100.
According to the present invention, it is necessary for the user to input the search region and the number of operable computing units, but it is unnecessary to set the decomposition width of the search region. The decomposition width of the search region can be automatically set by the design system of a binding structure for polymer molecule, and the number of decompositions of the search region is optimized with the result that the computing speed of the minimum value of the binding energy can be increased.
These and other objects and many of the attendant advantages of the invention will be readily appreciated as the same becomes better understood by reference to the following detailed description when considered in connection with the accompanying drawings.



BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWING
FIG. 1 is a conceptual diagram showing a basic structure of a design system of a binding structure for polymer molecule under a parallel and distributed environment according to the present invention;
FIG. 2 is a conceptual diagram showing the configuration of a design system of a binding structure for polymer molecule according to a first embodiment of the present invention, and a diagram for explaining a specific transaction of a step of computing the minimum of a binding energy of protein by the aid of a translational operation of atomic coordinates of compound;
FIG. 3 is a diagram showing an example in which the search region using the translational operation is inputted with the coordinate values of the center position of the search region to display a spatial region which is a search region having a cubic configuration;
FIG. 4 is a diagram showing a change in decomposed transactional regions that are averagely allocated to the respective computing units with respect to the decomposition width, a change in the number of line searches with respect to the decomposition width, a change in the number of line searches of the local minimum value of the binding energy, and an optimum decomposition width with the axis of abscissa indicative of the decomposition width of the translational search region and the axis of ordinate indicative of the number of line searches or the number of decomposed regions;
FIG. 5 is a diagram showing an example of a binding energy in a two-dimensional space of the decomposed translational search region;
FIGS. 6A and 6B are diagrams for explaining an example of determining the number of decomposed translational regions that minimizes the number of line searches on the computing unit and the decomposed translational regions in the case where computing unit groups that are connected on the network have the same transaction performance and the different transaction performance, respectively;
FIG. 7 is a diagram showing an example of the line search in an energy gradient direction in a decomposed search region of the two-dimensional space in the translational search region shown in FIG. 5;
FIG. 8 is a diagram for explaining the transmission of the search point to the computing unit;
FIG. 9 is a diagram showing a change in decomposed transactional regions that are averagely allocated to the respective computing units with respect to the decomposition width, a change in the number of line searches with respect to the decomposition width, a change in the number of line searches of the local minimum value of the binding energy, and an optimum decomposition width with the axis of abscissa indicative of the decomposition width of the translational search region and the axis of ordinate indicative of the number of line searches or the number of decomposed regions;
FIG. 10 is a diagram for explaining an example of determining the number of decomposed translational regions that minimize the number of line searches on the computing units of computing unit groups that are connected to each other on the network, and the decomposed translational regions;
FIG. 11 is a diagram showing the number of line searches that minimize the local minimum value of the binding energy;
FIG. 12 is a conceptual diagram showing the configuration of a design system of a binding structure for polymer molecule according to a second embodiment of the present invention, and a diagram for explaining a specific transaction of a step of computing the minimum of a binding energy of protein by the aid of a rotational operation of compound;
FIGS. 13A, 13B, and 13C are diagrams showing an example of search regions that perform the rotational operation of compound which is indicated by Euler's angles (F, θ, ψ);
FIG. 14 is a diagram showing a change in decomposed rotational regions (hereinafter referred to as “decomposed rotational regions”) that are averagely allocated to the respective computing units with respect to the decomposition angle width, a change in the number of line searches with respect to the decomposition angle width, a change in the number of line searches of the local minimum value of the binding energy with respect to the respective decomposed rotational regions with respect to the decomposed angle width, and an optimum decomposition width with the axis of abscissa indicative of the decomposition angle width of the rotational search region and the axis of ordinate indicative of the number of line searches or the number of decomposed regions;
FIG. 15 is a diagram showing an example in which the decomposed rotational regions are allocated to the computing units of the computing unit groups that are connected to each other on the network;
FIG. 16 is a diagram showing a change in decomposed rotational regions (hereinafter referred to as “decomposed rotational regions”) that are averagely allocated to the respective computing units with respect to the decomposition angle width, a change in the number of line searches with respect to the decomposition angle width, a change in the number of line searches of the local minimum value of the binding energy with respect to the respective decomposed rotational regions with respect to the decomposed angle width, and an optimum decomposition width with the axis of abscissa indicative of the decomposition angle width of the translational search region and the axis of ordinate indicative of the number of line searches or the number of decomposed regions;
FIG. 17 is a diagram showing an example in which the decomposed rotational regions that minimize the number of line searches are allocated to the computing units of the computing unit groups that are connected to each other on the network;
FIG. 18 is a diagram showing the number of line searches that obtains the local minimum value of the binding energy with respect to the decomposition width of the decomposed rotational regions;
FIG. 19 is a diagram showing an example in which a data transfer network is of a grid configuration as one general structural example of the parallel and distributed computer system where drug discovery simulation is performed under a parallel and distributed environment;
FIG. 20 is a diagram showing an example in which the data transfer networks are connected in a ring configuration;
FIG. 21 is a diagram showing an example in which grid machines are connected to each other in a ring configuration on the data transfer network;
FIG. 22 is a diagram showing a concept that pays attention to an example of a transacting function of a related system that performs simulation which predicts a binding structure of polymer molecule on the parallel and distributed computer system; and
FIG. 23 is a diagram showing an example of the minimum search of a binding energy using a Monte Carlo method in a search region of translational operation and rotational operation.



DETAILED DESCRIPTION OF THE INVENTION
Now, a description will be given in more detail of preferred embodiments of the present invention with reference to the accompanying drawings.
In all of figures for explaining the embodiments, parts having the same functions are indicated by identical references, and their duplex description may be omitted.
(Basic Configuration of System)
FIGS. 19 to 21 show an example in which a parallel and distributed environment is structured by parallel computers and PC clusters, and the parallel computers and the PC clusters are controlled by a personal computer 100 as a general structural example of a parallel and distributed computer system. In a design system of a binding structure for polymer molecule according to the present invention, the configuration of a parallel and distributed computer system can be identical with the system configuration described above.
FIG. 1 is a conceptual diagram showing a basic structure of a design system of a binding structure for polymer molecule according to the present invention. Referring to FIG. 1, reference numeral 100 denotes a personal computer for control of the design system of a binding structure for polymer molecule according to the present invention, which corresponds to the personal computer of the parallel and distributed computer system which is described with reference to FIGS. 19 to 21. The design system of a binding structure for polymer molecule includes an input system 101 for inputting data of simulation, a transaction and control unit 102 for executing a transaction for distributing the computation of a binding energy to the respective computing units 104 from inputted data, and for executing a transaction for integrating the results of distributing the computation to the respective computing units and computing the binding energy, and an output system 103 for displaying the operating status of the transaction and control unit 102 or the integrated data. In this example, the personal computer 100 includes a memory system such as a disk or a memory for holding necessary program or data, or a graphical visualization system that generates a display image for an interface with the user. However, for convenience, the memory system and the graphical visualization system is indicated in blocks of the input system 101 and the output system 103. Reference numeral 104 denotes the respective computing units of the parallel and distributed computer system which is described with reference to FIGS. 19 to 21, and executes computation according to information obtained from the personal computer 100 for control, and reports the computation results to the personal computer 100. Also, reference numeral 105 denotes a management unit of the parallel and distributed computer system described with reference to FIGS. 19 to 21. The personal computer 100, the computing units 104, and the management unit 105 of the parallel and distributed computer system are indicated by dashed lines, and connected by heavy lines in the sense that the personal computers 100, the computing units 104, and the management unit 105 are capable of mutually interchanging necessary data with each other. Also, the association between the transaction step of the transaction and control unit 102 and the transaction step of the computing units 104 are connected to each other by thin solid lines.
The user inputs, from the input system 101, search regions with respect to the binding structure of protein which is obtained from genome information and polymer molecule to be subjected to simulation such as DNA or RNA, for example, protein and compound in water molecule, as well as the number of operable computing units in the parallel computers and the PC clusters under the parallel and distributed environment.
In the transaction and control unit 102, the data to be subjected to simulation which is introduced through the input system 101 is inputted, and held in the memory system. Also, data for calculation of the binding energy is distributed to the computing units 104 through the above-described procedures (1) to (6). The computation results of the binding energy which have been performed through the above-described procedures (9) and (10) are integrated through the above procedures (6) to (8) on the basis of the data that has been distributed by the respective computing units 104, and then displayed on the output system 103.
Output data output the minimum binding energy with respect to the binding structure of protein and compound in water molecule, and atomic coordinate data of protein, compound, and water molecule in the binding structure.
Also, one of the computing units 104 acts as the transaction and control unit 102, and is capable of distributing the computation of the binding energy to the respective computing units 104, and integrating the computation results of the binding energy which has been performed by the respective computing units.
Hereinafter, a description will be given of a transaction procedure of distributing the computation of the binding energy to the respective computing units in the transaction and control unit 102 of the personal computer 100, and integrating the computation results. Reference numeral 1021 is a step of determining the decomposition width that decomposes the search region, and the number of searches for computing the binding energy in a search region that expresses a range where the operation of changing the atomic coordinates of compound is performed. Reference numeral 1022 is a step of determining the number of the decomposed search region (hereinafter referred to as “decomposed regions”) and the range of the decomposed regions. Reference numeral 1023 is a step of determining the number of computing units in the parallel and distributed environment where the decomposed regions are allocated, by using the number of decomposed regions. Reference numeral 1024 is a step of determining the number of decomposed regions that are allocated to the respective computing units and the decomposed regions by using the number of decomposed regions, the number of searches, and the number of computing units in the parallel and distributed environment for allocation of the decomposed regions. Reference numeral 1025 is a step of determining search points within the decomposed regions for computation of the binding energy in the decomposed regions that are allocated to the respective computing units. Reference numeral 1026 is a step of communication control, which transmits data of the respective search points that are allocated for computation of the binding energy to the respective computing units which are determined in Steps 1024 and 1025. On the contrary, the binding energies and the energy gradient vectors at the respective search points which have been calculated in the respective computing units are received. Reference numeral 1027 is a step of determining the minimum value from the local minimum values of the binding energies that have been received in Step 1026 and computed by the respective computing units and the local minimum value that has been computed by all of the computing units. Reference numeral 1028 is a step of determining whether the iterative calculation is executed, or not, on the basis of the convergence of the local minimum value of the binding energy within the decomposed region. In the determination, since the number of searches is known in advance as will be understood from embodiments to be described later, the iterative calculation may not be performed when the number of searches exceeds the known value.
In the case of executing the iterative calculation, control is returned to Step 1025. In the case of completing the repetitive calculation, the minimum value of the binding energy of protein and compound in water molecule and the atomic coordinate data with respect to the binding structure are transmitted to the output system 103.
In Step 1029, data of the search points are received from Step 1026, and the operation of changing the atomic coordinates of compound with respect to the designated search points is executed in the respective computing units 104 of the parallel and distributed computer system. The atomic coordinates of protein, the atomic coordinates of water molecule, and the atomic coordinates of compound which have been changed are inputted, and the binding energy of protein and compound and the energy gradient vector, that is, a force that is exerted on compound and a torque that is exerted on compound are computed and outputted. The binding energy, the force that is exerted on compound, and the torque that is exerted on compound which have been outputted are transmitted to the personal computer 100 in Step 1026 of communication control.
First Embodiment
FIG. 2 is a conceptual diagram showing the configuration of a design system of a binding structure for polymer molecule according to a first embodiment of the present invention, and a diagram for explaining a specific transaction of a step of computing the minimum value of a binding energy of protein by the aid of a translational operation of atomic coordinates of compound. The entire configuration is identical with that shown in FIG. 1, but the transaction and control unit 102 and the respective transaction steps 1021 to 1029 shown in FIG. 1 are changed to the transaction and control unit 112 and the respective transaction steps 1121 to 1129 according to the changes of the transaction contents.
The user inputs a search region (hereinafter referred to as “translational search region”) that expresses a range where the translational operation of the atomic coordinates of compound is performed from the input system 101 in order to search the minimum value of the binding energy of protein that is obtained from genome information and polymer molecule to be subjected to simulation such as DNA and RNA, for example, protein and compound in water molecule. As shown in an example of FIG. 3, the coordinate values of the center position 302 of the search region in protein 301, a spatial region width W303 that is a search region having a cubic configuration, and the number of available computing units Npa of the parallel computers or the PC clusters in the parallel and distributed environment are inputted. The number of available computing units Npa can be inputted by the user, or data that is supplied from the management unit 105 of the parallel and distributed computer system may be applied. In this example, a small cubic configuration ΔW indicated in the spatial region width W303 schematically shows a cube having a decomposition width ΔW of the translational search region which is determined according to a manner that will be described later.
In Step 1121, the decomposition width that minimizes the number of linearly searching the local minimum value of the binding energy and the number of line searches are determined in the translational search region that performs the translational operation of compound.
FIG. 4 is a diagram showing a change in decomposed transactional regions (hereinafter referred to as “decomposed translational region) that are averagely allocated to the respective computing units with respect to the decomposition width, a change in the number of line searches with respect to the decomposition width, a change in the number of line searches of the local minimum value of the binding energy, and an optimum decomposition width with the axis of abscissa indicative of the decomposition width of the translational search region and the axis of ordinate indicative of the number of line searches or the number of decomposed regions (the number of decomposed search regions). Reference numeral 401 denotes a line that represents a change in the number of decomposed translational regions that are allocated to the respective computing units according to the decomposition width, reference numeral 402 denotes a line that represents a change of the number of line searches according to the decomposition width, and reference numeral 403 denotes a line that represents a change in the number of line searches of the local minimum value of the binding energy on the respective computing units according to the decomposition width. When the decomposition width of the translational search region is ΔW, the number of decomposed translational regions that are averagely allocated to the respective computing units is (W/ΔW)3/Npa. Also, in the respective decomposed translational regions, the binding energy is calculated by the line search in the energy gradient vector direction, that is, a direction of the force that is exerted on compound, the number of line searches until the local minimum value of the binding energy is found is given by F(X) represented in Expression (3). In this expression, X=ΔW/Rt.
FIG. 5 is a diagram showing an example of the binding energy in a two-dimensional space of the decomposed translational search region. When Rt is within a distance of the radius Rt from a coordinate position 501 at which the minimum value of the binding energy exists in the decomposed translational region, the binding energy is an energy region 502 of a quadratic function with respect to a distance, and when Rt is equal to or higher than the radius Rt, the binding energy is a random energy region 503. The size of the radius Rt can be prepared as the system, but can be inputted by the user.
A line 403 that represents a change in the number of line searches of the local minimum value of the binding energy on the respective computing units with respect to the decomposition width ΔW of the translational search region is represented by the product (W/ΔW)3/Npa×F (ΔW/Rt). Therefore, when the decomposition width ΔWopt where (W/ΔW)3/Npa×F (ΔW/Rt) is the minimum is selected, the decomposition width ΔWopt of the translational search region W as well as the binding energies on the respective computing units are computed, thereby making it possible to determine NIt=F (ΔWopt/Rt) where the number of line searches of the local minimum value of the binding energy is minimum.
Hereinafter, a description will be given of how to find the number of line searches F(X) for finding the local minimum value of the binding energy represented by Expression (3) with respect to X of a certain value with the probability Pth.




  
    
      
        
          F
          ⁡
          
            (
            X
            )
          
        
        =
        
          
            log
            ⁡
            
              (
              
                1
                -
                
                  P
                  th
                
              
              )
            
          
          
            log
            ⁢
            
              {
              
                1
                -
                
                  
                    P
                    1
                  
                  ⁡
                  
                    (
                    X
                    )
                  
                
                -
                
                  
                    P
                    2
                  
                  ⁡
                  
                    (
                    X
                    )
                  
                
              
              }
            
          
        
      
    
    
      
        (
        3
        )
      
    
  




where P1(X) is given by Expression (4).





  
    
      
        
          
            
              P
              1
            
            ⁡
            
              (
              X
              )
            
          
          =
          
            
              1
              
                2
                ⁢
                π
              
            
            ⁢
            
              
                ∫
                
                  θ
                  3
                
                
                  π
                  2
                
              
              ⁢
              
                d
                θ
              
            
          
        
        ⁢
        
          

        
        ⁢
        
          
            cos
            
              -
              1
            
          
          (
          
            
              
                
                  x
                  
                    α
                    ⁢
                    
                      
                    
                    ⁢
                    1
                  
                
                ⁢
                
                  x
                  
                    α
                    ⁢
                    
                      
                    
                    ⁢
                    2
                  
                
              
              +
              
                
                  y
                  
                    α
                    ⁢
                    
                      
                    
                    ⁢
                    1
                  
                
                ⁢
                
                  y
                  
                    α
                    ⁢
                    
                      
                    
                    ⁢
                    2
                  
                
              
              +
              
                
                  z
                  
                    α
                    ⁢
                    
                      
                    
                    ⁢
                    1
                  
                
                ⁢
                
                  z
                  
                    α
                    ⁢
                    
                      
                    
                    ⁢
                    2
                  
                
              
            
            
              
                
                  
                    x
                    
                      α
                      ⁢
                      
                        
                      
                      ⁢
                      1
                    
                    2
                  
                  +
                  
                    y
                    
                      α
                      ⁢
                      
                        
                      
                      ⁢
                      1
                    
                    2
                  
                  +
                  
                    z
                    
                      α
                      ⁢
                      
                        
                      
                      ⁢
                      1
                    
                    2
                  
                
              
              ⁢
              
                
                  
                    x
                    
                      α
                      ⁢
                      
                        
                      
                      ⁢
                      2
                    
                    2
                  
                  +
                  
                    y
                    
                      α
                      ⁢
                      
                        
                      
                      ⁢
                      2
                    
                    2
                  
                  +
                  
                    z
                    
                      α
                      ⁢
                      
                        
                      
                      ⁢
                      2
                    
                    2
                  
                
              
            
          
          )
        
      
    
    
      
        (
        4
        )
      
    
  




where Xai, Yai, and Zai (i=1, 2) are given by Expression (5) and θ3 is given by Expression (6).





  
    
      
        
          
            
              
                
                  
                    
                      
                        x
                        
                          α
                          ⁢
                          
                            
                          
                          ⁢
                          i
                        
                      
                      =
                      
                        
                          
                            
                              α
                              i
                            
                            ⁡
                            
                              (
                              
                                θ
                                ,
                                X
                              
                              )
                            
                          
                          ⁢
                          
                            (
                            
                              
                                x
                                3
                              
                              -
                              
                                x
                                i
                              
                            
                            )
                          
                        
                        +
                        
                          x
                          3
                        
                      
                    
                  
                
                
                  
                    
                      
                        y
                        
                          α
                          ⁢
                          
                            
                          
                          ⁢
                          i
                        
                      
                      =
                      
                        
                          
                            
                              α
                              i
                            
                            ⁡
                            
                              (
                              
                                θ
                                ,
                                X
                              
                              )
                            
                          
                          ⁢
                          
                            (
                            
                              
                                y
                                3
                              
                              -
                              
                                y
                                i
                              
                            
                            )
                          
                        
                        +
                        
                          y
                          3
                        
                      
                    
                  
                
              
            
          
          
            
              
                
                  z
                  
                    α
                    ⁢
                    
                      
                    
                    ⁢
                    i
                  
                
                =
                
                  
                    
                      
                        α
                        i
                      
                      ⁡
                      
                        (
                        
                          θ
                          ,
                          X
                        
                        )
                      
                    
                    ⁢
                    
                      (
                      
                        
                          z
                          3
                        
                        -
                        
                          z
                          i
                        
                      
                      )
                    
                  
                  +
                  
                    z
                    3
                  
                
              
            
          
        
        }
      
    
    
      
        (
        5
        )
      
    
  
  
    
      
        
          θ
          3
        
        =
        
          
            cos
            
              -
              1
            
          
          (
          
            
              Z
              3
            
            
              
                
                  x
                  3
                  2
                
                +
                
                  y
                  3
                  2
                
                +
                
                  z
                  3
                  2
                
              
            
          
          )
        
      
    
    
      
        (
        6
        )
      
    
  




where ai(θ,X) is given by Expression (7), Expression (8), Expression (9), and Expression (10).





  
    
      
        
          
            α
            i
          
          ⁡
          
            (
            
              θ
              ,
              X
            
            )
          
        
        =
        
          
            
              -
              
                b
                i
              
            
            ±
            
              
                
                  b
                  i
                  2
                
                -
                
                  
                    a
                    i
                  
                  ⁢
                  
                    c
                    i
                  
                
              
            
          
          
            a
            i
          
        
      
    
    
      
        (
        7
        )
      
    
  
  
    
      
        
          a
          i
        
        =
        
          
            
              {
              
                
                  
                    (
                    
                      
                        x
                        3
                      
                      -
                      
                        x
                        i
                      
                    
                    )
                  
                  2
                
                +
                
                  
                    (
                    
                      
                        y
                        3
                      
                      -
                      
                        y
                        i
                      
                    
                    )
                  
                  2
                
                +
                
                  
                    (
                    
                      
                        z
                        3
                      
                      -
                      
                        z
                        i
                      
                    
                    )
                  
                  2
                
              
              }
            
            ⁢
            
              cos
              2
            
            ⁢
            θ
          
          -
          
            
              (
              
                
                  z
                  3
                
                -
                
                  z
                  i
                
              
              )
            
            2
          
        
      
    
    
      
        (
        8
        )
      
    
  
  
    
      
        
          b
          i
        
        =
        
          
            
              {
              
                
                  
                    x
                    3
                  
                  ⁡
                  
                    (
                    
                      
                        x
                        3
                      
                      -
                      
                        x
                        i
                      
                    
                    )
                  
                
                +
                
                  (
                  
                    
                      y
                      3
                    
                    -
                    
                      y
                      i
                    
                  
                  )
                
                +
                
                  (
                  
                    
                      z
                      3
                    
                    -
                    
                      z
                      i
                    
                  
                  )
                
              
              }
            
            ⁢
            
              cos
              2
            
            ⁢
            θ
          
          -
          
            
              z
              3
            
            ⁡
            
              (
              
                
                  z
                  3
                
                -
                
                  z
                  i
                
              
              )
            
          
        
      
    
    
      
        (
        9
        )
      
    
  
  
    
      
        
          c
          i
        
        =
        
          
            
              {
              
                
                  x
                  3
                  2
                
                +
                
                  y
                  3
                  2
                
                +
                
                  z
                  3
                  2
                
              
              }
            
            ⁢
            
              cos
              2
            
            ⁢
            θ
          
          -
          
            z
            3
            2
          
        
      
    
    
      
        (
        10
        )
      
    
  




Also, (x1, y1, z1), (x2, y2, z2), and (X3, Y3, Z3) are given by Expression (11), Expression (12), and Expression (13).





  
    
      
        
          
        
        ⁢
        
          
            (
            
              
                x
                1
              
              ,
              
                y
                1
              
              ,
              
                z
                1
              
            
            )
          
          =
          
            (
            
              
                
                  
                    
                      
                        3
                        ⁢
                        
                          X
                          2
                        
                      
                      -
                      
                        2
                        ⁢
                        X
                      
                      +
                      1
                    
                    ,
                  
                
                ⁢
                0
              
              ,
              0
            
            )
          
        
      
    
    
      
        (
        11
        )
      
    
  
  
    
      
        
          
        
        ⁢
        
          
            (
            
              
                x
                2
              
              ,
              
                y
                2
              
              ,
              
                z
                2
              
            
            )
          
          =
          
            (
            
              
                
                  
                    3
                    ⁢
                    
                      X
                      2
                    
                  
                  -
                  
                    2
                    ⁢
                    X
                  
                
                
                  
                    
                      3
                      ⁢
                      
                        X
                        2
                      
                    
                    -
                    
                      2
                      ⁢
                      X
                    
                    +
                    1
                  
                
              
              ,
              
                
                  
                    
                      6
                      ⁢
                      
                        X
                        2
                      
                    
                    -
                    
                      4
                      ⁢
                      X
                    
                    +
                    1
                  
                  
                    
                      3
                      ⁢
                      
                        X
                        2
                      
                    
                    -
                    
                      2
                      ⁢
                      X
                    
                    +
                    1
                  
                
              
              ,
              0
            
            )
          
        
      
    
    
      
        (
        12
        )
      
    
  
  
    
      
        
          (
          
            
              x
              3
            
            ,
            
              y
              3
            
            ,
            
              z
              3
            
          
          )
        
        =
        
          (
          
            
              
                
                  3
                  ⁢
                  
                    X
                    2
                  
                
                -
                
                  2
                  ⁢
                  X
                
              
              
                
                  
                    3
                    ⁢
                    
                      X
                      2
                    
                  
                  -
                  
                    2
                    ⁢
                    X
                  
                  +
                  1
                
              
            
            ,
            
              
                
                  3
                  ⁢
                  
                    X
                    2
                  
                
                -
                
                  2
                  ⁢
                  X
                
              
              
                
                  
                    
                      6
                      ⁢
                      
                        X
                        2
                      
                    
                    -
                    
                      4
                      ⁢
                      X
                    
                    +
                    1
                  
                
                ⁢
                
                  
                    
                      3
                      ⁢
                      
                        X
                        2
                      
                    
                    -
                    
                      2
                      ⁢
                      X
                    
                    +
                    1
                  
                
              
            
            ,
            
              
                
                  
                    9
                    ⁢
                    
                      X
                      2
                    
                  
                  -
                  
                    6
                    ⁢
                    X
                  
                  +
                  1
                
                
                  
                    6
                    ⁢
                    
                      X
                      2
                    
                  
                  -
                  
                    4
                    ⁢
                    X
                  
                  +
                  1
                
              
            
          
          )
        
      
    
    
      
        (
        13
        )
      
    
  




On the other hand, P2(x) is given by Expression (14).





  
    
      
        
          
            P
            2
          
          ⁡
          
            (
            X
            )
          
        
        =
        
          
            3
            
              2
              ⁢
              π
            
          
          ⁢
          
            
              ∫
              
                θ
                1
              
              
                θ
                2
              
            
            ⁢
            
              2
              ⁢
              
                
                  tan
                  
                    -
                    1
                  
                
                ⁡
                
                  (
                  
                    
                      
                        1
                        -
                        
                          2
                          ⁢
                          
                            
                              B
                              ⁡
                              
                                (
                                
                                  θ
                                  ,
                                  X
                                
                                )
                              
                            
                            2
                          
                        
                      
                    
                    
                      
                        
                          3
                          ⁢
                          
                            X
                            2
                          
                        
                        -
                        
                          4
                          ⁢
                          
                            β
                            ⁡
                            
                              (
                              
                                θ
                                ,
                                X
                              
                              )
                            
                          
                          ⁢
                          X
                        
                        +
                        
                          2
                          ⁢
                          
                            
                              β
                              ⁡
                              
                                (
                                
                                  θ
                                  ,
                                  X
                                
                                )
                              
                            
                            2
                          
                        
                      
                    
                  
                  )
                
              
            
          
        
      
    
    
      
        (
        14
        )
      
    
  




where β(θ, x) is given by Expression (15), Expression (16), Expression (17), and Expression (18).





  
    
      
        
          β
          ⁡
          
            (
            
              θ
              ,
              X
            
            )
          
        
        =
        
          
            
              -
              b
            
            ±
            
              
                
                  b
                  2
                
                -
                
                  a
                  ⁢
                  
                    
                  
                  ⁢
                  c
                
              
            
          
          a
        
      
    
    
      
        (
        15
        )
      
    
  
  
    
      
        a
        =
        
          2
          -
          
            2
            ⁢
            
              cos
              2
            
            ⁢
            θ
          
        
      
    
    
      
        (
        16
        )
      
    
  
  
    
      
        b
        =
        
          
            -
            X
          
          ⁢
          
            {
            
              2
              -
              
                2
                ⁢
                
                  cos
                  2
                
                ⁢
                θ
              
            
            }
          
        
      
    
    
      
        (
        17
        )
      
    
  
  
    
      
        c
        =
        
          
            X
            2
          
          ⁢
          
            {
            
              2
              -
              
                3
                ⁢
                
                  cos
                  2
                
                ⁢
                θ
              
            
            }
          
        
      
    
    
      
        (
        18
        )
      
    
  




where θ1 and θ2 are given by Expression (19) and Expression (20).





  
    
      
        
          cos
          ⁢
          
            
          
          ⁢
          
            θ
            1
          
        
        =
        
          
            
              
                2
                ⁢
                X
              
            
            -
            
              1
              
                2
              
            
          
          
            
              
                3
                ⁢
                
                  X
                  2
                
              
              -
              
                2
                ⁢
                X
              
              +
              
                1
                2
              
            
          
        
      
    
    
      
        (
        19
        )
      
    
  
  
    
      
        
          cos
          ⁢
          
            
          
          ⁢
          
            θ
            2
          
        
        =
        
          
            
              
                2
                ⁢
                X
              
            
            -
            1
          
          
            
              
                3
                ⁢
                
                  X
                  2
                
              
              -
              
                2
                ⁢
                
                  2
                
                ⁢
                X
              
              +
              1
            
          
        
      
    
    
      
        (
        20
        )
      
    
  




In Step 1122, the number of decomposition of the translational search region and a range of the decomposed translational region are determined by the aid of the decomposition width ΔWopt of the translational search region W. The number of translational regions by which the translational search region W is decomposed is NW=(W/ΔWopt)3. When the translational coordinates within the decomposed translational region are (x, y, z), 0=x=ΔWopt, 0=y=ΔWopt, and 0=z=ΔWopt are set as the decomposed translational region W1, 0=x=ΔWopt, 0=y=ΔWopt, and Wopt=z=2ΔWopt are set as the decomposed translational region W2, . . . , and (W−ΔWopt)=x=W, (W−ΔWopt)=y=W, and (W−ΔWopt)=z=W are set as the decomposed translational region WNw.
In general, the decomposed translational region Wn is represented by (nx−1)ΔWopt=x=nxΔWopt, (ny−1)ΔWopt=y=nyΔWopt, and (nz−1)ΔWopt=z=nzΔWopt, where n=1, 2, . . . , Nw, nx, ny, nz=1, 2, . . . , W/ΔWopt.
As described above, the number of decomposed translational regions Nw, as well as the range of the decomposed translational regions W1, W2, . . . , Wn, . . . , WNw can be determined.
In Step 1123, the number of computing units in the parallel and distributed environment for allocation of the decomposed translational regions by using the number of decomposed translational regions Nw. In the case where the number of decomposed translational regions Nw is larger than the number of available computing units Npa, the number of computing units Np to which the decomposed translational regions are allocated is Npa. On the other hand, in the case where the number of decomposed translational regions Nw is smaller than the number of available computing units Npa, the number of computing units Np to which the decomposed translational regions are allocated is Nw. In this way, the number of computing units Np in the parallel and distributed environment for allocation of the decomposed translational regions can be determined.
In Step 1124, the number of decomposed translational regions that are allocated to the respective computing units and the decomposed translational regions are determined by using the number of decomposed translational regions Nw the number of line searches NIt as well as the number of computing units Np in the parallel and distributed environment for allocation of the decomposed translational regions. Since the number of line searches with respect to the respective decomposed translational regions is NIt, the number of decomposed translational regions that are allocated to the respective computing units can be substantially equalized, and the number Ndi of allocated decomposed translational regions is [Nw/Np] or [Nw/Np]−1. In this expression, a value obtained in the form of [**] is rounded out to the whole number, and Ndt decomposed translational regions that are arbitrarily selected from the decomposed translational regions W1, W2, . . . , WNw are allocated to each of the Np computing units under the parallel and distributed environment.
FIG. 6A shows an appearance in which the decomposed translational regions W1, W2, . . . , WNdt are allocated to the computing unit P1 of the computing units P1, P2, . . . , PNP in the computer unit group 203 that is connected on the network 204, the decomposed translational regions WNd1+1, WNdt+2, . . . , W2Ndt are allocated to the computing unit P2, . . . , and the decomposed translational regions WNp(Ndt−1)+1, WNp(Ndt−1)+2, . . . , WNpNdt (=WNw) are allocated to the computing unit PNp. In general, the range of the decomposed translational region Wn that is allocated to the computing unit Pm is (nx−1)ΔWopt=x=nxΔWopt, (ny−1)ΔWopt=y=nyΔWopt, and (nz−1)ΔWopt=z=nzΔWopt, where m=1, 2, . . . , Np, n=1, 2, . . . , and Nw, nx, ny, nz=1, 2, . . . , W/ΔWopt.
Also, a description will be given of an example in which the number of decomposed translating regions that are allocated to the respective computing units, and the decomposed translational regions are determined in the case where the transaction performance of the computing units in the parallel and distributed computer system is different. In the parallel computers and the PC clusters under the parallel and distributed environment, the transaction performances TP1, TP2, . . . , TPN1 of the available computing units, and the number of computing units Npa,1, Npa,2, . . . , Npa,N1 are inputted from the input system 101, or applied with data that is obtained from the management unit 105 of the parallel and distributed computer system. In this example, N1 is the type of available computing units.
In Step 1121 where the decomposition width that minimizes the number of line searches of the local minimum value of the binding energy, and the number of line searches are determined, SNpa,i×{Tpi/TPmin} (i=1, 2, . . . , N1) is applied instead of the above-mentioned number of available computing units Npa. In this case, a value obtained in the form of [**] is rounded out to the whole number, and TPmin is the minimum transaction performance in the computing unit as a standard for conversion to the same transaction performance.
As described above, the number of decomposed translational regions Nw is determined in Step 1122 with respect to the decomposition width ΔWopi and the number of line searches NIt which are determined by converting the number Npa of available computing units to the equivalent number of computing units. Then, the number of computing units Np to which the decomposed translational regions are to be allocated is determined in Step 1123. In Step 1124, since the number of line searches with respect to the respective decomposed translational regions is NIt, it is possible that the number of decomposed translational regions that are allocated to the respective computing units is substantially equalized.
The number of allocated decomposed translational regions Ndt, i=[Nw/Np]×Npa,i×{TPi/TPmin}(i=1, 2, . . . , N1) is obtained by using the transaction performance of the respective computing units. Ndi,i decomposed translational regions that are arbitrarily selected from the decomposed translational regions W1, W2, . . . , WNw are allocated to each of the Ni computing units in the parallel and distributed environment.
FIG. 6B shows an appearance in which the decomposed translational regions W1, W2, . . . , WNdt,1 are allocated to the computing unit P1 of the computing units P1, P2, . . . , PNP in the computing unit group 203 that is connected on the network 204, the decomposed translational regions W(Ndt,1)+1, W(Ndt,1)+2, . . . , W(Ndt,1)+Ndt,2 are allocated to the computing unit P2, . . . , and the decomposed translational regions W(Ndt,1+, . . . ,+Ndt,N1−1)+1, W(Ndt,1+, . . . +Ndt, N1−1)+2, . . . , W(Ndt,1+, . . . , +Ndt, N1−1)+Ndt,N1 (=WNw) are allocated to the computing unit PN1.
In Step 1125, the search point within the decomposed translational region where the binding energy is to be computed is determined in the decomposed translational regions Wn that are allocated to the computing units.
FIG. 7 is a diagram showing an example of line search in the energy gradient direction in the decomposed search regions of the two-dimensional space of the translational search regions shown in FIG. 5. It is assumed that one of search points within the decomposed translational region Wn is (xn, yn, zn). At the search point 701, it is assumed that a force norm 702 that is the gradient vector of the binding energy with respect to the translational coordinates is F=(Fx, Fy, Fz). The search point within the decomposed translational region for computation of the binding energy is given by (xn±kFxdw, yn±kFydw, zn±kFzdw). In this expression, k is an integer that satisfies (nx−1)ΔWopt=xn±kFxdw=nxΔWopt, (ny−1)ΔWopt=yn±kFydw=nyΔWopt, and (nz−1)ΔWopt=Zn±kFzdw=nzΔWopt. Also, dw is the translational width in the line search. Further, the translational width dw can be prepared at the system side as default, or can be set through the input system 101 by the user.
As described above, when it is assumed that the number of search points is NIt,n, NIt,n search points (xn±kFxdw, Yn±kFydw, Zn±kFzdw) within the decomposed translational regions where the binding energy is to be computed can be determined with respect to the decomposed translational regions Wn that have been allocated to the respective computing units.
Step 1126 is a communication control in which, in order to compute the binding energy, data of the search points that are allocated to the respective computing units which are determined in Step 1124 and Step 1125 is transmitted. When it is assumed that the decomposed translational regions Wn are allocated to the computing units Pm in Step 1124, and NIt,n search points (xn±kFxdw, yn±kFydw, zn±kFzdw) which exist within the decomposed translational region Wn are given in Step 1125, NIt,n search points (xn±kFxdw, yn±kFydw, and zn±kFzdw) are transmitted to the computing unit Pm.
As shown in FIG. 8, data of NIt,n search points (xn±kFxdw, yn±kFydw, and zn±kFzdw) that exist within the decomposed translational regions Wn which are allocated to the respective computing units are transmitted to all of the computing units P1, P2, . . . , PNp of the computing unit group 203. On the contrary, the binding energies with respect to the search points which have been computed by the respective computing units and the gradient vectors of the binding energy with respect to the translational coordinate, that is, a force that is exerted on compound is received. The binding energy of compound that has been subjected to translational operation and protein in water molecule, and a force that is exerted on compound are received with respect to NIt,n translational coordinates (xn±kFxdw, yn±kFydw, and zn±kFzdw) which exist within the decomposed translational regions Wn which have been transmitted to the computing units Pm.
In Step 1127, the minimum value is determined from the local minimum values of the binding energies that have been received in Step 1126 and computed by the respective computing units and the local minimum value that has been computed by all of the computing units. The search point that gives the smallest binding energy in NIt,n binding energies is selected in correspondence with the NIt,n search points (xn±kFxdw, yn±kFydw, and zn±kFzdw) which exist within the decomposed translational regions Wn which have been computed by the computing units Pm. The line search repeats the iterative calculation that is NIi times or more in the number of line searches.
The selected search point is a search point at which the gradient vector of the binding energy is obtained with respect to the translational coordinates described in Step 1125. The binding energy that has been obtained as the result of the iterative calculation is the local minimum value of the binding energies within the decomposed translational regions Wn. The smallest energy among the local minimum values of the binding energies that have been obtained in correspondence with all of the computing units P1, P2, . . . , PNw is the minimum value of the binding energy.
In Step 1128, it is determined whether the iterative calculation of the line search is repeated, or not, on the basis of the convergence of the local minimum values of the binding energy within the decomposed translational region. When the number of line searches of the decomposed translational region Wn which have been allocated to the computing units Pn is NIt or lower, control is returned to Step 1125, and the iterative calculation of the line search is executed. When the number of line searches of the decomposed translational region Wn which have been allocated to the computing units Pn is equal to or higher than NIt, or when a difference between the local minimum value of the binding energy and the local minimum value of the binding energy which has been found in the previous iterative calculation is converged to a threshold energy or lower, the line search is completed. The minimum value of the binding energy of protein and compound in water molecule, as well as the atomic coordinate data with respect to the binding structure of protein and compound in water molecule is transmitted to the output system 103.
In Step 1129, the binding energy corresponding to the search point in the respective computing units, and the gradient vector of the binding energy with respect to the translational coordinates are calculated. The respective computing units Pm receive the data of the search points, that is, NIt,n translational coordinates (xn±kFxdw, yn±kFydw, and zn±kFzdw) within the decomposed translational regions Wn from Step 1126. The respective computing units Pm execute the translational operation with respect to the atomic coordinates of compound by using the search points (xn±kFxdw, yn±kFydw, and zn±kFzdw). The respective computing units Pm computes NIt,n binding energies and a force that is exerted on compound from compound that has been subjected to translational operation, and the atomic coordinates of protein in water molecule. The binding energies corresponding to NIt,n search points (xn±kFxdw, yn±kFydw, and zn±kFzdw) which exist within the decomposed translational regions Wn, and the force that is exerted on compound are transmitted to Step 1126.
A description will be given of a specific example in which the cubic configuration of the spatial region width W=6 Å in the translational search region is inputted from the input system 101 as the search region with respect to the binding structure of protein and compound in water molecule, and the number of available computing units Npa=60 in the parallel and distributed computer system is inputted with reference to FIG. 9. In Step 1121, the decomposition width of the translational search region and the number of searches are determined.
FIG. 9 shows a change 401 in the number of decomposed translational regions (hereinafter, referred to as “the number of decomposed translational regions) which are averagely allocated to the respective computing units with respect to the decomposition width, a change in the number of line searches with respect to the decomposition width when Rt is 0.5 Å, the number of line searches 403 that obtains the local minimum value of the binding energy on the respective computing units, and the optimum decomposition width with the axis of abscissa indicative of the decomposition width of the translational search region and the axis of ordinate indicative of the number of line searches or the number of decomposed regions as in FIG. 4. The decomposition width ΔWopt of the translational search region where the number of line searches is the minimum on the respective computing units becomes 1 Å, and the number of line searches NIt can obtain 105.
In Step 1122, the number of decomposed translational regions Nw=(W/ΔWopt)3 is 216 by using the optimum decomposition width ΔWopt=1 Å. In Step 1123, since the number of decomposition regions Nw=216 is larger the number of available computing units Npa=60, the number of computing units Np to which the decomposed translational regions are to be allocated is 60. In Step 1124, since the number of line searches NIt with respect to the respective decomposed translational regions is 105, the number of decomposed translational regions that are allocated to the respective computing units can be substantially equalized. For example, as shown in FIG. 10, the number of decomposed translational regions that are allocated to 36 computing units is distributed 4 by 4 with respect to the number of computing units Np=60 of the computing unit group 203 that is connected on the network 204, and the number of decomposed translational regions Ndt−1 that are allocated to 24 computing units is distributed 3 by 3.
In Step 1125, the search points of line searches within the decomposed translational regions which have been allocated to the respective computing units are determined. Data of the search points of the line searches is transmitted to the respective computing units in Step 1126, and the binding energy corresponding to the search points in the respective computing units, and the gradient vectors of the binding energies with respect to the translational coordinates are computed and transmitted to Step 1126, in Step 1129. In Step 1127, the local minimum values of the binding energies that have been computed by the respective computing units are obtained. In Step 1128, the iterative calculation that is 105 in the number of line searches NIt is executed.
FIG. 11 is a diagram showing the number of line searches that obtain the local minimum values of the binding energy. A solid line 402 represents a predicted value that is obtained in Step 1121, and a dotted line 1101 is the computation results of the simulation according to the present invention. In the simulation, the average number of line searches that obtain the local minimum value of the binding energy in the decomposed translational region is 134, which relatively excellently coincides with the predicted value. The number of line searches on the respective computing units is a product of the number of line searches of the respective decomposed translational regions and the number of decomposed regions on the respective computing units, and therefore 420.
On the other hand, the number of line searches for obtaining the local minimum value of the binding energy when only one of the computing units is used is predicted as 4740 by the aid of Expressions (3) to (20). Therefore, the number of line searches that obtain the local minimum values of the binding energy is reduced down to 4740/420= 1/11 times by means of the design system of a binding structure for polymer molecule using the parallel and distributed computer system, thereby making it possible to compute the binding structure that minimizes the binding energy in a high speed. In other words, the user is capable of performing high-speed computation by merely setting the search region that represents a range where the translational operation of the atomic coordinates of polymer molecule to be subjected to simulation, and the number of available computing units Npa in the parallel computers or the PC cluster under the parallel and distributed environment.
Second Embodiment
FIG. 12 is a conceptual diagram showing the configuration of a design system of a binding structure for polymer molecule according to a second embodiment of the present invention, and a diagram for explaining a specific transaction of a step of computing the minimum value of a binding energy of protein by the aid of a rotational operation of compound whereas the first embodiment describes the transaction of computing the minimum value of the binding energy of protein by the aid of the translational operation of the atomic coordinates of compound. In this example, the entire configuration is identical with the configuration shown in FIG. 1 as in the first embodiment. However, the transaction and control unit 102 and the respective transaction steps 1021 to 1029 in FIG. 1 are changed to a transaction and control unit 122 and the respective transaction steps 1221 to 1229 according to the change of the processing contents.
The user inputs an angle region width x from the input system 101 as a search region (hereinafter referred to as “rotational search region”) that expresses a range where the rotational operation of compound is performed in order to search the minimum value of the binding energy of protein that is obtained from genome information and polymer molecule to be subjected to simulation such as DNA and RNA, for example, protein and compound in water molecule. As shown in FIGS. 13A to 13C, the search region where the rotational operation of compound 1301 is performed is represented by 0=F=x, 0=θ=x/2, and 0=ψ=x when being expressed by Euler's angles (F, θ, ψ), where F is the rotational angle about a z-axis, θ is the rotational angle about an x-axis subsequent to the rotation of the z-axis, and ψ is the rotational angle about the z-axis subsequent to the rotations of the z-axis and the x-axis, and x is 0=x=2p. Also, the user inputs the number of computing units Npa in the parallel computers or the PC cluster in the parallel and distributed environment.
Hereinafter, a description will be given of a transaction flow of distributing the binding computation to the respective computing units and integrating the results in the transaction and control unit 122.
In Step 1221, the decomposition width that minimizes the number of linearly searching the local minimum value of the binding energy, and the number of line searches are determined in the rotational search region that performs the rotational operation of compound. FIG. 14 is a diagram showing a change 1401 in decomposed rotational regions (hereinafter referred to as “decomposed rotational regions”) that are averagely allocated to the respective computing units with respect to the decomposition angle width, a change 1402 in the number of line searches with respect to the decomposition angle width, a change 1403 in the number of line searches of the local minimum value of the binding energy with respect to the respective decomposed rotational regions with respect to the decomposed angle width, and an optimum decomposition width with the axis of abscissa indicative of the decomposition angle width of the rotational search region and the axis of ordinate indicative of the number of line searches or the number of decomposed regions. When the decomposition width of the rotational search region is Δx, the number of decomposition rotational regions that are averagely allocated to the respective computing units is (x/Δx)3/2Npa. Also, in the respective decomposed rotational regions, the binding energy is calculated by the line search in the energy gradient vector direction, that is, a rotational direction of the torque that is exerted on compound, and the number of line searches until the local minimum value of the binding energy is found is given by F(X) represented in Expression (3).
In this expression, X=ΔW/Rr. When Rr is within a distance of the radius Rr from a coordinate position at which the minimum value of the binding energy exists in the decomposed rotational region, the binding energy is an energy region of a quadratic function with respect to a distance, and when Rr is equal to or higher than the radius Rr, the binding energy is a random energy region. The number of line search 1403 of the local minimum value of the binding energy on the respective computing units is represented by their product (x/Δx)3/2Npa×F(Δx/Rr). Accordingly, when the decomposition width Δxopt where (x/Δx)3/2Npa×F(Δx/Rr) becomes the minimum is selected, the decomposition width Δxopt of the rotational search region x, as well as the binding energy on the respective computing units are calculated, thereby making it possible to determine NIr=F (Δxopt/Rr) where the number of line searches of the local minimum value of the binding energy becomes the minimum.
In Step 1222, the number of decomposition of the rotational search region and the range of the decomposed rotational regions are determined by the aid of the decomposition width Δxopt of the rotational search region x. The number of rotational regions that decompose the rotational search region x is Nx=(x/Δxopt)3/2. When the rotational coordinates within the decomposed rotational region are (F, θ, ψ), 0=F=Δxopt, 0=θ=Δxopt, and 0=ψ=Δxopt are set as the decomposed rotary region x1, 0=F=Δxopt, 0=θ=Δxopt, and xopt=ψ=2xopt are set as the decomposed rotary region x2, . . . , and (x−Δxopt)=F=x, (x/2−Δxopt)=θ=x/2, and (x−Δxopt)=ψ=x are set as the decomposed rotary region XNx. 
In general, the decomposed rotational region xn is represented by (nF−1)Δxopt=F=nFΔxopt, (nθ−1)Δxopt=θ=nθΔxopt, and (nθ−1)Δxopt=ψ=nψΔxopt, where n=1, 2, . . . , Nx, nF, nψ=1, 2, . . . , x/Δxopt, and nθ=1, 2, . . . , x/2Δxopt. As described above, it is possible to determine the number of decomposed rotational regions Nx, as well as the range of the decomposed rotational regions x1, x2, . . . , xn, . . . , and xNx can be determined.
In Step 1223, the number of computing units in the parallel and distributed environment where the decomposed rotational regions are allocated is determined by using the number of decomposed rotational regions Nx. In the case where the number of decomposed rotational regions Nx is larger than the number of available computing units Npa, the number of computing units Np to which the decomposed rotational regions are allocated is Npa. On the other hand, in the case where the number of decomposed rotational regions Nx is smaller than the number of available computing units Npa, the number of computing units Np to which the decomposed translational regions are allocated is Nx. In this way, the number of computing units Np in the parallel and distributed environment for allocation of the decomposed translational regions can be determined.
In Step 1224, the number of decomposed rotational regions that are allocated to the respective computing units, and the decomposed rotational region are determined by the aid of the number of decomposed rotational regions Nx, the number of line searches NIr as well as the number of computing units Np in the parallel and distributed environment for allocation of the decomposed rotational regions. Since the number of line searches with respect to the respective decomposed rotational regions is NIr, the number of decomposed rotational regions that are allocated to the respective computing units can be substantially equalized, and the number Ndr of allocated decomposed translational regions is [Nx/Np] or [Nx/Np]−1. In this expression, a value obtained in the form of [**] is rounded out to the whole number, and Ndr decomposed rotational regions that are arbitrarily selected from the decomposed translational regions x1, x2, . . . , xNx are allocated to each of the Np computing units under the parallel and distributed environment.
In Step 1225, the search point within the decomposed rotational region where the binding energy is to be computed is determined in the decomposed rotational regions xn that are allocated to the computing units. It is assumed that one of search points within the decomposed translational region xn is (Fn, θn, ψn). At the search point, it is assumed that the norm of a gradient vector with respect to the rotational coordinates of the binding energy is F=(FF, Fθ, Fψ). Then, F=(FF, Fθ, Fψ) can be obtained from R(Fn+FF), θn+Fθ, ψn+Fθ)=T (Tx, Ty, Tz) R (Fn, θn, ψn) by the aid of the torque vector T=(Tx, Ty, Tz). In this example, R is an Euler's matrix, T is the rotational matrix of the torque. The search point within the decomposed rotational region for computing the binding energy is given by (Fn±kFFdx, θn±kFθdx, ψn±kFψdx). In this expression, k is an integer that satisfies (nF−1)Δxopt=Fn±kFFdx=nFΔxopt, (nθ−1)Δxopt=θn±kFθdx=nθΔxopt, and (nψ−1)Δxopt=ψnkFψdx=nθΔxopt. Also, dx is the rotational width in the line search. Further, the rotational width dx can be prepared at the system side as default, or can be set through the input system 101 by the user.
As described above, when it is assumed that the number of search points is NIr,n, NIr,n search points (Fn±kFFdx, θn±kFθdx, ψn±kFψdx) within the decomposed rotational regions where the binding energy is to be computed can be determined with respect to the decomposed rotational regions xn that have been allocated to the respective computing units.
In the communication control of Step 1226, data of the search points that are allocated in order to compute the binding energy by the respective computing units which are determined in Step 1224 and Step 1225 is transmitted. When it is assumed that the decomposed rotational regions xn are allocated to the computing units Pm in Step 1224, and NIr,n search points (Fn±kFFdx, θn±kFθdx, ψn±kFψdx) which exist within the decomposed rotational region xn are given in Step 1225, NIr,n search points (Fn±kFFdx, θn±kFθdx and ψn±kFψdx) are transmitted to the computing unit Pm. In this way, data of NIr,n search points (Fn±kFFdx, θn±kFθdx, and ψn±kFψdx) that exist within the decomposed rotational regions xn which are allocated to the respective computing units are transmitted to all of the computing units P1, P2, . . . , PNp. On the contrary, the binding energies at the search points which have been computed by the respective computing units and the gradient vectors of the binding energy with respect to the rotational coordinate, that is, a force that is exerted on compound is received. The binding energy of compound that has been subjected to rotational operation and protein in water molecule, and a force that is exerted on compound are received with respect to NIr,n rotational coordinates (Fn±kFFdx, θn±kFθdx, and ψn±kFψdx) which exist within the decomposed rotational regions xn which have been transmitted to the computing units Pm.
In Step 1227, the minimum value is determined from the local minimum values of the binding energies that have been received in Step 1226 and computed by the respective computing units and the local minimum value that has been computed by all of the computing units. The search point that gives the smallest binding energy in NIr,n binding energies is selected in correspondence with the NIr,n search points (Fn±kFFdx, θn±kFθdx, and ψn±kFψdx) which exist within the decomposed rotational regions xn which have been computed by the computing units Pm. The line search repeats the iterative calculation that is NIr times or more in the number of line searches. The selected search point is a search point at which the gradient vector of the binding energy is obtained with respect to the rotational coordinates described in Step 1225. The binding energy that has been obtained as the result of the iterative calculation is the local minimum value of the binding energies within the decomposed rotational regions xn. Then, the smallest energy among the local minimum values of the binding energies that have been obtained in correspondence with all of the computing units P1, P2, . . . , PNx is the minimum value of the binding energy.
In Step 1228, it is determined whether the iterative calculation of the line search is repeated, or not, on the basis of the convergence of the local minimum values of the binding energy within the decomposed rotational region. When the number of line searches of the decomposed translational region xn which have been allocated to the computing units Pn is NIr or lower, control is returned to Step 1225, and the iterative calculation of the line search is executed. When the number of line searches of the decomposed rotational region xn which have been allocated to the computing units Pn is equal to or higher than NIr, or when a difference between the local minimum value of the binding energy and the local minimum value of the binding energy which has been found in the previous iterative calculation is converged to a threshold energy or lower, the line search is completed. The minimum value of the binding energy of protein and compound in water molecule, as well as the atomic coordinate data with respect to the binding structure of protein and compound in water molecule is transmitted to the output system 103.
In Step 1229, data at the search points from Step 1226 is received in the computing unit of the parallel and distributed computer system. The respective computing units Pm receive NIr,n rotational coordinates (Fn±kFFdx, θn±kFθdx, and ψn±kFψdx) within the decomposed rotational regions xn. The respective computing units Pm execute the rotational operation with respect to the atomic coordinates of compound by using the search points (Fn±kFFdx, θn±kFψdx, and ψn±kFψdx). The respective computing units Pm computes NIr,n binding energies and a torque that is exerted on compound on the basis of the atomic coordinates of compound and protein that have been subjected to rotational operation. The binding energies corresponding to NIr,n search points (Fn±kFFdx, θn±kFθdx, and ψn±kFψdx) which exist within the decomposed rotational regions Xn, and the torque that is exerted on compound are transmitted to Step 1226.
FIG. 15 is a diagram showing an appearance in which the decomposed rotational regions x1, x2, . . . , xNdr are allocated to the computing unit P1 in the computing unit group 203 that is connected on the network 204, the decomposed rotational regions xNdr+1, xNdr+2, . . . , x2Ndr are allocated to the computing unit P2, . . . , and the decomposed rotational regions xNp(Ndr−1)+1, XNp(Ndr−1)+2, . . . , xNpNdr(=xNx) are allocated to the computing unit PNp. The range of the decomposed translational region xn that is allocated to the computing unit Pm is (nF−1)Δxopt=F=nFΔxopt, (nθ−1)Δxopt=θ=nθΔxopt, and (nψ−1)Δxopt=ψ=nψΔxopt, where m=1, 2, . . . , Np, n=1, 2, . . . , and Nx, nF, nψ=1, 2, . . . , x/Δxopt, and nθ=1, 2, . . . , x/2Δxopt.
Referring to FIG. 16, a description will be given of a specific example in which the angle region width x=360° of the rotational search region is inputted from the input system 101, and the number of available computing units Npa=250 in the parallel and distributed computer system is inputted as the search region with respect to the binding structure of protein and compound in water molecule. In Step 1221, the number of decomposed rotational regions on the respective computing units with respect to the decomposition width of the rotational search region, the number of line searches in order to obtain the local minimum value of the binding energy in the decomposed rotational region, as well as the number of line searches that obtain the local minimum value of the binding energy on the respective computing units are determined. FIG. 16 is a diagram showing a change 1401 in the decomposed transactional regions (hereinafter referred to as “decomposed translational region”) that are averagely allocated to the respective computing units with respect to the decomposition width, a change 1402 in the number of line searches of the local minimum value of the binding energy with respect to the decomposition width in the respective decomposed translational regions when Rr is 15°, as well as a change 1403 in the number of line searches that obtain the local minimum value of the binding energy on the respective computing units, and an optimum decomposition angle width with the axis of abscissa indicative of the decomposition angle width (degree) of the rotational search region and the axis of ordinate indicative of the number of line searches or the number of decomposed regions. It can be obtained that the decomposition width Δxopt of the rotational search region which minimizes the number of line searches on the respective computing units is 36°, and the number of line searches NIr is 160.
In Step 1222, the number of decomposed rotational regions is 500 because of Nx=(x/Δxopt)3/2 by the aid of the optimum decomposition width Δxopt=36°. In Step 1223, since the number of decomposed regions Nx=500 is larger than the number of available computing units Npa=250, the number of computing units Np to which the decomposed rotational regions are to be allocated is 250. In Step 1224, since the number of line searches NIr with respect to the respective decomposed rotational regions is 160, the number of decomposed rotational regions that are allocated to the respective computing units can be substantially equalized. For example, as shown in FIG. 17, the number of decomposed rotational regions Ndr that are allocated to the respective computing units is distributed as 2 with respect to the number of computing units Np=250. In Step 1225, the search points of the line searches within the decomposed rotational region which are allocated to the respective computing units are determined. In Step 1226, data at the search points of the line searches is transmitted to the respective computing units, and in Step 1229, the binding energy corresponding to the search point in the respective computing units, and the gradient vector of the binding energy with respect to the rotational coordinates are computed, and transmitted to Step 1226. In Step 1227, the local minimum value of the binding energy which has been computed by the respective computing units is obtained. In Step 1228, the iterative calculation that is 160 or more in the number of line searches NIr is executed.
FIG. 18 is a diagram showing the number of line searches that obtain the local minimum values of the binding energy. A solid line 402 represents a predicted value that is obtained in Step 1221, and a dotted line 1801 is the computation results of the simulation. In the simulation, the average number of line searches that obtain the local minimum value of the binding energy in the decomposed rotational region is 214, which relatively excellently coincides with the predicted value. The number of line searches on the respective computing units is a product of the number of line searches of the respective decomposed rotational regions and the number of decomposed regions on the respective computing units, and therefore 320.
On the other hand, the number of line searches for obtaining the local minimum value of the binding energy when only one of the computing units is used is predicted as 9612 by the aid of Expressions (3) to (20). Therefore, the number of line searches that obtain the local minimum values of the binding energy is reduced down to 9612/320= 1/30 times by means of the design system of a binding structure for polymer molecule using the parallel and distributed computer system, thereby making it possible to compute the binding structure that minimizes the binding energy in a high speed. In other words, the user is capable of performing high-speed computation by merely setting the angle region width that represents a range of the rotational search region of the atomic coordinates of polymer molecule to be subjected to simulation, and the number of available computing units Npa in the parallel computers or the PC cluster under the parallel and distributed environment.

## Claims

1. A design system of a binding structure for polymer molecule which is executed by a parallel and distributed computer system, the parallel and distributed computer system, comprising:
a plurality of computing units including a CPU that executes computing, a memory system that holds necessary program and data, an input/output interface, and a bus that connects the CPU, the memory system, and the input/output interface;
a personal computer including an input system that inputs necessary data by a user, a transaction and control unit, an output system that outputs data for the user, a memory system that holds necessary program and data, an input/output interface, and a bus that connects the input system, the output system, the memory system, and the input/output interface, and executing a transaction for distributing computation to the plurality of computing units and integrating the computation result of the plurality of computing units; and
a network that executes data transfer between the personal computer and the computing units through the input/output interface,
wherein the transaction and control unit of the personal computer executes a transaction procedure of distributing computation to the respective computing units and integrating the computation results of the respective computing units with respect to the number of operable computing units that are designated by the user, and the search region of polymer molecule, and
wherein the transaction procedure comprises the steps of:
(1) determining a decomposition width that decomposes a search region and the number of searches that compute a binding energy;
(2) determining the number of decomposed search regions (decomposed regions) and a range of the decomposed regions by using the decomposition width of the search region;
(3) determining the number of computing units in the parallel and distributed environment for allocation of the decomposed regions within the number of operable computing units by using the number of decomposed regions;
(4) determining the number of decomposed regions that are allocated to each of the respective computing units and which of the decomposed regions are assigned to the respective computing units by using the number of decomposed regions, the number of searches, and the number of computing units to which the decomposed regions are allocated;
(5) determining the search points within the decomposed regions where the binding energy is computed in the decomposed regions that are allocated to the respective computing units;
(6) transmitting data at the respective search points which are allocated in order to compute the binding energy to the respective computing units that are determined in the steps (4) and (5), and receiving the binding energies and the energy gradient vector at the respective search points which are computed by the respective computing units for communication control;
(7) determining the minimum value in the local minimum values of the binding energies that are computed by the respective computing units which are received in the step (6), and the local minimum value that is computed by all of the computing units;
(8) determining whether iterative calculation is executed, or not, on the basis of the convergence of the local minimum value of the binding energy within the decomposed region, or denies the iterative calculation when the number of searches exceeds a given value; and
(9) returning the control to the step (5) in the case where the iterative calculation is executed, and outputting data of the atomic coordinates with respect to the minimum value of the binding energy of polymer molecule and the binding structure of polymer molecule to the output system in the case where the iterative calculation is completed,
wherein the transaction in the respective computing units includes a step of receiving data at the search points from the step (6), and computing the binding energy of polymer molecule and the energy gradient vector at the designated search point.

2. The design system of a binding structure for polymer molecule according to claim 1, wherein the transaction procedures of distributing the computation to the respective computing units and integrating the computation results of the respective computing units among the functions of the personal computers are shared to one of the computing units.

3. The design system of a binding structure for polymer molecule according to claim 1, wherein the personal computer and the computing units are formed of a single computer.

4. The design system of a binding structure for polymer molecule according to claim 1, wherein the network includes a management unit of a parallel and distributed computer system that collects the number of operable computing units among the computing units, the transaction performance of the operable computing units, and the information on the network speed, and supplies the information to the personal computer.

5. The design system of a binding structure for polymer molecule according to claim 1, wherein the step of determining the number of searches which computes the decomposition width that decomposes the search region and the binding energy selects a decomposition width ΔWopt that minimizes a product of the number of decomposed translational regions that are averagely allocated to the respective computing units according to the decomposition width that decomposes the search region, and the number of line searches of the local minimum values of the binding energy in the decomposed translational region as the decomposition width, and selects the number of searches in the decomposition width as the number of searches minimizes a product of the number of decomposed translational or rotational regions that are averagely allocated to the respective computing units according to the decomposition width that decomposes the search region, and the number of line searches of the local minimum values of the binding energy in the decomposed translational or rotational region as the decomposition width, and selects the number of searches in the decomposition width as the number of searches.

6. The design system of a binding structure for polymer molecule according to claim 5, wherein a prediction of the number of searches in the decomposed region using the decomposition width of the search region has, as a predicted value of the number of searches, the number of line searches until the binding energy is computed at the search points on a line in a direction of the energy gradient vector, the computation of the energy gradient vector is repeated at the search points on the line which minimize the binding energy, and the local minimum value of the binding energy is obtained.

7. The design system of a binding structure for polymer molecule according to claim 6, wherein the number of line searches determines the number of searches of decomposed regions which is predicted by using the decomposition width of the search region, and a distance of the energy region which is a quadratic function with respect to a distance from the local minimum position of the binding energy.

8. The design system of a binding structure for polymer molecule according to claim 7, wherein the size of a radius Rt is prepared at the system side as default, or is designated by the user, in the energy region where binding energy from a coordinate position at which the minimum value of the binding energy exits is a quadratic function with respect to a distance.

9. The design system of a binding structure for polymer molecule according to claim 5, wherein when the number of decomposed regions is smaller than the number of available computing units which is inputted from the input system by the user, the number of decomposed regions is set as the number of computing units to which the decomposed regions are to be allocated, and when the number of decomposed regions is larger than the number of available computing units which is inputted from the input system by the user, the number of computing units to which the decomposed regions are to be allocated is set to the number of operable computing units.

10. The design system of a binding structure for polymer molecule according to claim 9, wherein the number of operable computing units is data that is given from the management unit of the parallel and distributed computer system which is disposed in the system, or a value that is determined by the user with reference to the data given from the management unit.

11. The design system of a binding structure for polymer molecule according to claim 9, wherein the number of decomposed regions that are allocated to the respective computing units and a range of the decomposed region are determined according to the number of decomposed regions that is set according to the number of operable computing units, the number of searches of the decomposed regions, and the number of computing units to which the decomposed regions are to be allocated.

12. The design system of a binding structure for polymer molecule according to claim 4, wherein the number of computing units having the transaction performance converted to the identical transaction performance is deviated from the number of operable computing units and the transaction performance of the operable computing units which are supplied from the management unit of the parallel and distributed computer system to determine the number of decomposed regions that are allocated to the respective computing units, and a range of the decomposed regions.

13. The design system of a binding structure for polymer molecule according to claim 1, wherein, in the decomposed regions that are allocated to the respective computing units, a gradient vector with respect to the binding energy is computed at one point of search points that exist within the decomposed regions, and a search point that exists on a line in a direction of the gradient vector and at which the binding energy that exists within the decomposed region is to be computed is set.

14. The design system of a binding structure for polymer molecule according to claim 1, wherein data related to the decomposed regions that are allocated to the respective computing units and the search points that exist within the decomposed regions and compute the binding energy is transmitted to the computing unit that computes the binding energy and the energy gradient vector on the parallel and distributed computer system, whereas the binding energy and the energy gradient vector at the search points that are computed by the respective computing units are received.

15. The design system of a binding structure for polymer molecule according to claim 1, wherein the respective computing units determine the minimum value from the local minimum value of the binding energy that is computed in correspondence with the search points within the decomposed regions, and the local minimum values that are computed by all of the computing units.

16. The design system of a binding structure for polymer molecule according to claim 1, wherein in the transaction and control unit, said step (5) through said step (7) are executed by the iterative calculations having the predicted number of searches of the decomposed regions, or more, and the iterative calculation is executed until a difference between the local minimum values of the binding energy and the minimum values of the binding energy which is obtained in a previous iterative calculation is converged to a threshold energy or lower.

17. The design system of a binding structure for polymer molecule according to claim 1, wherein each of the computing units receives the search points within the decomposed regions which are allocated to the respective computing units through the communication control step of the transaction and control unit of the personal computer, performs the translational operation and the rotational operation with respect to the position of polymer molecule, computes the binding energy and the energy gradient vector with respect to the atomic coordinates of polymer molecule that performs the translational operation and the rotational operation, and transmits the computation results of the binding energy and the energy gradient vector to the transaction and control unit of the personal computer through the communication control step.

18. The design system of a binding structure for polymer molecule according to claim 1, wherein the user inputs the search region of the translational operation with respect to compound and the rotational operation with respect to compound for a binding structure of protein and compound in water molecule as the binding structure of polymer molecule through the input system of the personal computer.

19. The design system of a binding structure for polymer molecule according to claim 18, wherein a force that is exerted on polymer molecule at the search point is computed with respect to the translational operation, and a torque that is exerted on polymer molecule at the search point is computed with respect to the rotational operation, as the energy gradient vector.

20. The design system of a binding structure for polymer molecule according to claim 18, wherein the translational width dw of the translational operation and the decomposed angle width of the rotational operation in the computation of the energy gradient vector are prepared at the system side as default, or can be designated by the user through the input system.