Appeal No. 1998-3335
Application 08/014,867
a longest common subsequence detection unit and said
second sequence of characters b to b are input to the1 n
longest common subsequence detection unit from one of an
amino acid sequence data base and a motif data base;
b) generating, by the gene information survey
apparatus, an occurrence table indicative of occurrence
positions of the characters a to a in the first1 m
sequence;
c) preparing, by the gene information survey
apparatus, a memory element array having memory elements
S to S , said memory elements S to S corresponding to0 m 1 m
said characters a to a , respectively;1 m
d) initializing, by the gene information survey
apparatus, all memory elements S to S to zero and0 m
initializing an integer j to 1;
e) determining, by the gene information survey
apparatus, an occurrence position r of a character a that
r
is the same as a character b by referring to the
j
occurrence table;
f) adding, by the gene information survey
apparatus, 1 to each memory element S where i$r and S isi i
equal to the memory element S when the memory element Sr-1 r
is equal to the memory element S , wherein the adding
r-1
step is repeated in decreasing order of the occurrence
position r when there is more than one occurrence
position r;
g) adding, by the gene information survey
apparatus, 1 to the integer j;
h) repeating, by the gene information survey
apparatus, the steps e) to g) until the integer j exceeds
n;
i) obtaining, by the gene information survey
apparatus, a length of a longest common subsequence
between the first and the second chains of atomic groups
- 3 -
Page: Previous 1 2 3 4 5 6 7 8 9 10 11 Next
Last modified: November 3, 2007