DETAILED ACTION
Notice of Pre-AIA or AIA Status
The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA .
Introductory Remarks
In response to communications filed on 10 February 2026, claim(s) 1, 8, and 15 is/are amended per Applicant’s request. Claim(s) 21 and 22 is/are new. Therefore, claims 1-22 are presently pending in the application, of which, claim(s) 1, 8, and 15 is/are presented in independent form.
No IDS has been received since the mailing of the last Office action.
Examiner’s Note
The rejections below group claims that may not be identical, but whose language and scope are so substantively similar as to lend themselves to grouping, in the interests of clarity and conciseness. Any citation to the instant specification herein is made to the PGPub version (if applicable). The examiner notes that no statement has been entered regarding the inventorship of individual claims as required under 37 CFR 1.56, and therefore assumes that all claims have the same inventorship or are directed to inventions that were commonly owned as of the effective filing date of the invention.
Claim Rejections - 35 USC § 101
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-22 are rejected under 35 U.S.C. 101 because the claimed invention is directed to an abstract idea without significantly more. The claim(s) recite(s) mental process steps of processing data to determine a match score and use that score for string alignment.
The additional elements in the claim are: “computer-implemented method” (claim 1), “by a sequence alignment algorithm executing within a computer system” (claims 1, 8, and 15), “similarity matrix maintained within the computer system” (claims 1, 8, and 15), “training a number of machine learning models for sequence alignment using a training dataset that comprises determined alignment between the pair of strings based on the combined score” (claims 1, 8, and 15), “computer system” (claim 8), “a hardware processor” (claim 8), “computer program product” (claims 15-20), and “a computer readable storage media” (claim 15). The judicial exception is not integrated into a practical application because the additional elements amount to nothing more than generic components recited at a high-level of generality such that it amounts to no more than mere instructions to apply the exception using generic computer components. See MPEP 2016.04(d)(I) and 2106.05(f).
When determining whether a claim simply recites a judicial exception with the words “apply it” (or an equivalent), such as mere instructions to implement an abstract idea on a computer, examiners may consider: (1) whether the claim recites only the idea of a solution or outcome i.e., the claim fails to recite details of how a solution to a problem is accomplished; (2) whether the claim invokes computers or other machinery merely as a tool to perform an existing process; and (3) the particularity or generality of the application of the judicial exception. See MPEP 2106.05(f). With respect to the “training a number of machine learning models of an artificial intelligence system…” additional element, there are no details about particular machine learning models or how the machine learning models operate to train for sequence alignment other than that it is being used to do so. The machine learning models are used to generally apply the abstract idea without placing any limitation on how the models operate to determine sequence alignment as a function of the training dataset. See generally instant specification at 0057 and 0059.The independent claims omit any details as to how the models solve a technical problem, and instead the claims recite only the idea of a solution or outcome. Also, the claims invoke generic machine learning models merely as a tool for making the recited mathematical calculation rather than purporting to improve the technology or a computer. See MPEP 2106.05(f).
The independent claim(s) does/do not include additional elements that are sufficient to amount to significantly more than the judicial exception. As discussed above, the additional elements amount to nothing more than mere instructions to apply the exception using generic computer component(s). These cannot provide an inventive concept, and thus the claims are patent-ineligible.
Dependent claims 2, 9, and 16 merely recite further abstract idea limitations in the form of stating that matches are prevented in the middle of words, and further describing the structure of the similarity matrix. Dependent claims 3, 10, and 17 merely recite further abstract idea limitations in the form of establishing rules that prevent the middle of word matches of claims 2, 9, and 16. Dependent claims 4, 11, and 18 merely recite further abstract idea limitations in the form of stating that the match boundaries are set at space or the ends of strings, which is reiterating what is stated in claims 2, 9, and 16. Dependent claims 5, 12, and 19 merely recite further abstract idea limitations in the form of stating that match scores are normalized. Dependent claims 7 and 14 merely recite the outcome of use of the abstract idea. Dependent claim 21 adds retraining of the machine learning models, which does not amount ot anything more than the abstract idea in a generic computing environment. See Recentive Analytics v. Fox Corp., 692 F.Supp.3d 438 (D. Del. 2023). Dependent claim 22 mirrors claim 21 but adds a limitation of receiving feedback related to accuracy of the string alignment determination, which is itself an abstract idea. Summarizing, these dependent claims add no additional elements to those previously identified for the independent claims. In view of this, these claims do not integrate the abstract idea into a practical application, nor do they amount to significantly more than the abstract idea.
Dependent claims 6, 13, and 20 provide the additional element of “at least one numeric library that supports multi-dimensional arrays along with a collection of high-level mathematical functions to operate on the multi-dimensional arrays”. Put plainly, these claims state that the algorithm is configured to interoperate with a numeric library that stores various data; this mere storage of data, nor the “interoperability” of the abstract idea with stored data, fail to amount to a practical application nor are they singularly, or in combination, significantly more than the abstract idea.
Response to Arguments
Applicant's arguments filed 10 February 2026 have been fully considered but they are not persuasive. Applicant cites to their specification and argues that, “an artificial intelligence system performing string alignment does not occur in the human mind. Hence, the claim cannot be directed to a mental process, and thus are not abstract.” The examiner agrees that an artificial intelligence system does not occur in the human mind, but mere recitation of such a system does not amount to a practical application of nor significantly more than the abstract idea. Recentive Analytics also dealt with an artificial intelligence system implementing an abstract idea. There, the court held that the claims at issue were “using a generic machine learning technique in a particular environment, with no inventive concept”. Recentive Analytics at 438. The same holds true for the claims at issue here. Therefore, the rejections are maintained.
Conclusion
Applicant's amendment necessitated the new ground(s) of rejection presented in this Office action. Accordingly, THIS ACTION IS MADE FINAL. See MPEP § 706.07(a). Applicant is reminded of the extension of time policy as set forth in 37 CFR 1.136(a).
A shortened statutory period for reply to this final action is set to expire THREE MONTHS from the mailing date of this action. In the event a first reply is filed within TWO MONTHS of the mailing date of this final action and the advisory action is not mailed until after the end of the THREE-MONTH shortened statutory period, then the shortened statutory period will expire on the date the advisory action is mailed, and any nonprovisional extension fee (37 CFR 1.17(a)) pursuant to 37 CFR 1.136(a) will be calculated from the mailing date of the advisory action. In no event, however, will the statutory period for reply expire later than SIX MONTHS from the mailing date of this final action.
Any inquiry concerning this communication or earlier communications from the examiner should be directed to TYLER J TORGRIMSON whose telephone number is (571)270-5550. The examiner can normally be reached Monday - Friday 9 am - 5:30 pm.
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, Aleksander Kerzhner can be reached at 571.270.1760. 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.
/TYLER J TORGRIMSON/ Primary Examiner, Art Unit 2165