Homology searching method

A method for controlling an apparatus for controlling a plurality of devices for searching homology of a plurality of query character sequences in a base character sequence in parallel, the apparatus including a memory for storing a base character sequence and an appearing frequency of each of first types of character strings each having a fixed length appearing in the base character sequence and a processor for executing a process, the method comprising:

• obtaining a plurality of query character sequences for searching homology in the base character sequence by the processor;
• retrieving each of second types of character strings each having a longer fixed length then that of first types of the character strings stored in the memory and partially appearing in each of the query character sequences by the processor;
• determining an approximate appearing frequency of each of the second types of the character string on the basis of the appearing frequency of the first types of the character strings by the processor;
• evaluating for each of the query character sequences a load of task for searching homology by the processor;
• and
• allocating each task for searching homology for each of the query character sequences among the devices on the basis of the result of evaluation of the load of the each task by the processor.

A computer readable medium storing a program for controlling an apparatus for controlling a plurality of devices for searching homology of a plurality of query character sequences in a base character sequence in parallel, the apparatus including a memory for storing a base character sequence and an appearing frequency of each of first types of character strings each having a fixed length appearing in the base character sequence and a processor for executing a process, the process comprising:

• obtaining a plurality of query character sequences for searching homology in the base character sequence by the processor;
• retrieving each of second types of character strings each having a longer fixed length then that of first types of the character strings stored in the memory and partially appearing in each of the query character sequences by the processor;
• determining an approximate appearing frequency of each of the second types of the character string on the basis of the appearing frequency of the first types of the character strings by the processor;
• evaluating for each of the query character sequences a load of task for searching homology by the processor;
• and
• allocating each task for searching homology for each of the query character sequences among the devices on the basis of the result of evaluation of the load of the each task by the processor.