Appeal No. 1998-3335
Application 08/014,867
This is a decision on appeal under 35 U.S.C. § 134 from
the final rejection of claims 31-37.
We reverse.
BACKGROUND
The invention is directed to a method and apparatus for
determining the longest common subsequence (LCS) between two
chains of atomic groups, such as amino acid sequences. The
apparatus is shown in figure 1. The steps performed by the
method and apparatus of independent claims 31 and 35 are
described with respect to the example of figures 5 and 6.
As illustrated in the example of figures 5 and 6, the LCS does
not have to be consecutive characters; i.e., a character
sequence I = "ABCBDAB" and a character sequence II = "BDCABA"
have an LCS length of 4 with an LCS = "BDAB."
Claim 31 is reproduced below.
31. A computer-implemented method of analyzing
sequences of atomic groups, said method comprising the
steps of:
a) inputting, into a gene information survey
apparatus, a plurality of sequences including a first
sequence of characters a to a corresponding to a1 m
sequence of atomic groups in a first chain of atomic
groups and a second sequence of characters b to b1 n
corresponding to a sequence of atomic groups in a second
chain of atomic groups, wherein m and n are integers,
wherein said gene information survey apparatus comprises
- 2 -
Page: Previous 1 2 3 4 5 6 7 8 9 10 11 Next
Last modified: November 3, 2007