Prosecution Insights
Last updated: April 19, 2026
Application No. 17/491,276

TECHNIQUES FOR ACCELERATING SMITH-WATERMAN SEQUENCE ALIGNMENTS

Final Rejection §101§112
Filed
Sep 30, 2021
Examiner
DHARITHREESAN, NIDHI
Art Unit
1686
Tech Center
1600 — Biotechnology & Organic Chemistry
Assignee
Nvidia Corporation
OA Round
2 (Final)
40%
Grant Probability
Moderate
3-4
OA Rounds
6y 2m
To Grant
78%
With Interview

Examiner Intelligence

Grants 40% of resolved cases
40%
Career Allow Rate
19 granted / 47 resolved
-19.6% vs TC avg
Strong +38% interview lift
Without
With
+37.6%
Interview Lift
resolved cases with interview
Typical timeline
6y 2m
Avg Prosecution
34 currently pending
Career history
81
Total Applications
across all art units

Statute-Specific Performance

§101
30.2%
-9.8% vs TC avg
§103
18.7%
-21.3% vs TC avg
§102
18.1%
-21.9% vs TC avg
§112
24.5%
-15.5% vs TC avg
Black line = Tech Center average estimate • Based on career data from 47 resolved cases

Office Action

§101 §112
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 . Applicant Response Applicant's response, filed 12/30/2025, has been fully considered. Rejections and/or objections not reiterated from previous Office Actions are hereby withdrawn. The following rejections and/or objections are either reiterated or newly applied. They constitute the complete set presently being applied to the instant application. Claim Status Claims 1-20 are pending and under examination herein. Claims 5, 10, 15 and 18 are objected to. Claims 1, 3-11, 13-14, 16-17 and 19-20 are rejected. Priority The instant application does not claim priority to another application. As such, the effective filing date assigned to each of claims 1-20 is 09/30/2021. Information Disclosure Statement The Information Disclosure Statements filed 12/24/2025 is in compliance with the provisions of 37 CFR 1.97 and have therefore been considered. A signed copy of the IDS is included with this Office Action. Drawings The drawings filed 09/30/2021 were accepted by the examiner in the office action mailed 10/01/2025. Claim Objections Claims 5, 10, 15 and 18 are objected to because of the following informalities: “the first instruction” and “the second instruction” should be “the first fused instruction” and “the second fused instruction”. Appropriate correction is required. Claim Rejections - 35 USC § 112 The rejections of claims 1-20 are rejected under 35 U.S.C. 112(b) are withdrawn in view of claim amendments filed 12/30/2025. Claim Rejections - 35 USC § 101 The rejections of claims 2, 12, 15, and 18 under 35 U.S.C. 101 are withdrawn in view of claims amendments filed 12/30/2025, which integrate the recited judicial exceptions into practical application. Specifically, the generation of sub-alignment data using fused instructions performed by a parallel processor and/or comprising SIMD instructions provide an improvement in computer technology by allowing for few instructions and fewer cycles relative to a conventional instruction sequence, as discloses in the instant specification para 0161-0163. 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, 3-11, 13-14, 16-17 and 19-20 remain rejected under 35 U.S.C. 101 because the claimed invention is directed to an abstract idea/law of nature/natural phenomenon without significantly more. In accordance with MPEP § 2106, claims found to recite statutory subject matter (Step 1: YES) are then analyzed to determine if the claims recite any concepts that equate to an abstract idea, law of nature or natural phenomenon (Step 2A, Prong 1). In the instant application, the claims recite the following limitations that equate to an abstract idea: Claims 1, 11 and 20 recite generating first sub-alignment data included in a first cell in a first array of cells based on second sub-alignment data included in a second cell in the first array of cells and a second array of cells; and generating third sub-alignment data included in a third cell in the first array of cells based on the first sub-alignment data included in the first cell and the second array of cells. Claims 6 and 16 recite further comprising …overwriting fourth sub-alignment data included in a fourth cell in the second array of cells with fifth sub-alignment data based on sixth sub-alignment data included in a fifth cell in the second array of cells and the first array of cells. Claims 8 recite further comprising: determining a maximum sub-alignment score and a predicate based on a first sub-alignment score included in the third sub- alignment data and a previous maximum sub-alignment score, wherein the predicate indicates that the first sub-alignment score is a source of the maximum sub-alignment score; and based on the predicate, setting a maximum scoring column position equal to a column position associated with the first sub- alignment score. These recitations equate to steps of collecting information, analyzing data and making observations, evaluations and judgements that can be carried out in the human mind. Specifically, executing instructions to generate or overwrite sub-alignment data included in arrays based on other sub-alignment data can be practically performing the human mind as claimed, and are similar to the concepts of collecting and comparing known information in Classen Immunotherapies, Inc. v. Biogen IDEC, 659 F.3d 1057, 1067, 100 USPQ2d 1492, 1500 (Fed. Cir. 2011) and collecting information, analyzing it, and reporting certain results of the collection and analysis in Electric Power Group v. Alstom, S.A., 830 F.3d 1350, 1353-54, 119 USPQ2d 1739, 1741-42 (Fed. Cir. 2016) that the courts have identified as concepts that can be practically performed in the human mind. Therefore, each of the above recited limitations fall under the “Mental Processes” grouping of abstract ideas. Furthermore, the steps of generating or overwriting sub-alignment data included in arrays based on other sub-alignment data when performing sub-alignment computation for a matrix-filling phase of a Smith-Waterman algorithm equate to organizing information and manipulating information through mathematical correlations and reciting a mathematical equation, similar to the concepts of taking existing information, manipulating the data using mathematical functions, and organizing this information into a new form in Digitech Image Techs., LLC v. Electronics for Imaging, Inc., 758 F.3d 1344, 1350, 111 USPQ2d 1717, 1721 (Fed. Cir. 2014). Therefore, these limitations fall under the “mathematical concepts” grouping of abstract ideas. Claims 3-5, 7, 9, 13, 17, and 19 further qualify the judicial exceptions. As such, claims 1, 3-11, 13-14, 16-17 and 19-20 recite an abstract idea (Step 2A, Prong 1: YES). Claims found to recite a judicial exception under Step 2A, Prong 1 are then further analyzed to determine if the claims as a whole integrate the recited judicial exception into a practical application or not (Step 2A, Prong 2). This judicial exception is not integrated into a practical application because the claims do not recite an additional element that reflects an improvement to technology, applies or uses the recited judicial exception to affect a particular treatment for a condition, implements a judicial exception with, or uses a judicial exception in conjunction with, a particular machine or manufacture that is integral to the claim, effects a transformation or reduction of a particular article to a different state or thing or applies or uses the judicial exception in some other meaningful way beyond generally linking the use of the judicial exception to a particular technological environment, such that the claim as a whole is more than a drafting effort designed to monopolize the exception. Rather, the instant claims recite additional elements that amount to mere data gathering and outputting and mere instructions to implement the abstract idea in a generic computing environment. Specifically, the claims recite the following additional elements: Claim 1 recites computer-implemented; execution of a first and second fused instruction,. Claim 11 recites one or more non-transitory computer readable media and one or more processors; execution of a first and second fused instruction. Claim 14 recites wherein the first array of cells is stored contiguously in a first register file. Claim 20 recites one or more memories storing instructions and one or more processors; . The execution of fused instructions is recited generically, and amounts to generally linking the use of a judicial exception to a particular technological environment or field of use (see MPEP 2106.05(h)). The claims merely recites using a generic computing systems and computer program products to carry out instructions to implement an abstract idea on a computer. The computer system and computer program product as claimed fails to recite details of how a solution to a problem is accomplished and only recites the idea of a solution or outcome. There are no limitations that indicate that the claimed steps require anything other than generic computing systems. As such, these limitations equate to mere instructions to implement the abstract idea on a generic computer that the courts have stated does not render an abstract idea eligible in Alice Corp., 573 U.S. at 223, 110 USPQ2d at 1983. See also 573 U.S. at 224, 110 USPQ2d at 1984. Furthermore, the use of a computer or other machinery in its ordinary capacity for economic or other tasks (e.g., to receive, store, or transmit data) or simply adding a general purpose computer or computer components after the fact to an abstract idea (e.g., a fundamental economic practice or mathematical equation) does not integrate a judicial exception into a practical application. See Affinity Labs v. DirecTV, 838 F.3d 1253, 1262, 120 USPQ2d 1201, 1207 (Fed. Cir. 2016) (cellular telephone); TLI Communications LLC v. AV Auto, LLC, 823 F.3d 607, 613, 118 USPQ2d 1744, 1748 (Fed. Cir. 2016) (computer server and telephone unit). Therefore, there is no indication that any of these additional elements provide a practical application of the recited judicial exception outside of the judicial exception itself. As such, claims 1, 3-11, 13-14, 16-17 and 19-20 are directed to an abstract idea (Step 2A, Prong 2: NO). Claims found to be directed to a judicial exception are then further evaluated to determine if the claims recite an inventive concept that provides significantly more than the judicial exception itself (Step 2B). Further analyzing the additional elements under step 2B, the additional elements as described above do not rise to the level of significantly more than the judicial exception. As directed in the Berkheimer memorandum of 19 April 2018 and set forth in the MPEP, determinations of whether or not additional elements (or a combination of additional elements) may provide significantly more and/or an inventive concept rests in whether or not the additional elements (or combination of elements) represents well-understood, routine, conventional activity. Said assessment is made by a factual determination stemming from a conclusion that an element (or combination of elements) is widely prevalent or in common use in the relevant industry, which is determined by either a citation to an express statement in the specification or to a statement made by an applicant during prosecution that demonstrates a well-understood, routine or conventional nature of the additional element(s); a citation to one or more of the court decisions as discussed in MPEP 2106(d)(II) as noting the well-understood, routine, conventional nature of the additional element(s); a citation to a publication that demonstrates the well-understood, routine, conventional nature of the additional element(s); and/or a statement that the examiner is taking official notice with respect to the well-understood, routine, conventional nature of the additional element(s). With respect to the instant claims under the 2B analysis, the use of a computer or other machinery in its ordinary capacity for economic or other tasks (e.g., to receive, store, or transmit data) or simply adding a general purpose computer or computer components after the fact to an abstract idea (e.g., a fundamental economic practice or mathematical equation) does not provide significantly more. See Affinity Labs v. DirecTV, 838 F.3d 1253, 1262, 120 USPQ2d 1201, 1207 (Fed. Cir. 2016) (cellular telephone); TLI Communications LLC v. AV Auto, LLC, 823 F.3d 607, 613, 118 USPQ2d 1744, 1748 (Fed. Cir. 2016) (computer server and telephone unit). As such, claims 1, 3-11, 13-14, 16-17 and 19-20 are not patent eligible under 35 U.S.C. 101. Response to Applicant’s Arguments Applicant states that the generation of any sort of data via execution of fused instruction cannot be practically performed in the human mind, and the use of fused instructions and SIMD instructions reflects an improvement in computer technology (Applicant’s Arguments, p 9, para 3p 12, para 3). It is respectfully submitted that this is not persuasive, as the claims are recited generically and do not recite multiple actions to be triggered by the execution of a single fused instruction. Therefore, the generation of step, as recited in the claims, recites a mental process, and the use of a fused instruction amounts to generally linking the use of a judicial exception to a particular technological environment or field of use, as discussed above. Furthermore, the arguments are not commensurate with the scope of the claims, as the claims do not all require the use of SIMD instructions. Therefore, there is no indication that any of these additional elements provide a practical application of the recited judicial exception outside of the judicial exception itself and claims 1, 3-11, 13-14, 16-17 and 19-20 are directed to an abstract idea. Prior Art Claims 1-20 appear to be free of prior art as the closest prior art to Koliogeorgi et al. (2019 29th International Conference on Field Programmable Logic and Applications (FPL) 2019, pp. 74-80. IEEE; previously cited; hereafter referred to as Koliogeorgi), Fei et al. (Interdiscip Sci Comput Life Sci 2018, 10, 176–188; previously cited; hereafter referred to as Fei), and Zhao et al. (PLoS ONE 2013, 8(12), e82138, pp 1-7; previously cited; hereafter referred to as Zhao) does not appear to teach or disclose executing a first instruction to generate first sub-alignment data included in a first cell in a first array of cells based on second sub-alignment data included in a second cell in the first array of cells and a second array of cells; and executing a second instruction to generate third sub-alignment data included in a third cell in the first array of cells based on the first sub-alignment data included in the first cell and the second array of cells. Koliogeorgi teaches dataflow acceleration of Smith-waterman and discloses optimizing the architecture using an interleaving data schemes which would operate in a round robin manner to compute the latency anti-diagonals of which corresponds to ta similarity matrix of a difference read-reference pair and affects the layout of the skewed matrix while preserving the skewed layout (title; abstract; p 3, col 1, para 3-p 4, col 1, para 1; fig 5). Fei discloses fine-grained parallelized SW algorithms using affine gap penalty and implement a parallel computing structures to accelerating the SW with backtracking on FPGA platform and using a wavefront approach with a linear systolic computing array in which each anti-diagonal is computed in parallel with a linear PE array (abstract; p 179, col 2, para 3-p 180, col 2, para 1). Zhao discloses a new method to generate the full optimal alignment results and a suboptimal score in linear space at little cost of efficiency and a C/C++ library, which extends Farrar’s Striped Smith-Waterman (SSW) to return alignment information in addition to the optimal Smith-Waterman score, and further discloses that they “record the optimal alignment ending positions during the SIMD SW calculation and generate the detailed alignment by a reversed SIMD SW and a banded SW. When the score matrix is filled by the SIMD SW calculation, we store the maximal score of each column in a “max” array and record the complete column that has the maximal score of the whole matrix. Next, we locate the optimal alignment ending position on the reference and the query by seeking the maximal score in the array and the recorded column respectively. The reversed SIMD SW locates the best alignment beginning position from the ending position by calculating a much smaller scoring matrix. Then, the banded SW (whose band is defined by the beginning and ending positions) generates the detailed alignment” (abstract; p 5, col 1, para 2-col 2, para 1). However, Koliogeorgi, Fei, and Zhao appear to be silent on the execution of the first and second instructions to generate the first and third sub-alignment data as recited in the instant claims. Conclusion No claims allowed. THIS ACTION IS MADE FINAL. 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. Inquiries Any inquiry concerning this communication or earlier communications from the examiner should be directed to NIDHI DHARITHREESAN whose telephone number is (571)272-5486. The examiner can normally be reached Monday - Friday 9:00 - 5:00. 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, Larry D Riggs II can be reached at (571) 270-3062. 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. /N.D./ Examiner, Art Unit 1686 /Karlheinz R. Skowronek/ Supervisory Patent Examiner, Art Unit 1687
Read full office action

Prosecution Timeline

Sep 30, 2021
Application Filed
Sep 29, 2025
Non-Final Rejection — §101, §112
Dec 10, 2025
Interview Requested
Dec 18, 2025
Examiner Interview Summary
Dec 18, 2025
Applicant Interview (Telephonic)
Dec 30, 2025
Response Filed
Mar 18, 2026
Final Rejection — §101, §112 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12597483
MOLECULAR DOCKING METHOD AND APPARATUS BASED ON COHERENT ISING MACHINE
2y 5m to grant Granted Apr 07, 2026
Patent 12586688
INFORMATION PROCESSING SYSTEM, INFORMATION PROCESSING METHOD, AND RECORDING MEDIUM
2y 5m to grant Granted Mar 24, 2026
Patent 12476009
IMMUNE AGE AND USE THEREOF
2y 5m to grant Granted Nov 18, 2025
Patent 12400739
OLIGONUCLEOTIDE-BASED MACHINE LEARNING
2y 5m to grant Granted Aug 26, 2025
Patent 12360113
METHOD OF PROGNOSIS AND FOLLOW UP OF PRIMARY LIVER CANCER
2y 5m to grant Granted Jul 15, 2025
Study what changed to get past this examiner. Based on 5 most recent grants.

AI Strategy Recommendation

Get an AI-powered prosecution strategy using examiner precedents, rejection analysis, and claim mapping.
Powered by AI — typically takes 5-10 seconds

Prosecution Projections

3-4
Expected OA Rounds
40%
Grant Probability
78%
With Interview (+37.6%)
6y 2m
Median Time to Grant
Moderate
PTA Risk
Based on 47 resolved cases by this examiner. Grant probability derived from career allow rate.

Sign in with your work email

Enter your email to receive a magic link. No password needed.

Personal email addresses (Gmail, Yahoo, etc.) are not accepted.

Free tier: 3 strategy analyses per month