DETAILED ACTION
Notice of Pre-AIA or AIA Status
1. The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA .
Claim Status
Claims 1-20 are under examination.
Claim Rejections - 35 USC § 101
2. 35 U.S.C. 101 reads as follows:
Whoever invents or discovers any new and useful process, machine, manufacture, or composition of matter, or any new and useful improvement thereof, may obtain a patent therefor, subject to the conditions and requirements of this title.
Claims 1-20 are rejected under 35 U.S.C. 101 because the claimed invention is directed to a judicial exception (i.e., a law of nature, a natural phenomenon, or an abstract idea) without significantly more.
Claims 1-17 are directed to method of genomic analysis . As described in Alice Corp. Pty. Ltd. V. CLS Bank Int’l, 573 U.S._, 134 S. Cr. 2347, 110 U.S.P.Q.2d 1976 (2014), a two-step analysis is required in considering the patent eligibility of the claimed subject matter. The first step requires determining if the claimed subject matter is directed to a judicial exception. The instant claims require the steps of representing nucleic acids as a directed acyclic graph (DAG), obtaining a second DAG, and determining an alignment between a second and reference DAG. These steps are a mathematical algorithm or mental steps. Dependent claims 2-17 include additional mental or mathematical steps to the mathematical algorithm. Instant claim 18 recites mapping the upstream pair member of each of a plurality of paired-end reads to a reference, finding a subset of the plurality of paired-end reads, assembling the downstream pair members into a DAG. Instant claim 19 recites assembling the plurality of sequence reads into a DAG, determining support for each of a plurality of paths through DAG. The steps in claims 18 and 19 are drawn to a mathematical algorithm or mental steps. Dependent claim 20 recites a mathematical step. Mental steps are a judicial exception. The courts have found mathematical algorithms to be drawn to the judicial exception of an abstract idea (In re Grams, 888 F.2d 835, 12 U.S.P.Q.2d 1824 (Fed. Cir. 1989)). Thus, the instant claims are drawn to a judicial exception.
This judicial exception is not integrated into a practical application. The instant claims do not recite an element that reflects an improvement in the functioning of a computer or other technology, an element that applies the judicial exception to effect a particular treatment, an element that implements the judicial exception with a particular machine, or an element that effects a transformation of a particular article to a different state or thing. The instant claims recite the elements of a non-transitory memory, a processor, computer system, and a computer file. However, the instant claims do not recite structural limitations of these elements. They are not drawn to a particular machine and do not integrate the judicial exception into a practical application. The instant claims also recite obtaining a plurality of paired-end reads from a nucleic acid sample and obtaining a plurality of nucleic acid sequence reads. However, these are extra solution data gather steps. Extra solution data gathering steps are not sufficient to integrate a judicial exception into a practical application.
The second part of the analysis requires determining if the claims include additional elements that are sufficient to amount to significantly more than the judicial exception. The instant claims recite the additional elements of a non-transitory memory, a processor, computer system, and a computer file. However, these elements are well-understood, conventional and routine components of a computer (Specification, page 24). The instant claims also recite the elements of obtaining a plurality of paired-end reads from a nucleic acid sample and obtaining a plurality of nucleic acid sequence reads. These steps are well-understood, conventional, and routine data gathering steps (Specification, page 24). Reciting such well-understood, routine, and conventional elements does not transform a judicial exception into patent eligible subject matter. In addition, the recitation of the specific types of data to be used in the judicial exception does not transform the abstract idea into a non-abstract idea. (See buySAFE, Inc. v Google, Inc. 765 F.3d 1350, 112 U.S.P.Q.2d 1093 (Fed.Cir.2014)). Furthermore, the elements taken as a combination are also well-understood, routine, and conventional, since the elements are merely gathering data for the judicial exception and implementing the judicial exception on a computer. Thus, the instant claims do not include additional elements that are sufficient to amount to significantly more than the judicial exception.
Claim Rejections - 35 USC § 102
4. The following is a quotation of the appropriate paragraphs of 35 U.S.C. 102 that form the basis for the rejections under this section made in this Office action:
A person shall be entitled to a patent unless –
(a)(1) the claimed invention was patented, described in a printed publication, or in public use, on sale or otherwise available to the public before the effective filing date of the claimed invention.
Claims 1-7, 10-14, 16 and 17 are rejected under 35 U.S.C. 102(a)(1) as being anticipated by Yanovsky et al. (“Read Mapping Algorithms for Single Molecular Sequencing Data” Proc 8th Int Workshop Alg Bioinformatics (2008) volume 5251 pages 38-49).
Yanovsky et al. teach a method that includes a reference directed acyclic graph (DAG) with nodes connected by edges in which a node includes a string of a plurality of nucleotide characters and obtaining a second DAG and aligning the two DAGs (pages 41 - 43); where each DAG includes alternative sequence per position (pages 40-41); scoring sequence overlaps between the reference and second DAG and aligning portions of the second DAG to location of the reference DAG to achieve an best scoring optimal alignment (page 41); using a mathematical construct representing the optimal path through a matrix of similarity scores (pages 42-43), and where the sequences are obtained from a human subject and is of a human chromosome (pages 46 and 47). In addition, Yanovsky et al. teach calculating a matrix of similarities between the reference DAG and a second DAG based on the highest value neighboring entry, identifying a path through a matrix that originates at the entry with the highest calculated value (pages 44-46), and where the reference DAG comprises a plurality of BAM entries that has been mapped to a first genomic sequence and a second DAG comprises a plurality of BAM entries is mapped to a second genomic reference (page 40 and 41). Furthermore, Yanovksy et al. where their program is available in a software package, which would require a computer system, non-transitory memory, processor, and computer files (page 48).
Claim Rejections - 35 USC § 103
5. In the event the determination of the status of the application as subject to AIA 35 U.S.C. 102 and 103 (or as subject to pre-AIA 35 U.S.C. 102 and 103) is incorrect, any correction of the statutory basis for the rejection will not be considered a new ground of rejection if the prior art relied upon, and the rationale supporting the rejection, would be the same under either status.
The following is a quotation of 35 U.S.C. 103 which forms the basis for all obviousness rejections set forth in this Office action:
A patent for a claimed invention may not be obtained, notwithstanding that the claimed invention is not identically disclosed as set forth in section 102, if the differences between the claimed invention and the prior art are such that the claimed invention as a whole would have been obvious before the effective filing date of the claimed invention to a person having ordinary skill in the art to which the claimed invention pertains. Patentability shall not be negated by the manner in which the invention was made.
6. Claims 8 and 9 are rejected under 35 U.S.C. 103 as being unpatentable over Yanovsky et al. (“Read Mapping Algorithms for Single Molecular Sequencing Data” Proc 8th Int Workshop Alg Bioinformatics (2008) volume 5251 pages 38-49) as applied to claims 1-7, 10-14, 16 and 17 above, and further in view of Homer et al. (“Improved Variant Discovery Through Local Re-alignment of Short-Read Next-Generation Sequencing Data Using SRMA” Genome Biology (2010) Volume 11, pages R:99).
Yanovsky et al. is applied as above.
However, Yanovsky et al. do not teach where the reference DAG represents a plurality of alleles associated with disease.
Homer et al. teach creating a DAG (page 9, left column) of a plurality of alleles associated with disease (page 1, left column); where the homozygous and heterozygous loci are represented in the DAG (pages 3-4).
It would have been obvious for one or ordinary skill in the art, at the time the invention was filed, to combine the methods of Yanovsky et al. and Homer et al. Yanovsky et al. teach a general method of genomic analysis. Give that the nucleic acid data of Yanovsky et al. is similar to the data of Homer et al. (i.e. alleles associated with disease or homozygous or heterozygous loci), it would have been obvious for one of ordinary skill in the art to substitute the data of Homer et al. into the method of Yanovsky et al. without an change in the function of the method of Yanovsky et al.
7. Claim 15 is rejected under 35 U.S.C. 103 as being unpatentable over Yanovsky et al. (“Read Mapping Algorithms for Single Molecular Sequencing Data” Proc 8th Int Workshop Alg Bioinformatics (2008) volume 5251 pages 38-49) as applied to claims 1-7, 10-14, 16 and 17 above, and further in view of Bao et al. (IDS filed 8/10/15, entry #7).
Yanovsky et al. is applied as above.
However, Yanovsky et al. do not teach where the second DAG represents a transcriptome from an organism.
Bao et al. teach where the DAG represents a transcriptome from an organism and the reference DAG represents one or more genomes from organisms of a same species as the organism (pages 3-4).
It would have been obvious for one or ordinary skill in the art, at the time the invention was filed, to combine the methods of Yanovsky et al. and Bao et al. Transcriptome assemblies are important when working with large genomes (abstract, page 1). Bao et al. offers a method that improves these assemblies. Thus, one of ordinary skill in the art would have been motivated to combine the methods in order to improve the DAG of Yanovsky et al.
Double Patenting
The nonstatutory double patenting rejection is based on a judicially created doctrine grounded in public policy (a policy reflected in the statute) so as to prevent the unjustified or improper timewise extension of the “right to exclude” granted by a patent and to prevent possible harassment by multiple assignees. A nonstatutory double patenting rejection is appropriate where the conflicting claims are not identical, but at least one examined application claim is not patentably distinct from the reference claim(s) because the examined application claim is either anticipated by, or would have been obvious over, the reference claim(s). See, e.g., In re Berg, 140 F.3d 1428, 46 USPQ2d 1226 (Fed. Cir. 1998); In re Goodman, 11 F.3d 1046, 29 USPQ2d 2010 (Fed. Cir. 1993); In re Longi, 759 F.2d 887, 225 USPQ 645 (Fed. Cir. 1985); In re Van Ornum, 686 F.2d 937, 214 USPQ 761 (CCPA 1982); In re Vogel, 422 F.2d 438, 164 USPQ 619 (CCPA 1970); In re Thorington, 418 F.2d 528, 163 USPQ 644 (CCPA 1969).
A timely filed terminal disclaimer in compliance with 37 CFR 1.321(c) or 1.321(d) may be used to overcome an actual or provisional rejection based on nonstatutory double patenting provided the reference application or patent either is shown to be commonly owned with the examined application, or claims an invention made as a result of activities undertaken within the scope of a joint research agreement. See MPEP § 717.02 for applications subject to examination under the first inventor to file provisions of the AIA as explained in MPEP § 2159. See MPEP § 2146 et seq. for applications not subject to examination under the first inventor to file provisions of the AIA . A terminal disclaimer must be signed in compliance with 37 CFR 1.321(b).
The filing of a terminal disclaimer by itself is not a complete reply to a nonstatutory double patenting (NSDP) rejection. A complete reply requires that the terminal disclaimer be accompanied by a reply requesting reconsideration of the prior Office action. Even where the NSDP rejection is provisional the reply must be complete. See MPEP § 804, subsection I.B.1. For a reply to a non-final Office action, see 37 CFR 1.111(a). For a reply to final Office action, see 37 CFR 1.113(c). A request for reconsideration while not provided for in 37 CFR 1.113(c) may be filed after final for consideration. See MPEP §§ 706.07(e) and 714.13.
The USPTO Internet website contains terminal disclaimer forms which may be used. Please visit www.uspto.gov/patent/patents-forms. The actual filing date of the application in which the form is filed determines what form (e.g., PTO/SB/25, PTO/SB/26, PTO/AIA /25, or PTO/AIA /26) should be used. A web-based eTerminal Disclaimer may be filled out completely online using web-screens. An eTerminal Disclaimer that meets all requirements is auto-processed and approved immediately upon submission. For more information about eTerminal Disclaimers, refer to www.uspto.gov/patents/apply/applying-online/eterminal-disclaimer.
Claims 1-17 are rejected on the ground of nonstatutory double patenting as being unpatentable over claims 1-17 of U.S. Patent No. 9,817,944. Although the claims at issue are not identical, they are not patentably distinct from each other.
The instant claims and the claims of the U.S. Patent recite similar limitations. The claims different in that the claims of the U.S. Patent recite limitations in addition to the limitations in the instant claims. Thus, the subject matter of the instant claims encompasses the subject matter of the U.S. Patent. The claims at issue are not patentably distinct.
Contact Information
Any inquiry concerning this communication or earlier communications from the examiner should be directed to JERRY LIN whose telephone number is (571)272-2561. The examiner can normally be reached T-F 7am-5pm.
Examiner interviews are available via telephone, in-person, and video conferencing using a USPTO supplied web-based collaboration tool. To schedule an interview, applicant is encouraged to use the USPTO Automated Interview Request (AIR) at http://www.uspto.gov/interviewpractice.
If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, Olivia Wise can be reached at (571) 272-2249. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300.
Information regarding the status of published or unpublished applications may be obtained from Patent Center. Unpublished application information in Patent Center is available to registered users. To file and manage patent submissions in Patent Center, visit: https://patentcenter.uspto.gov. Visit https://www.uspto.gov/patents/apply/patent-center for more information about Patent Center and https://www.uspto.gov/patents/docx for information about filing in DOCX format. For additional questions, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000.
/JERRY LIN/Primary Examiner, Art Unit 1685