| 摘要 |
<p>PROBLEM TO BE SOLVED: To speedily cluster and assemble a nucleic acid base sequence. SOLUTION: From an individual input array 101, its partial sequence 102 is extracted and recorded in a fixed length partial sequence table 103. In the case of searching an overlapping with a consensus sequence 104, this fixed length part sequence table is referred. When there is a partial sequence 102 completely matched with an sequence in a fixed length window 105 scanning on the consensus sequence, whether or not the entire input sequence can be assembled is judged by comparing the sequences. When it can be assembled, processing for integrating the array to a cluster is repeated based on a greedy method for clustering and assembling.</p> |
