Appeal No. 2006-2702 Page 7
Application No. 09/881,234
biologists to allow access to the ever-expanding sequence data bases without
requiring copious local data base storage, frequent data base updates, the cost
of expensive and sophisticated hardware and software, and the cost and effort of
continuous system maintenance . . . .” The examiner finds, however, that Smith
teaches “that the individual WWW server sites scattered throughout the Web
hinders their efficient use . . . .” Answer, page 9. According to the examiner (id.),
Smith teaches that “the BCM Search Launcher addresses these limitations by
providing an improved interface to simplify access and improve analysis
resources . . . .”
The examiner finds, however, that Smith “does not describe compressing
and uncompressing data, determining a number of tasks as nN x nM, or looping
processes.” Answer, page 7. To make up for this deficiency in Smith, the
examiner relies on Altschul and Reed.
The examiner relies on Altschul to teach that a database can be
compressed “by packing 4 nucleotides into a single byte and using a table to
delimit the boundaries between adjacent sequences . . . .” Id. In this regard, the
examiner finds (id.), Altschul “describe[s] beginning with a matrix of similarity
scores for all possible pairs of residues . . . which represents determining the
number of tasks for an entire comparison of two datasets.” The examiner also
finds (id.), Altschul
Describe[s] performing BLAST with two random sequences (data
sets N and M) of lengths m and n in order to determine the
probability of finding a segment pair with a score greater than S (cut
off score . . .) where y=Kmn e-λS . . . which represents determination
of a number of tasks or points in a matrix in a comparison of two
Page: Previous 1 2 3 4 5 6 7 8 9 10 11 12 Next
Last modified: November 3, 2007