Method, system, and program of searching for a pair of fragments from two data sequences

A method of searching for a pair of fragments (Fx and Fy) from two biological sequences (X and Y), wherein a pattern of Fx and Fy satisfies a predetermined criterion, said method comprising the steps of:

• (6.1) selecting a first fragment (Fx1) of X and a first fragment (Fy1) of Y, wherein a first pattern (p1) of Fx1 and Fy1 satisfies a first predetermined condition (c1);
• (6.2) extending a second fragment (Fx2) from Fx1 in a direction and extending a second fragment (Fy2) from Fy1 in the direction;
• (6.3) identifying a second pattern (p2) of Fx2 and Fy2;
• and
• (6.4) obtaining the pair of fragments (Fx and Fy) based on p2 in a predetermined manner.

A system of searching for a pair of fragments (Fx and Fy) from two data sequences (X and Y), wherein a pattern of Fx and Fy satisfies a predetermined criterion, said system comprising:

• (11.1) logic that selects a first fragment (Fx1) of X and a first fragment (Fy1) of Y, wherein a first pattern (p1) of Fx1 and Fy1 satisfies a first predetermined condition (c1);
• (11.2) logic that extends a second fragment (Fx2) from Fx1 in a direction and extends a second fragment (Fy2) from Fy1 in the direction;
• (11.3) logic that identifies a second pattern (p2) of Fx2 and Fy2;
• and
• (11.4) logic that obtains the pair of fragments (Fx and Fy) based on p2 by a predetermined logic.

A system of searching for a pair of fragments (Fx and Fy) from two biological sequences (X and Y), wherein a pattern of Fx and Fy satisfies a predetermined criterion, said system comprises:

• (16.1) logic that selects a first fragment (Fx1) of X and a first fragment (Fy1) of Y, wherein a first pattern (p1) of Fx1 and Fy1 satisfies a first predetermined condition (c1);
• (16.2) logic that extends a second fragment (Fx2) from Fx1 in a direction and extending a second fragment (Fy2) from Fy1 in the direction;
• (16.3) logic that identifies a second pattern (p2) of Fx2 and Fy2;
• and
• (16.4) logic that obtains the pair of fragments (Fx and Fy) based on p2 by a predetermined logic.

A computer program of searching for a pair of fragments (Fx and Fy) from two data sequences (X and Y), wherein a pattern of Fx and Fy satisfies a predetermined criterion, said computer program comprisingg:

• (21.1) a code segment that selects a first fragment (Fx1) of X and a first fragment (Fy1) of Y, wherein a first pattern (p1) of Fx1 and Fy1 satisfies a first predetermined condition (c1);
• (21.2) a code segment that extends a second fragment (Fx2) from Fx1 in a direction and extends a second fragment (Fy2) from Fy1 in the direction;
• (21.3) a code segment that identifies a second pattern (p2) of Fx2 and Fy2;
• and
• (21.4) a code segment that obtains the pair of fragments (Fx and Fy) based on p2 by a predetermined code segment.

A computer program of searching for a pair of fragments (Fx and Fy) from two biological sequences (X and Y), wherein a pattern of Fx and Fy satisfies a predetermined criterion, said computer program comprises:

• (26.1) a code segment that selects a first fragment (Fx1) of X and a first fragment (Fy1) of Y, wherein a first pattern (p1) of Fx1 and Fy1 satisfies a first predetermined condition (c1);
• (26.2) a code segment that extends a second fragment (Fx2) from Fx1 in a direction and extending a second fragment (Fy2) from Fy1 in the direction;
• (26.3) a code segment that identifies a second pattern (p2) of Fx2 and Fy2;
• and
• (26.4) a code segment that obtains the pair of fragments (Fx and Fy) based on p2 by a predetermined code segment.