Machine learning models for refining structural variant calls

Abstract

The present disclosure describes methods, non-transitory computer-readable media, and systems that can utilize machine learning models to refine structural variant calls of a call generation model. For example, the disclosed systems can train and utilize structural variant refinement machine learning models to reduce false positives and / or false negatives. Indeed, the disclosed systems can improve or refine structural variant calls (e.g., 50-200 base pairs in length) determined by a call generation model by training and utilizing structural variant refinement machine learning models. As disclosed, the systems can determine sequencing metrics and customize training data for the structural variant refinement machine learning models to generate revised structural variant calls.

Description

[Technical Field]

[0001] CROSS-REFERENCE TO RELATED APPLICATIONS This application claims the benefit of and priority to U.S. Provisional Application No. 63 / 377,846, entitled "MACHINE-LEARNING MODEL FOR REFINING STRUCTURAL VARIANT CALLS," filed September 30, 2022, which is incorporated herein by reference in its entirety. [Background technology]

[0002] In recent years, biotechnology companies and research institutions have improved the hardware and software for sequencing nucleotides and determining nucleotide base calls for genomic samples. For example, some existing sequencing machines and sequencing data analysis software (collectively "existing sequencing systems") predict individual nucleotide bases within a sequence by using traditional Sanger sequencing or sequencing-by-synthesis (SBS) methods. When using SBS, existing sequencing systems can monitor thousands of oligonucleotides being synthesized in parallel from a template to predict nucleotide base calls for the increasing number of nucleotide reads. In many existing sequencing systems, a camera captures images of illuminated fluorescent tags incorporated into the oligonucleotides. After capturing such images, some existing sequencing systems transmit the base call data to a computing device equipped with sequencing data analysis software that determines nucleotide base calls for nucleotide reads corresponding to the oligonucleotides and aligns the nucleotide reads to a reference genome. Based on the differences between the aligned nucleotide reads and the reference genome, existing systems can further utilize variant callers to identify variants in the genomic sample, such as single nucleotide polymorphisms (SNPs) and / or structural variants.

[0003] Despite these recent advances in sequencing and variant calling, existing sequencing systems often include variant callers that make inaccurate structural variant calls, particularly for structural variants within a threshold base pair length range (e.g., 50-200 base pairs). For example, many existing systems generate structural variant calls that contain an excessive number of false positive and / or false negative calls for structural variants within a threshold base pair length range. Contributing to this inaccuracy, some existing sequencing systems rely excessively on unreliable truth set data. For example, some existing systems perform variant calling and / or variant call filtering based on data containing certain discrepancies and errors (e.g., discrepant or error-prone read data or discrepant or error-prone reference data) from the sequencing process and / or variant calling model. In fact, industry standard or replacement truth set data (e.g., precision FDA truth set data or long-read data) contain errors or read coverage holes (albeit few in number), which can propagate and affect structural variant calling for existing systems trained on these data. As a result, over-reliance on such truth set data leads many existing systems to generate structural variant calls that contain an excessive number of false positive and / or false negative calls that could otherwise be reduced using more accurate systems. As described below, truth set data has proven particularly problematic for existing sequencing systems that determine structural variant calls of relatively small sizes within a threshold range of base pair lengths.

[0004] To exacerbate this inaccuracy in structural variant calling, some existing sequencing systems utilize models that require training on millions or billions of base call data that are either unavailable or incomplete. More specifically, some sequencing systems utilize deep learning models that require excessive amounts of training data to achieve acceptable accuracy measures. However, training data for structural variants is relatively limited across the industry, and training models using incomplete or unsubstantial data results in inaccurate and unreliable structural variant call predictions. Therefore, existing systems that rely on deep learning models often produce inaccurate structural variant calls, which can be particularly pronounced for structural variants of relatively small size within a threshold range of base pair lengths.

[0005] In addition to making inaccurate structural variant calls, some existing sequencing systems also inefficiently waste computing resources by using overly complex models. Specifically, the structural variant callers of some existing sequencing systems are computationally expensive and slow. In fact, some existing sequencing systems utilize structural variant callers with deep learning architectures that require extensive computing resources (e.g., computing time, processing power, and memory) to train and apply. For example, some existing sequencing systems utilize deep learning architectures that consume a lot of time across multiple computing devices to generate structural variant calls for the sequence of a single sample, even after training.

[0006] A further drawback of existing sequencing systems with complex deep learning networks is that many such systems utilize model architectures that make the sequence data uninterpretable. More specifically, some existing deep neural networks for variant calling repeatedly transform and manipulate sequence data across various layers and neurons, transforming it from one uninterpretable latent vector to another, as the basis for generating structural variant calls. In many cases, the internal data of these deep neural networks is uninterpretable and cannot be used in any way outside of the neural network architecture itself. Summary of the Invention

[0007] The present disclosure describes embodiments of methods, non-transitory computer-readable media, and systems that can utilize machine learning models to correct or confirm structural variant calls of a call generation model. For example, the disclosed systems can train or utilize a structural variant refinement machine learning model to reduce false positive calls (e.g., structural variant calls where a structural variant is not present) and / or false negative calls (e.g., no structural variant calls where a structural variant is present). Indeed, the disclosed systems can determine sequencing metrics corresponding to initial structural variant calls and utilize a structural variant refinement machine learning model to determine the false positive likelihood that the initial structural variant call is false positive based on the sequencing metrics. Based on the false positive likelihood from the structural variant refinement machine learning model, the disclosed systems can correct or confirm structural variant calls (e.g., 50-200 base pairs in length) initially determined by the call generation model. As disclosed, the systems can also customize or correct training data for structural variants to train a structural variant refinement machine learning model to generate corrected structural variant calls. [Brief explanation of the drawings]

[0008] The detailed description refers to the drawings, which are briefly described below. [Figure 1] FIG. 1 shows a block diagram of a sequencing system including a call refinement system, according to one or more embodiments. [Figure 2] 1 shows an overview of a call refinement system that uses a structural variant refinement machine learning model to generate revised structural variant calls, according to one or more embodiments. [Figure 3] FIG. 1 shows an exemplary diagram of a call refinement system that determines and utilizes sequencing metrics used by a structural variant refinement machine learning model to generate false positive likelihoods, according to one or more embodiments. [Figure 4] 1 illustrates a call refinement system that utilizes a structural variant refinement machine learning model to generate false positive likelihoods and refine structural variant calls, according to one or more embodiments. [Figure 5] 1 shows an exemplary table of a call refinement system that utilizes a structural variant refinement machine learning model to improve the determination of false-positive structural variant calls, according to one or more embodiments. [Figure 6] FIG. 1 shows an exemplary diagram for training a structural variant refinement machine learning model, according to one or more embodiments. [Figure 7] 1 shows an exemplary chart illustrating the correction of truth data for training a structural variant refinement machine learning model, according to one or more embodiments. [Figure 8] 10 shows an example graph of results from cross-validation training across different training datasets, in accordance with one or more embodiments. [Figure 9] 1 shows an example graph comparing the performance of different architectures of a structural variant refinement machine learning model with the performance of a call generation model, according to one or more embodiments. [Figure 10] 1 shows an exemplary graph of importance measures for different sequencing metrics of a structural variant refinement machine learning model, according to one or more embodiments. [Figure 11]FIG. 1 shows a flowchart of a series of actions for generating revised structural variant calls utilizing a structural variant refinement machine learning model, according to one or more embodiments. [Figure 12] FIG. 1 illustrates a block diagram of an exemplary computing device for implementing one or more embodiments of the present disclosure. DETAILED DESCRIPTION OF THE INVENTION

[0009] The present disclosure describes embodiments of a call refinement system that utilizes a structural variant refinement machine learning model to generate and correct structural variant ("SV") calls for a genomic sample. In particular, the call refinement system can utilize the structural variant refinement machine learning model to update, recalibrate, or correct an initial structural variant call (e.g., having a length of 50-200 base pairs) generated by a call generation model. In some cases, the call refinement system determines or identifies specific sequencing metrics (e.g., from read data, reference data, and / or base call quality data) to input into the structural variant refinement machine learning model for generating structural variant calls. For example, the call refinement system determines various types of sequencing metrics, such as read-based sequencing metrics, reference-based sequencing metrics, and variant region quality sequencing metrics. The call refinement system can further train or apply the structural variant refinement machine learning model according to the sequencing metrics to generate corrected (or refined or calibrated) structural variant calls.

[0010] As just mentioned, in certain embodiments, the call refinement system refines structural variant calls, such as structural variant calls having base pairs below a threshold length (e.g., 200 base pairs or some other threshold) or having base pairs within a length window (e.g., 50-200 base pairs or some other window). To facilitate the generation of improved structural variant calls, in some embodiments, the call refinement system utilizes a structural variant refinement machine learning model specialized to generate or predict structural variant calls at genomic coordinates or regions of a genome sequence (e.g., a genomic sample). Based on its training, the structural variant refinement machine learning model is tuned to filter or refine initial structural variant calls (as generated by the call generation model) as a post-processing analysis. In filtering or improving structural variant calls, the call refinement system can improve the accuracy and quality of the calls by reducing the number of false positives and false negatives resulting from the structural variant calls of the call generation model.

[0011] As described above, in some embodiments, the call refinement system determines confirmed or revised structural variant calls based on sequencing metrics analyzed by the machine learning model. In particular, the call refinement system can extract, identify, or determine sequencing metrics to input into the structural variant refinement machine learning model, resulting in the model generating predicted structural variant calls. For example, the call refinement system can extract or determine sequencing metrics belonging to one or more categories, including 1) read-based sequencing metrics, 2) reference-based sequencing metrics, and 3) variant region quality sequencing metrics. To determine or extract such sequencing metrics, the call refinement system can select metrics associated with the reference genome, metrics associated with read data obtained via SBS sequencing, and / or metrics associated with the initial variant call obtained via a call generation model (e.g., the DRAGEN SV caller). Further details regarding determining sequencing metrics are provided below with reference to the figures.

[0012] As further noted, in certain implementations, the call refinement system generates one or more structural variant calls to correct or improve structural variant calls or variant call data fields in a variant call format ("VCF") file. More specifically, the call refinement system utilizes a structural variant refinement machine learning model to generate, from the sequencing metrics and the initial structural variant call, a false positive likelihood indicating the likelihood that the initial structural variant call (determined via the call generation model) is a false positive. From the false positive likelihood, the call refinement system can further determine a revised structural variant call, for example, by updating or revising the initial structural variant call to indicate whether the genomic coordinates associated with the call reflect a structural variant (according to the false positive likelihood).

[0013] In one or more embodiments, the call refinement system further determines or generates training data for training a structural variant refinement machine learning model. In particular, the call refinement system can modify the truth dataset to correct errors or discrepancies and use the corrected truth dataset as training data for the structural variant refinement machine learning model. In some cases, the call refinement system detects or identifies errors in the truth dataset and automatically corrects errors, such as missed (or incorrectly labeled) structural variant calls from a circular consensus sequencing (CCS) read-based SV caller. Using the corrected data for more accurate training, the call refinement system can train a structural variant refinement machine learning model for more accurate structural variant calling and reduce false positives and false negatives.

[0014] As alluded to above, the call refinement system provides several advantages, benefits, and / or improvements over existing sequencing systems, including SV callers and other sequencing data analysis software. For example, the call refinement system generates more accurate structural variant calls than existing sequencing systems. While some conventional sequencing systems generate structural variant calls inaccurately (especially for small-sized structural variants), the call refinement system trains or utilizes a structural variant refinement machine learning model to improve structural variant calling over conventional systems. Specifically, as described above, the call refinement system can correct the ground truth dataset to train the structural variant refinement machine learning model against more accurate training data, thereby generating more accurate structural variant calls (and reducing false positives and / or false negatives). Further contributing to improved accuracy in structural variant calling, the call refinement system determines and utilizes specific sequencing metrics (unlike conventional systems) as the basis for generating calls (e.g., as input data) via the structural variant refinement machine learning model.

[0015] To achieve the aforementioned accuracy improvements, as shown, the call refinement system utilizes an improved, unique machine learning model—a structural variant refinement machine learning model—that is trained to perform the new application. Unlike existing variant callers that generate nucleotide base calls from general sequencing data (without adjusting for or emphasizing whether a particular genomic coordinate has historically or been detected to exhibit a structural variant), the call refinement system utilizes a unique structural variant refinement machine learning model that generates specific variant call classifications for structural variants. In some cases, the call refinement system utilizes the structural variant refinement machine learning model as a post-processing filter to update structural variant calls generated by a call generation model from the same sequencing metrics (or a subset of the same sequencing metrics) used by the structural variant refinement machine learning model.

[0016] In addition to improving accuracy, in certain embodiments, the call refinement system improves computational efficiency and speed. As noted above, some existing sequencing systems utilize computationally expensive and slow neural network architectures (e.g., deep learning architectures such as convolutional neural networks) that require significant amounts of time (e.g., 5-8 hours to analyze base call data for a genomic sample using multiple processors running on a server) and extensive computational resources to implement and generate variant calls from a sequencing run. Such deep learning architectures can also require days (or weeks) to train. Conversely, the call refinement system utilizes a relatively lightweight and fast architecture for the structural variant refinement machine learning model. In contrast to the many hours across multiple processors required by existing sequencing systems, the call refinement system requires less than one hour of runtime (for both the call generation model and the structural variant refinement machine learning model) on a single field-programmable gate array or single processor to generate structural variant calls for a genomic sample. Thus, the call refinement system is much faster and computationally less expensive than many deep learning approaches to variant calling. Not only are the models of the Cole refinement system faster and less computationally expensive to implement than many existing deep learning systems, but the structural variant refinement machine learning models are also much faster and less computationally expensive to train than many existing deep learning systems.

[0017] Additionally, the machine learning architecture of the call refinement system can be trained using much less training data than the deep learning architecture of conventional systems. Such computationally lighter training is particularly important for structural variant calling, since the number of structural variants in a given genomic sample is relatively small (much smaller than the number of single nucleotide variants (or other variant types)). Thus, even with a limited amount of data for structural variant calling, the call refinement system can converge to accurate predictions, unlike conventional systems that require much more data and struggle to generate accurate predictions about structural variants.

[0018] As an additional advantage over existing sequencing systems, in certain implementations, the call refinement system can identify or facilitate modifications to individual sequencing metrics that affect the accuracy of structural variant calls. While the neural network architecture of many existing sequencing systems makes internal model data uninterpretable due to hidden latent features, the call refinement system utilizes a model architecture that facilitates interpretation of the effects of individual sequencing metrics. More specifically, in some cases, the call refinement system utilizes call generation models and structural variant refinement machine learning models (e.g., gradient boosting trees, random forest models) that enable extraction and analysis of individual sequencing metrics used throughout the process of generating a structural variant call. Indeed, the call refinement system can determine respective importance measures for the sequencing metrics involved in determining a structural variant call at a particular region of genomic coordinates.

[0019] As suggested by the foregoing discussion, the present disclosure utilizes various terms to describe the features and advantages of the call refinement system. Further details regarding the meaning of these terms as used in this disclosure are provided below. As used in this disclosure, for example, the terms "genomic sequence" or "sample sequence" refer to a sequence of nucleotides isolated or extracted from a sample organism (or a copy of such an isolated or extracted sequence). In particular, a genomic sequence is isolated or extracted from a sample organism and includes segments of nucleic acid polymers composed of nitrogenous heterocyclic bases. For example, a genomic sequence can include segments of deoxyribonucleic acid (DNA), ribonucleic acid (RNA), or other polymeric forms of nucleic acid or chimeric or hybrid forms of nucleic acids described below. More specifically, in some cases, the genomic sequence is one found in a sample prepared or isolated by a kit and received by a sequencing instrument.

[0020] Relatedly, as used herein, the term "genomic sample" refers to a target genome or portion of a genome that is subjected to assay or sequencing. For example, a genomic sample includes one or more sequences of nucleotides (or copies of such isolated or extracted sequences) isolated or extracted from a sample organism. In particular, a genomic sample includes the entire genome isolated or extracted (in whole or in part) from a sample organism and composed of nitrogenous heterocyclic bases. For example, a genomic sample can include segments of deoxyribonucleic acid (DNA), ribonucleic acid (RNA), or other polymeric forms of nucleic acid or chimeric or hybrid forms of nucleic acids as described below. In some cases, a genomic sample is one that is prepared or isolated by a kit and found in a sample received by a sequencing instrument.

[0021] As further used herein, the term "structural variant" refers to a variation in the structure of an organism's chromosome (e.g., a deletion, insertion, translocation, inversion) or a variation to the nucleotide sequence of an organism's chromosome. In some cases, a structural variant includes a variation to a threshold number of base pairs (e.g., >50 base pairs) within an organism's chromosome. Thus, in certain implementations, a structural variant includes an insertion or deletion exceeding a threshold number of base pairs, a duplication exceeding a threshold number of base pairs, an inversion, a translocation, or a copy number variation (CNV). While the present disclosure describes some examples of 50 base pairs as the threshold number of base pairs, in some embodiments, the threshold number of base pairs for a structural variant may be different, such as 35, 45, 100, or 1,000 base pairs.

[0022] Relatedly, the term "small-sized structural variants" refers to structural variants having a size or length below a threshold number of base pairs (e.g., 200, 300, 500, or some other threshold). For example, small-sized structural variants can include structural variants within a window or size range of 50 to 200 base pairs (or within some other window with different upper and lower thresholds, such as 100 to 200 base pairs). Along these lines, the term "structural variant call" (e.g., "small-sized structural variant call") refers to the determination or prediction of a structural variant for one or more genomic coordinates of a genomic sample. For example, structural variant calls can be predicted or determined by one or more sequencing processes via call-generation models and / or utilizing structural variant refinement machine learning models.

[0023] Additionally, as used herein, the term "nucleotide read" refers to the deduced sequence of one or more nucleotide bases (or nucleotide base pairs) from all or a portion of a sample nucleotide sequence (e.g., a sample's genomic sequence, cDNA). In particular, a nucleotide read includes a determined or predicted sequence of nucleotide base calls for a nucleotide fragment (or a group of monoclonal nucleotide fragments) from a library fragment of the sample corresponding to the genomic sample. For example, a sequencing instrument determines a nucleotide read by generating nucleotide base calls for nucleotide bases that have passed through a nanopore in a nucleotide sample slide, determined via fluorescent tagging, or determined from a well in a flow cell.

[0024] As described above, in some embodiments, the call refinement system determines sequencing metrics for generating structural variant calls. As used herein, the term "sequencing metrics" refers to quantitative measures or scores that indicate the degree to which one or more nucleotide base calls (e.g., nucleotide base predictions at each genomic coordinate) align, compare, or quantify with respect to genomic coordinates or genomic regions of a reference genome, with respect to nucleotide base calls from nucleotide reads, or with respect to external genome sequencing or genomic structure. For example, sequencing metrics include quantitative measures or scores that indicate (i) the degree to which individual nucleotide base calls from nucleotide reads align, map, or cover genomic coordinates or reference bases of a reference genome, (ii) the degree to which nucleotide base calls compare with reference or alternative nucleotide reads in terms of mapping, mismatches, base call quality, or other raw sequencing metrics, or (iii) the degree to which genomic coordinates or regions corresponding to nucleotide base calls demonstrate mappability, repetitive base call content, DNA structure, or other generalized metrics. In some embodiments, the sequencing metrics are inputs to a machine learning model from which the machine learning model can generate predictions of nucleotide base calls, including structural variant calls. Indeed, any of the sequencing metrics described herein can be inputs for a structural variant refinement machine learning model.

[0025] Indeed, in certain embodiments, sequencing metrics can be categorized into different sequencing metric categories for quantitative measurements, including: (i) "read-based sequencing metrics" that are derived from nucleotide reads and indicate the extent to which nucleotide base calls from a nucleotide read (or one or more nucleotide reads) compare to a reference or alternative nucleotide base with respect to mapping, mismatches, base call quality, or other raw sequencing metrics; (ii) "variant region quality sequencing metrics" that indicate the extent to which nucleotide base calls at genomic coordinates or regions corresponding to structural variants meet a read quality threshold (e.g., derived from nucleotide reads containing a threshold number of base calls) or a base call quality threshold (e.g., a threshold Q-score); or (iii) "reference-based sequencing metrics" that indicate the extent to which genomic coordinates or regions corresponding to nucleotide base calls demonstrate mappability, repetitive base call content (e.g., G-quadruplex), permutation entropy, DNA structure, or other generalized metrics.

[0026] In some cases, the variant region quality sequencing metric refers to a particular score or other measure that indicates the accuracy of a nucleotide base call. In particular, the base call quality metric includes a value that indicates the likelihood that one or more predicted nucleotide base calls for a genomic coordinate will contain an error. For example, in certain implementations, the base call quality metric can include a Q score (e.g., a Phred quality score) that predicts the probability of error for any given nucleotide base call. By way of example, the quality score (or Q score) can indicate that the probability of an incorrect nucleotide base call at a genomic coordinate is equal to 1 in 100 for a Q20 score, 1 in 1,000 for a Q30 score, 1 in 10,000 for a Q40 score, etc.

[0027] Relatedly, in some embodiments, the call refinement system can generate sequencing metrics through modification or updating of previous metrics, such as re-engineered sequencing metrics. Indeed, as used herein, the term "re-engineered sequencing metrics" refers to sequencing metrics that have been updated, modified, augmented, improved, or re-engineered to measure or compare nucleotide base calls (e.g., nucleotide base calls or variant calls for a read) with respect to other nucleotide base calls (standards or references) or targeted for a particular purpose or task. For example, re-engineered sequencing metrics can include modifications to raw sequencing metrics or combinations of raw sequencing metrics. In some embodiments, for example, the call refinement system generates one or more of read-based sequencing metrics, reference-based sequencing metrics, and / or variant region quality sequencing metrics as re-engineered sequencing metrics. In some cases, re-engineered sequencing metrics refer to sequencing metrics that are generated by the call refinement system and are therefore proprietary to or internal to the call refinement system and are not available to third-party systems. Exemplary re-engineered sequencing metrics include comparative mapping quality distribution metrics that indicate a comparison between mapping quality distributions associated with the reference sequence and the alternative contiguous sequences, or comparative base quality metrics that indicate a comparison between the base qualities of the reference sequence and the alternative contiguous sequences.

[0028] As further used herein, the term "genomic coordinate" (or sometimes simply "coordinate") refers to a specific location or position of a nucleotide base within a genome (e.g., the genome of an organism or a reference genome). In some cases, a genomic coordinate includes an identifier for a specific chromosome of a genome and an identifier for a nucleotide base position within the specific chromosome. For example, a genomic coordinate(s) may include a number, name, or other identifier for a chromosome (e.g., chr1 or chrX) and a specific position(s), such as a numbered position following the identifier for the chromosome (e.g., chr1:1234570 or chr1:1234570-1234870). Furthermore, in certain implementations, a genomic coordinate refers to the source of a reference genome (e.g., mt:16568 for a mitochondrial DNA reference genome, or SARS-CoV-2:29001 for a reference genome of the SARS-CoV-2 virus) and the nucleotide base position within the source for the reference genome (e.g., mt:16568 or SARS-CoV-2:29001). In contrast, in certain cases, genomic coordinates refer to the position of a nucleotide base within a reference genome, without reference to a chromosome or source (e.g., 29727).

[0029] As described above, genome coordinates include locations within a reference genome. Such locations may be within a particular reference genome. As used herein, the term "reference genome" refers to a digital nucleic acid sequence assembled as a representative example (or multiple representative examples) of an organism's genes and other genetic sequences. Regardless of sequence length, in some cases, a reference genome represents an exemplary set of genes or a set of nucleic acid sequences in a digital nucleic acid sequence determined by scientists as representative of a particular species of organism. For example, a linear human reference genome may be GRCh38 from the Genome Reference Consortium or another version of the reference genome. GRCh38 may include alternative contiguous sequences representing alternative haplotypes, such as SNPs and small indels (e.g., 10 base pairs or less, 50 base pairs or less). While GRCh38 may include alternative contiguous sequences representing alternative haplotypes, such as SNPs and small indels (e.g., 10 base pairs or less, 50 base pairs or less), GRCh38 includes alternative haplotypes with limited representation of population structural variants. Indeed, the structural variants represented in GRCh38 include only those represented by the 11 individuals for which library GRCh38 was constructed. As a further example, a reference genome can include a graph reference genome (e.g., Illumina DRAGEN Graph Reference Genome hg19) that includes both a linear reference genome and alternative paths representing alternative contiguous sequences or nucleic acid sequences from ancestral haplotypes.

[0030] Additionally, as used herein, the term "graph reference genome" refers to a reference genome that includes both a linear reference genome and alternative contiguous sequences (or graph extensions) that represent haplotypes or other alternative nucleic acid sequences. For example, a graph reference genome can include a linear reference genome and alternative contiguous sequences that correspond to one or more population haplotype sequences identified from a genome sample database. As an example, a graph reference genome can include the Illumina DRAGEN Graph Reference Genome hg19.

[0031] As further used herein, the term "contiguous sequence" (or "contig assembly") refers to a consensus nucleotide sequence for a genomic region of a genomic sample (or multiple genomic samples of a species) based on a set of overlapping nucleotide segments corresponding to the genomic region. In particular, a contiguous sequence includes a consensus nucleotide sequence for a genomic region of one or more genomic samples based on nucleotide reads for one or more genomic samples that cover (or overlap with) the genomic region. As noted above, the terms "contiguous sequence" and "contig assembly" may be used interchangeably.

[0032] Relatedly, the term "alternate contig" (or simply "alternate contig") refers to a contiguous sequence representing a population haplotype that has been added to (e.g., lifted over to) a linear reference genome (or other reference genome) at a particular genomic coordinate or genomic coordinates. In some implementations, a graph reference genome may include alternative contiguous sequences mapped to genomic coordinates of a primary assembly for a linear reference genome. For example, an alternative contiguous sequence may represent a population haplotype that includes a structural variant with liftover to two or more genomic coordinates in the linear reference genome corresponding to two or more sides of the structural variant breakend. In some cases, the hash table of the graph reference genome includes identifiers that associate alternative contiguous sequences representing structural variant haplotypes with genomic coordinates representing reference haplotypes from the primary assembly of the linear reference genome.

[0033] As further used herein, the term "alignment score" refers to a numerical score, metric, or other quantitative measure that evaluates the accuracy of an alignment between a nucleotide read (or a fragment of a nucleotide read) and another nucleotide sequence from a reference genome. In particular, an alignment score includes a metric that indicates the degree to which nucleotide bases of a nucleotide read (or a fragment of a nucleotide read) match or resemble a reference sequence or an alternative contiguous sequence from a reference genome. In certain implementations, the alignment score takes the form of a Smith-Waterman score, or a variation or version of a Smith-Waterman score (e.g., various settings or configurations used by DRAGEN by Illumina, Inc. for Smith-Waterman scoring), for the local alignment.

[0034] As alluded to above, the call refinement system can utilize machine learning models to refine or update structural variant calls. As used herein, the term "machine learning model" refers to a computer algorithm or collection of computer algorithms that automatically improves for a particular task through experience based on the use of data. For example, a machine learning model can utilize one or more learning techniques to improve accuracy and / or effectiveness. Exemplary machine learning models include various types of decision trees, support vector machines, Bayesian networks, or neural networks. In some cases, the structural variant refinement machine learning model is a series of gradient boosting decision trees (e.g., the XGBoost algorithm), while in other cases, the structural variant refinement machine learning model is a random forest model, a multilayer perceptron, linear regression, a support vector machine, a deep table learning architecture, a deep learning transformer (e.g., a self-attention-based table transformer), or logistic regression.

[0035] In some cases, the call refinement system utilizes a structural variant refinement machine learning model to correct or update structural variant calls (e.g., small-sized structural variant calls) based on sequencing metrics. As used herein, the term "structural variant refinement machine learning model" refers to a machine learning model that generates variant call classifications. For example, in some cases, the structural variant refinement machine learning model is trained to generate a false positive likelihood, which indicates the likelihood or probability that a structural variant call is false positive, based on sequencing metrics. In certain embodiments, the structural variant refinement machine learning model includes multiple submodels or operates in conjunction with another structural variant refinement machine learning model. As described further below, in some embodiments, the structural variant refinement machine learning model generates a likelihood score, based on one or more sequencing metrics and / or initial structural variant calls, that indicates a likelihood (e.g., a value between 0 and 1) that indicates the likelihood that a particular structural variant is present at one or more genomic coordinates of a genomic sample. For example, in certain embodiments, the structural variant refinement machine learning model generates a likelihood score based on one or more sequencing metrics and / or initial structural variant calls as inputs, which is used as a posterior genotype likelihood (e.g., a PHRED-scaled genotype likelihood) on which the structural variant call is determined.

[0036] As mentioned above, in some embodiments, the structural variant refinement machine learning model may be a neural network. The term "neural network" refers to a machine learning model that can be trained and / or adjusted based on inputs to determine classification or approximate unknown functions. For example, a neural network includes a model of interconnected artificial neurons (e.g., organized into layers) that learn to communicate, approximate complex functions, and generate outputs (e.g., generated digital images) based on multiple inputs provided to the neural network. In some cases, a neural network refers to an algorithm (or set of algorithms) that implements deep learning techniques to model high-level abstractions in data. For example, a neural network may include a convolutional neural network, a recurrent neural network (e.g., LSTM), a graph neural network, a self-attention transform neural network, or a generative adversarial neural network.

[0037] As further used herein, the term "false positive likelihood" refers to the likelihood that a variant call is a false positive call. In particular, the false positive likelihood includes the likelihood (e.g., a value between 0 and 1) that an initial structural variant call determined by a call generation model is a false positive structural variant call. In some cases, the false positive likelihood can be expressed as a likelihood score that an initial structural variant call (or a structural variant call of a particular type or length) is present, or as a false positive structural variant call. For example, in some embodiments, the false positive likelihood can be used as a posterior genotype likelihood (e.g., a PHRED-scale genotype likelihood) from which a structural variant call is determined. Thus, in some embodiments, the structural variant refinement machine learning model generates a likelihood score (e.g., a value between 0 and 1) that indicates the likelihood that a particular structural variant is present at one or more genomic coordinates of a genomic sample. As indicated above, the term "structural variant false positive likelihood" can be used interchangeably with "false positive likelihood" in this disclosure. In some cases, the false positive likelihood includes the likelihood that the initial structural variant call is a false positive call versus a true positive call based on sequencing metrics.

[0038] As described above, in some embodiments, the call refinement system modifies data fields corresponding to a variant call file. As used herein, the term "variant call file" refers to a digital file that indicates or represents one or more nucleotide base calls (e.g., variant calls) compared to a reference genome, along with other information about the nucleotide base calls (e.g., variant calls). For example, a variant call format (VCF) file refers to a text file format that contains information about variants at specific genomic coordinates, including a meta-information row, a header row, and data rows, each data row having information about a single nucleotide base call (e.g., a single variant). As described further below, the call refinement system can generate different versions of a variant call file, including a pre-filter variant call file that contains variant nucleotide base calls that either pass or do not pass a quality filter for a base call quality metric, or a post-filter variant call file that contains variant nucleotide base calls that pass a quality filter but exclude those that do not pass the quality filter.

[0039] As described above, in some embodiments, the call refinement system utilizes a call generation model to generate nucleotide base calls for genomic coordinates. As used herein, the term "call generation model" refers to a probabilistic model that generates sequencing data from nucleotide reads of a genomic sequence, including nucleotide base calls, structural variant calls, and associated metrics. For example, in some cases, the call generation model refers to a Bayesian probability model that generates structural variant calls based on nucleotide reads of a genomic sequence. Such a model can process or analyze sequencing metrics corresponding to a read pileup (e.g., multiple nucleotide reads corresponding to a single genomic coordinate), including mapping quality, base quality, and various hypotheses including extraneous reads, missing reads, joint detection, etc. The call generation model may also include multiple components, including, but not limited to, different software applications or components for mapping and alignment, sorting, duplicate marking, calculation of read pileup depth, and variant calling. In some cases, the call generation model refers to an ILLUMINA DRAGEN model for structural variant calling and mapping and alignment functions.

[0040] The following paragraphs describe the call refinement system with reference to exemplary diagrams depicting example embodiments and implementations. For example, Figure 1 shows a schematic diagram of a computing system 100 on which a call refinement system 106 operates, according to one or more embodiments. As shown, computing system 100 includes one or more server devices 102 connected to client devices 108 and a sequencing device 114 via a network 112. While Figure 1 illustrates an embodiment of call refinement system 106, this disclosure below describes alternative embodiments and configurations.

[0041] 1, server device 102, client device 108, and sequencing device 114 can communicate with each other via network 112. Network 112 includes any suitable network with which computing devices can communicate. An exemplary network is discussed in more detail below with respect to FIG. 12.

[0042] As illustrated by FIG. 1 , the sequencing device 114 includes a device for sequencing nucleic acid polymers. In some embodiments, the sequencing device 114 analyzes nucleic acid segments or oligonucleotides extracted from a genomic sample to generate nucleotide reads or other data using computer-implemented methods and systems (described herein) either directly or indirectly on the sequencing device 114. More specifically, the sequencing device 114 receives and analyzes nucleic acid sequences extracted from the sample in a nucleotide sample slide (e.g., a flow cell). In one or more embodiments, the sequencing device 114 utilizes SBS to sequence the nucleic acid polymer into nucleotide reads. In some embodiments, the sequencing device 114 communicates directly with the client device 108, in addition to or as an alternative to communicating via the network 112, bypassing the network 112.

[0043] As further illustrated by Figure 1, server device 102 can generate, receive, analyze, store, and transmit digital data, such as data for determining base calls, structural variant calls, or data for sequencing nucleic acid polymers. As shown in Figure 1, sequencing device 114 can transmit call data from sequencing device 114 (and server device 102 can receive call data). Server device 102 can also communicate with client device 108. In particular, server device 102 can transmit to client device 108 data including variant call files or other information indicative of nucleotide base calls (e.g., structural variant calls or other variant calls), sequencing metrics, error data, or other metrics.

[0044] In some embodiments, server device 102 comprises a distributed collection of servers, where server device 102 includes several server devices distributed across network 112 and located at the same or different physical locations. Furthermore, server device 102 may include a content server, an application server, a communication server, a web hosting server, or another type of server. In some cases, server device 102 is located at the same physical location as sequencer 114.

[0045] 1 , the server device 102 can include a sequencing system 104. Generally, the sequencing system 104 analyzes call data, such as nucleotide base calls for nucleotide reads and sequencing metrics received from the sequencing device 114, to determine a nucleotide base sequence for a nucleic acid polymer. For example, the sequencing system 104 can receive raw data from the sequencing device 114 and determine a consensus nucleotide base sequence for a segment of a genome sample aligned with a reference genome. In some embodiments, the sequencing system 104 determines the sequence of nucleotide bases in DNA and / or RNA segments or oligonucleotides. In addition to processing and determining a sequence for a nucleic acid polymer, the sequencing system 104 also generates a variant call file indicating one or more nucleotide base calls and / or structural variant calls for one or more genomic coordinates or regions.

[0046] As just described and illustrated in FIG. 1 , the call refinement system 106 analyzes call data, such as sequencing metrics from the sequencing device 114, to determine structural variant calls for one or more genomic samples. In some cases, the call refinement system 106 includes a call generation model and a structural variant refinement machine learning model. In some embodiments, the call refinement system 106 determines sequencing metrics for a genomic sequence. Based on data derived or prepared from the sequencing metrics, the call refinement system 106 applies the call generation model to determine an initial structural variant call for the sample sequence corresponding to the genomic coordinate. The call refinement system 106 further utilizes the structural variant refinement machine learning model to generate modified / refined / updated structural variant calls corresponding to the initial structural variant calls. Based on such data, for example, the call refinement system 106 can update data fields corresponding to a variant call file to confirm or modify the structural variant calls to improve accuracy.

[0047] As further illustrated and shown in FIG. 1 , client device 108 can generate, store, receive, and transmit digital data. In particular, client device 108 can receive sequencing metrics from sequencing device 114. Additionally, client device 108 can communicate with server device 102 to receive variant call files containing structural variant calls and / or other metrics, such as base call quality scores, coverage depth, genotype index, and / or genotype quality. Accordingly, client device 108 can present or display information about the structural variant calls in a graphical user interface to a user associated with client device 108. For example, client device 108 can present an importance measure interface that includes a visualization or depiction of various importance measures associated with or attributable to individual sequencing metrics for a particular structural variant call.

[0048] 1 can include various types of client devices. For example, in some embodiments, client device 108 includes a non-mobile device, such as a desktop computer or server, or other type of client device. In yet other embodiments, client device 108 includes a mobile device, such as a laptop, tablet, mobile phone, or smartphone. Further details regarding client device 108 are discussed below with respect to FIG. 12.

[0049] 1 , the client device 108 includes a sequencing application 110. The sequencing application 110 can be a web application or a native application (e.g., a mobile application, a desktop application) that is stored and executed on the client device 108. The sequencing application 110 can include instructions that (when executed) cause the client device 108 to receive data from the call refinement system 106 and present data from a variant call file for display on the client device 108. Additionally, the sequencing application 110 can instruct the client device 108 to display a visualization of importance measures for sequencing metrics of structural variant calls.

[0050] 1 , call refinement system 106 may be located on client device 108 or on sequencing device 114 as part of sequencing application 110. Thus, in some embodiments, call refinement system 106 is implemented (e.g., located completely or partially) on client device 108. In yet other embodiments, call refinement system 106 is implemented by one or more other components of computing system 100, such as sequencing device 114. In particular, call refinement system 106 may be implemented in a variety of different ways across server device 102, network 112, client device 108, and sequencing device 114. For example, call refinement system 106 may be downloaded from server device 102 to client device 108 and / or sequencing device 114, with all or a portion of the functionality of call refinement system 106 being implemented on the respective devices within computing system 100.

[0051] 1 , computing system 100 includes database 116. Database 116 can store information such as variant call files, genome sequences, nucleotide reads, nucleotide base calls, structural variant calls, and sequencing metrics. In some embodiments, server device 102, client device 108, and / or sequencing device 114 communicate with database 116 (e.g., via network 112) to store and / or access information such as variant call files, genome sequences, nucleotide reads, nucleotide base calls, structural variant calls, and sequencing metrics. In some cases, database 116 also stores one or more models, such as structural variant refinement machine learning models and / or call generation models.

[0052] 1 illustrates components of computing system 100 communicating over network 112, in certain implementations, components of computing system 100 may also communicate directly with one another, bypassing network 112. For example, as previously mentioned, in some implementations, client device 108 may communicate directly with sequencing device 114. Additionally, in some embodiments, client device 108 communicates directly with call refinement system 106. Furthermore, call refinement system 106 may access one or more databases housed on or accessed by server device 102 or elsewhere within computing system 100.

[0053] As indicated above, the call refinement system 106 can utilize a structural variant refinement machine learning model to confirm an initial structural variant call or determine a revised structural variant call. In particular, the call refinement system 106 can utilize a call generation model to generate an initial structural variant call, and can confirm or refine the initial structural variant call using a structural variant refinement machine learning model that is specifically trained to reduce (e.g., minimize) false positives and false negatives based on certain sequencing metrics. Figure 2 shows an exemplary series of operations for utilizing a structural variant refinement machine learning model to determine a revised structural variant call or confirm an initial structural variant call, according to one or more embodiments. The description of Figure 2 provides an overview of generating a revised structural variant call or confirming an initial structural variant call, after which further details regarding the various operations are provided with reference to subsequent figures.

[0054] As illustrated in FIG. 2 , the call refinement system 106 can perform operation 202 to determine an initial structural variant call. In particular, the call refinement system 106 utilizes a call generation model to determine the initial structural variant call. For example, the call refinement system 106 utilizes the call generation model to process or analyze sequencing metrics and determine a structural variant call at one or more genomic coordinates of the genomic sample. For example, the call refinement system 106 applies several Bayesian probability models or algorithms to derive various probabilities for different nucleotide bases, quality metrics, mapping metrics, joint metrics, and other data occurring within the nucleotide reads of the genomic sample.

[0055] By utilizing a probabilistic model, the call refinement system 106 determines structural variant calls that indicate predicted structural variations for the genomic sample at one or more genomic coordinates compared to the reference genome. For example, the call refinement system 106 determines an initial structural variant call by determining one or more of: i) a deletion of more than a threshold number of base pairs, ii) an insertion of more than a threshold number of base pairs, iii) a duplication of more than a threshold number of base pairs, iv) an inversion, v) a translocation, or vi) a copy number variation (CNV). The call refinement system 106 can utilize a call generation model to generate multiple structural variant calls for different genomic coordinates or regions of the genomic sample compared to the reference genome.

[0056] In addition to determining initial structural variant calls, the call refinement system 106 can perform operation 206 to determine sequence metrics. More specifically, the call refinement system 106 can determine sequencing metrics from sequencing data associated with the nucleotide reads of the genomic sample, from reference data associated with a reference genome, and / or from call data associated with the structural variant calls (e.g., small-sized structural variant calls). For example, the call refinement system 106 determines sequencing metrics based on initial sequencing data from a sequencing device (e.g., sequencing device 114) and / or based on call data from a call generation model.

[0057] In some embodiments, the call refinement system 106 determines different types of sequencing metrics, including reference-based sequencing metrics, read-based sequencing metrics, and variant region quality sequencing metrics. In some cases, the call refinement system 106 determines reference-based sequencing metrics by analyzing genomic regions of a reference genome that correspond to genomic coordinates of a genomic sample (e.g., SV regions used as the basis for making structural variant calls). Such reference-based sequencing metrics may include, but are not limited to, i) tandem repeat length in nucleotide terms, ii) permutation entropy in nucleotide terms, iii) the presence of cytosine quadruplexes (C-quadruplexes), and / or iv) the presence of guanine quadruplexes (G-quadruplexes). Further details regarding various reference-based sequencing metrics are provided below with reference to subsequent figures.

[0058] As described above, the call refinement system 106 can also determine read-based sequencing metrics. For example, the call refinement system 106 can utilize a sequencer (e.g., sequencer 114) and / or a call generation model to determine read data associated with a genomic sample. In some cases, the call refinement system 106 utilizes the call generation model to determine initial structural variant calls for genomic regions of the genomic sample and further determine one or more sequencing metrics associated with the initial structural variant calls. Such read-based sequencing metrics may include, but are not limited to: i) one or more base call quality scores; ii) the percentage of nucleotide reads that support alternative contiguous sequences from the reference genome; iii) the number of split nucleotide reads from the nucleotide read that corresponds to the initial structural variant call; iv) the coverage depth of the nucleotide read that corresponds to the initial structural variant call; v) additional structural variant calls that are located within a threshold number of base pairs from the initial structural variant call within the genomic sample; vi) an alignment of the contiguous sequence corresponding to the nucleotide read with a reference sequence of the reference genome that has been corrected to include the structural variant that corresponds to the initial structural variant call; vii) a nucleotide-based deletion length based on one or more soft-clipped nucleotide reads; viii) the number of nucleotide reads that exhibit a mapping quality metric that does not meet a threshold mapping quality metric; ix) an insert size, which represents the length of the nucleotide read fragment that corresponds to the initial structural variant call; and / or x) a structural variant likelihood, which represents the ratio of the initial structural variant call to the reference call for one or more genomic coordinates based on the insert size.

[0059] Additionally, in certain embodiments, the call refinement system 106 determines variant region quality sequencing metrics. For example, the call refinement system 106 can utilize a sequencer (e.g., the sequencer 114) and / or a call generation model to determine variant region quality sequencing metrics associated with the genomic coordinates of the genomic sample and / or associated with the initial structural variant call. In some cases, the call refinement system 106 determines variant region quality sequencing metrics by determining information related to the predicted nucleotide base calls and / or structural variant calls (e.g., generated by the sequencer 114 and / or the call generation model). Such variant region quality sequencing metrics may include, but are not limited to, i) the number of nucleotide reads that include at least a threshold number of base calls and correspond to the target genomic region for the initial structural variant call, and / or ii) the number of nucleotide bases in alternative contiguous sequences from the reference genome for which the base calls for the nucleotide reads do not meet a threshold base call quality score.

[0060] Also as illustrated in FIG. 2 , in one or more embodiments, the call refinement system 106 performs operation 208 to generate a false-positive likelihood using a structural variant refinement machine learning model. In particular, the call refinement system 106 utilizes the structural variant refinement machine learning model to generate or predict a false-positive likelihood based on one or more sequencing metrics, including read-based sequencing metrics, reference-based sequencing metrics, and variant region quality sequencing metrics. For example, in some embodiments, the structural variant refinement machine learning model uses a series of gradient boosting trees to process or analyze sequencing metrics according to various internal weights or parameters, ultimately generating a false-positive likelihood that indicates the likelihood that the initial structural variant call (determined via operation 202) is a false positive. In some cases, the call refinement system 106 also trains the structural variant refinement machine learning model by adjusting one or more of its parameters according to training data generated by correcting errors in the ground truth dataset. Further details regarding the training and implementation of the structural variant refinement machine learning model to determine false positive likelihood are provided below with reference to subsequent figures.

[0061] As further illustrated in FIG. 2 , in one or more implementations, the call refinement system 106 performs operation 210 to determine a revised structural variant call. In particular, the call refinement system 106 determines the revised structural variant call based on the false-positive likelihood determined via operation 208. For example, the call refinement system 106 examines candidate loci (e.g., candidate genomic coordinates, candidate genomic regions) for potential structural variants generated by the call generation model that were dropped or not called in the VCF (e.g., based on a threshold base call quality score, a threshold mapping quality metric, or some other or additional filtering criteria). The call refinement system 106 determines a false-positive likelihood, which serves as a likelihood score indicating whether a candidate locus (e.g., a locus indicated as a potential structural variant but ultimately indicated by the call generation model as not reflecting a structural variant) should be called a structural variant. If the candidate locus is called as a structural variant, the call refinement system 106 corrects the false-negative call to a true-positive structural variant call.

[0062] Additionally or alternatively, in some embodiments, based on a false-positive likelihood that meets at least a threshold likelihood that the initial structural variant call is a false positive, the call refinement system 106 (i) corrects or amends a positive structural variant call that identifies the presence of a structural variant to a different variant call or reference call, or (ii) corrects or amends a negative structural variant call that identifies the absence of a structural variant to a positive structural variant call or reference call. Indeed, in some cases, the call refinement system 106 also (or alternatively) determines a false-negative likelihood (via a structural variant refinement machine learning model) that indicates the likelihood that the initial structural variant call is a false negative. The call refinement system 106 can further determine a corrected structural variant call based on the false-negative likelihood.

[0063] As an example of determining a corrected structural variant call, the call refinement system 106 determines a structural variant call for one or more genomic coordinates (e.g., chr1:49263256) that reflects a deletion by identifying a single G in the sample nucleotide sequence where a GTAAC is present in the reference sequence. As a further example, the call refinement system 106 determines a structural variant call representing an insertion at a set genomic coordinate (e.g., chr1:7602080) by identifying a sequence of at least 50 base pairs (or some other threshold number of base pairs) but not more than 200 base pairs (or some other threshold number of base pairs) in the genomic sample where such a sequence is not present in the reference genome.

[0064] As further shown in FIG. 2 , instead of determining a revised structural variant call, in some embodiments, the call refinement system 106 performs operation 212 of confirming the initial structural variant call. For example, if the false positive likelihood from the structural variant refinement machine learning model is below a threshold (e.g., below 0.50), the call refinement system 106 determines that the initial structural variant call from the call generation model is correct. Based on a false positive likelihood that does not meet at least the threshold likelihood that the initial structural variant call is false positive, for example, the call refinement system 106 (i) confirms a positive structural variant call identifying the presence of a structural variant, or (ii) confirms a negative structural variant call identifying the absence of a structural variant. In some cases, as alluded to above, the call refinement system 106 confirms a negative structural variant call for a candidate locus (e.g., a candidate genomic coordinate, a candidate genomic region) where the call generation model initially generated a candidate structural variant (or identified a potential structural variant), but the candidate locus is ultimately determined not to contain a structural variant. Based on the false positive likelihood from the structural variant refinement machine learning model where the initial structural variant call does not meet at least a threshold likelihood of being a false positive, the call refinement system 106 confirms the true negative structural variant call.

[0065] In one or more implementations, the call refinement system 106, while or in the process of determining an initial structural variant call (e.g., via operation 202), generates a false positive likelihood (e.g., via operation 208) and / or determines a revised structural variant call (e.g., via operation 210) or confirms the initial structural variant call (e.g., via operation 212). For example, the call refinement system 106 implements a structural variant refinement machine learning model and a call generation model simultaneously or in parallel to generate an initial structural variant call and a false positive likelihood for revising the initial structural variant call (e.g., based on one or more common sequencing metrics).

[0066] In some embodiments, the call refinement system 106 further modifies data fields corresponding to the variant call file of the initial structural variant call to generate a final or modified structural variant call (e.g., in a pre-filter or post-filter variant call file). In effect, the call refinement system 106 generates the final (e.g., refined) structural variant call based on a false-positive likelihood determined from some or all of the sequencing metrics processed by the call generation model (e.g., one or more of the same sequencing metrics used to generate the initial structural variant call). This simultaneous or parallel operation provides improved computational efficiency and increased speed to the refinement system 106 by recalibrating the nucleotide base calls as they are initially generated (rather than performing one operation before the other).

[0067] As further shown, the call refinement system 106 can repeat the process illustrated in Figure 2 for different genomic coordinates. For example, the call refinement system 106 can determine multiple initial structural variant calls at various genomic coordinates or genomic regions of the genomic sample. The call refinement system 106 can further determine sequencing metrics corresponding to the initial structural variant calls for the different genomic coordinates, generate false positive likelihoods, and determine revised structural variant calls for the genomic coordinates of the genomic sample (e.g., to correct one or more initial variant calls at various genomic coordinates or SV regions) or confirm the initial structural variant calls for the genomic coordinates.

[0068] As noted above, in certain described embodiments, the call refinement system 106 uses a structural variant refinement machine learning model to determine false positive likelihoods. In particular, the call refinement system 106 utilizes a structural variant refinement machine learning model to generate, determine, or predict false positive likelihoods based on sequencing metrics associated with one or more genomic coordinates, such as SV regions, of a genomic sample. Figure 3 shows an exemplary diagram of a call refinement system 106 utilizing a structural variant refinement machine learning model to generate false positive likelihoods, according to one or more embodiments.

[0069] As illustrated in FIG. 3 , the call refinement system 106 utilizes a sequencing device 302 (e.g., sequencing device 114) to determine base calls 305 for nucleotide reads of a genomic sample and sequencing metrics 304 corresponding to the base calls 305. For example, the call refinement system 106 determines a subset of read-based sequencing metrics based on the nucleotide reads that include the base calls 305. As noted above, the subset of read-based sequencing metrics may include base call quality scores for the base calls 305 or other sequencing metrics that are part of a base call (BCL) file generated by the sequencing device 302. In some cases, the call refinement system 106 further determines (or derives) a subset of variant region quality sequencing metrics from the read data determined via the sequencing device 302. For example, the subset of variant region quality sequencing metrics may include a count or number of nucleotide reads that include at least a threshold number of base calls and cover a target genomic region for a structural variant (e.g., a known structural variant that meets a particular allele frequency).

[0070] 3, the call refinement system 106 utilizes a call generation model 306 to further determine an initial structural variant call 308. Indeed, the call refinement system 106 utilizes the call generation model 306 to generate predictions about structural variants in the genomic sample based on the sequencing metrics 304 and / or other data from the sequencing device 302. The initial structural variant call 308 may include a positive structural variant call that identifies the presence of a structural variant or a negative structural variant call that identifies the absence of a structural variant. From the initial structural variant call 308 (and / or from other data associated with the call generation model 306), the call refinement system 106 further determines sequencing metrics 310, such as a subset of read-based sequencing metrics and a subset of variant region quality sequencing metrics.

[0071] To determine read-based sequencing metrics, the call refinement system 106 accesses, retrieves, acquires, determines, or generates nucleotide reads using the sequencing device 302. In particular, the call refinement system 106 determines nucleotide reads, including nucleotide base calls, for regions from a genomic sample (e.g., a sample nucleotide sequence). For example, the call refinement system 106 utilizes sequencing-by-synthesis (SBS) and / or Sanger sequencing techniques to generate multiple nucleotide reads and determine nucleotide base calls for oligonucleotide clusters from wells in a flow cell and / or via fluorescent tagging. More specifically, the call refinement system 106 utilizes cluster generation and SBS chemistry to sequence millions or billions of clusters in a flow cell. During SBS chemistry, for each cluster, the call refinement system 106 stores the nucleotide base calls from the nucleotide reads for each sequencing cycle via real-time analysis (RTA) software.

[0072] In some embodiments, as part of determining sequencing metrics 304, call refinement system 106 performs read processing and mapping. For example, call refinement system 106 utilizes RTA software to store base call data in the form of individual base call data files (or BCLs). In some cases, call refinement system 106 further converts the BCL files into sequence data (e.g., via BCL-to-FASTQ conversion). Additionally, call refinement system 106 identifies multiple-read coverage (e.g., read pileups) that include multiple nucleotide reads or nucleotide base calls corresponding to a single genomic coordinate or genomic region (or a single SV region).

[0073] In particular, in certain embodiments, the call refinement system 106 aligns nucleotide reads with a reference genome or receives information regarding read alignment. Specifically, the call refinement system 106 determines (or receives information indicating) which nucleotide bases of a given nucleotide read align with which genomic coordinates of a reference sequence. Different nucleotide reads have different lengths and contain different nucleotide bases. Thus, in some cases, the call refinement system 106 analyzes each nucleotide of each read to determine (or receives information indicating) where the read "fits" with respect to the reference genome (or other reference sequence), e.g., where bases in the read align with bases in the genome reference.

[0074] In certain embodiments, the call refinement system 106 performs additional statistical tests to determine or detect differences between the metrics associated with the reference nucleotide sequence and the sequencing metrics associated with the alternative contiguous sequences. Through these statistical tests, the call refinement system 106 re-operates the raw sequencing metrics to determine read-based sequencing metrics. In some cases, the call refinement system 106 determines or extracts raw sequencing metrics including one or more of: (i) alignment metrics to quantify the alignment of nucleotide reads (of a genomic sample) with genomic coordinates of a reference genome or another exemplary nucleotide sequence (e.g., a nucleotide sequence from an ancestral haplotype); (ii) depth metrics to quantify the depth of nucleotide base calls for nucleotide reads at genomic coordinates of a reference genome; or (iii) call quality metrics to quantify the quality of nucleotide base calls for nucleotide reads at genomic coordinates of a reference genome.

[0075] A. Read-Based Sequencing Metrics For example, as part of the read-based sequencing metrics, the call refinement system 106 determines a mapping quality metric (e.g., a MAPQ metric), a soft clipping metric, or other alignment metric that measures the alignment of the nucleotide read with the reference genome. In some embodiments, the call refinement system 106 determines the following read-based sequencing metrics: i) one or more base call quality scores, ii) the percentage of nucleotide reads that support alternative contiguous sequences from the reference genome, iii) the number of split nucleotide reads from the nucleotide read that corresponds to the initial structural variant call, iv) the coverage depth of the nucleotide read that corresponds to the initial structural variant call, v) additional structural variant calls that are located within a threshold number of base pairs from the initial structural variant call in the genomic sample, vi) an alignment of the contiguous sequence corresponding to the nucleotide read with a reference sequence of the reference genome that has been corrected to include the structural variant that corresponds to the initial structural variant call, vii) the deletion length in nucleotide bases based on one or more soft-clipped nucleotide reads, viii) the number of nucleotide reads that exhibit mapping quality metrics that do not meet a threshold mapping quality metric, and ix) the insert size, which represents the length of the nucleotide read fragment that corresponds to the initial structural variant call (e.g., the genomic coordinates of the SV region).

[0076] As just mentioned, in some embodiments, the call refinement system 106 re-operates certain raw sequencing metrics to generate read-based sequencing metrics that are more useful for comparing metrics associated with a reference nucleotide sequence with sequencing metrics associated with various supporting alternative contiguous sequences. For example, the call refinement system 106 determines various metrics for a genomic sample relative to a reference genome and further determines various metrics for the genomic sample relative to the alternative contiguous sequences. Additionally, in some embodiments, the call refinement system 106 performs a comparative analysis between metrics associated with the reference sequence and metrics associated with the alternative supporting reads of the alternative contiguous sequences.

[0077] For example, the call refinement system 106 compares how the nucleotide bases of a nucleotide read map to a reference sequence (e.g., a reference genome) with how the nucleotide bases map to various alternative contiguous sequences. In particular, in some cases, the call refinement system 106 determines a mapping quality (e.g., a MAPQ score) of the nucleotide reads mapped to the primary assembly of the reference genome and compares it to the mapping quality (e.g., a MAPQ score) of the nucleotide reads mapped to the alternative contiguous sequences. For example, the call refinement system 106 determines a mapping quality statistic that reflects differences in the distribution of reads supporting the primary assembly and reads supporting the alternative contiguous sequences.

[0078] The following paragraphs describe the above read-based sequencing metrics i) through x) in more detail, along with associated metrics. As noted above, in these and other cases, the call refinement system 106 determines a base call quality score for a base call within a nucleotide read. Specifically, the call refinement system 106 determines the probability of accuracy of a nucleotide base call of a nucleotide read (e.g., coded Phred+33). In some cases, the call refinement system 106 determines one or more base call quality scores, in the form of a DRAGEN QUAL score or Q score, for one or more nucleotide base calls. Additionally, the call refinement system 106 determines the percentage of nucleotide reads that support alternative contiguous sequences from the reference genome. For example, the call refinement system 106 determines the number of nucleotide reads that support (e.g., match or align with) alternative contiguous sequences of the reference genome and the number of nucleotide reads that support a primary assembly within the reference genome. The call refinement system 106 compares the aforementioned numbers and further determines a percentage to reflect the comparison.

[0079] In some cases, the call refinement system 106 utilizes certain features to determine the percentage of reads that support the alternative contiguous sequence, including: i) an alignment score with respect to the reference genome, ii) an alignment score with respect to the assembly of the alternative contiguous sequence, iii) the mapping quality of the nucleotide reads, and iv) the amount of overlap with the SV genome region. Further, the call refinement system 106 can classify reads based on their alignment according to the following categories: i) perfect alignment with the assembly of the alternative contiguous sequence (e.g., meeting a first alignment score threshold), ii) perfect alignment with the reference genome, iii) strong alignment with the assembly of the alternative contiguous sequence (e.g., meeting a second alignment score threshold but not meeting the first alignment score threshold), iv) strong alignment with the reference genome (e.g., meeting a second alignment score threshold but not meeting the first alignment score threshold), and v) not strongly aligned to either the alternative contiguous sequence or the reference genome assembly (e.g., not meeting the second alignment threshold for both the alternative contiguous sequence and the reference genome assembly). Based on these five categories, the call refinement system 106 can further determine the proportions to compare for each of these categories to determine the proportion of nucleotide reads that support alternative contiguous sequences (e.g., the proportion of reads that overlap with the target genomic region) and the proportion of nucleotide reads that support the reference genome.

[0080] Additionally, the call refinement system 106 determines the number of split nucleotide reads from the nucleotide reads corresponding to the initial structural variant call as a read-based sequencing metric. More specifically, the call refinement system 106 determines the number of nucleotide reads that do not have a contiguous alignment with the primary assembly of the reference genome (or have less than a threshold number of aligning bases), but rather contain nucleotide read fragments that align with two or more reference sequences in the reference genome. For example, the call refinement system 106 uses the call generation model 306 to determine split read counts that support the genotype call. In the case of a heterozygous deletion call, a subset of false-positive cases have large split read counts that exceed those in the true-positive cases, along with higher-than-expected coverage depth. Therefore, the call refinement system 106 can generate split nucleotide read metrics based on the nucleotide reads that support the genotype call.

[0081] In some embodiments, the call refinement system 106 compares split read evidence supporting alternative alleles for forward and reverse nucleotide reads, respectively. If most of the evidence is from either forward or reverse reads, this bias may indicate a systematic problem, especially when read counts are relatively high (e.g., greater than 10 nucleotide reads). The call refinement system 106 uses forward and reverse read counts along with perfect alignment scores with contiguous sequences as sequencing metrics for structural variant refinement machine learning models.

[0082] Additionally, the call refinement system 106 can determine the coverage depth of nucleotide reads corresponding to the initial structural variant call as a read-based sequencing metric. For example, the call refinement system 106 determines the count or number of nucleotide reads that overlap with the target genomic region corresponding to the structural variant identified as present or absent by the initial structural variant call. Thus, coverage depth can be represented by the raw count of nucleotide reads that overlap with the target genomic region by at least a threshold number of nucleotide bases.

[0083] Additionally, the call refinement system 106 can determine, as part of the read-based sequencing metrics, additional structural variant calls within a threshold number of base pairs from the initial structural variant call in the genomic sample. For example, the call refinement system 106 determines structural variant calls (e.g., small-sized structural variant calls) such as insertions or deletions within a threshold vicinity (e.g., within 200 base pairs) of the initial structural variant call 308. Thus, the call refinement system 106 can indicate the presence or absence of such additional structural variant calls using a code, such as a binary code of 0 representing absence and 1 representing presence.

[0084] In some embodiments, the call refinement system 106 further determines, as a read-based sequencing metric, an alignment of a contiguous sequence corresponding to the nucleotide read with a reference sequence of a reference genome that has been modified to include the structural variant corresponding to the initial structural variant call. In particular, the call refinement system 106 modifies the reference genome by changing the nucleotide base to reflect the structural variant while excluding SNPs and indels in the adjacent regions. In theory, the modified reference genome can be perfectly aligned with the alternative contiguous sequence, which provides some training advantage to the structural variant refinement machine learning model in accurately identifying structural variants.

[0085] To modify the reference genome to include structural variants, the call refinement system 106 can perform various steps. In particular, the call refinement system 106 can remove portions of the sequence corresponding to SV regions (e.g., deleted regions of deletion structural variants) from the reference genome. In some cases, the call refinement system 106 replaces relevant portions of the reference sequence in a FAST-All (FASTA) file with contiguous sequences representing the associated structural variants. The call refinement system 106 can then regenerate the hash table using the modified FASTA file. In addition, the call refinement system 106 can run the mapping and alignment components of the call generation model on the modified reference genome. The call refinement system 106 can further rerun the variant caller component of the call generation model on the new mapping and alignment output.

[0086] For candidate structural variants for which read-based evidence falls below a threshold (e.g., fewer than 5 or 10 nucleotide reads supporting the candidate structural variant call), one approach to finding missing reads is to modify the local reference sequence by replacing it with a contiguous sequence representing the candidate structural variant. In the case of a true positive, when the reads are remapped to the modified reference genome, some of the nucleotide reads that were incorrectly mapped / aligned to the primary assembly of the reference genome are more likely to map correctly to the contiguous sequence representing the candidate structural variant, thereby increasing the read depth on the new modified reference genome. Based on the new mapping, when the call refinement system 106 reruns the call generation model, the call generation model 306 will not call a structural variant in the case of a true homozygous deletion or an insertion in the case of a true heterozygous deletion. Additionally, the depth of read coverage should increase for contiguous sequences representing the candidate structural variant compared to the original primary assembly, which should result in more accurate variant calls. The likelihood of achieving more accurate mapping can be estimated by aligning read-length segments of contiguous sequence representing candidate structural variants to a reference genome.

[0087] In some embodiments, the call refinement system 106 analyzes flanking regions of a structural variant (called by a call generation model) in a sample sequence, where the flanking regions include base calls within a threshold vicinity (e.g., within 200 base pairs) of the structural variant. For example, the call refinement system 106 determines an initial structural variant call using a call generation model (e.g., DRAGEN SV caller), modifies the reference genome to include (portions of) contiguous sequence reflecting the structural variant, and identifies flanking regions of a threshold size of 200 base pairs on either side of the structural variant. The call refinement system 106 further analyzes flanking regions (e.g., left and right flanks) of the combined sequence to determine the presence or absence of the structural variant. Indeed, the call refinement system 106 can quantify the extent (e.g., amount, magnitude, and / or size) of single nucleotide polymorphisms (SNPs) and / or insertions or deletions (indels) based on the modified reference genome (e.g., the sequence obtained by combining the reference genome and the contiguous sequence).

[0088] In some cases, the interpretation of contiguous sequences is sensitive to the scoring parameters and penalties within the Smith-Waterman algorithm. Thus, in these or other cases, the call refinement system 106 uses deletion counts from the Concise Idiosyncratic Gapped Alignment Report (CIGAR) string output for multiple scoring parameter sets to measure sensitivity to Smith-Waterman scoring parameters / penalties. The call refinement system 106 can further use the maximum contiguous deletion length and the sum of all deletions corresponding to the genomic region spanned by the break ends as sequencing metrics (e.g., read-based sequencing metrics).

[0089] In some cases, the call refinement system 106 determines a read-based sequencing metric in the form of a deletion length in nucleotide bases based on one or more soft-clipped nucleotide reads. For example, the call refinement system 106 realigns soft-clipped segments from nucleotide reads to determine the deletion length (or the length of different types of structural variants). In some embodiments, the call refinement system 106 realigns only the soft-clipped portion of the read to provide an estimate of the length of the deletion or some other structural variant. For example, the call refinement system 106 performs realignment only if the size of the soft-clipped portion meets (e.g., is greater than) a threshold number of soft-clipped bases (e.g., 10 soft-clipped bases or 20 soft-clipped bases).

[0090] Additionally, in some embodiments, the call refinement system 106: i) for left soft-clipped reads of the called structural variant, aligns the soft-clipped portion to the left of the current position / coordinate indicating the end of soft-clipping; ii) for right soft-clipped reads of the called structural variant, aligns the soft-clipped portion to the right of the current position / coordinate indicating the start of soft-clipping; iii) determines the distance in number of nucleotide bases between the aligned position / coordinate and the position of the soft-clipping from the original mapping; iv) determines a left mode and a right mode for all distances determined via steps i)-iii); and v) compares the difference between the left mode and the deletion length determined by the call generation model 306 (e.g., DRAGEN SV Caller), and the difference between the right mode and the deletion length determined by the call generation model 306 (e.g., DRAGEN SV Caller). Determine or calculate realignment offsets for soft-clipped segments (e.g., segments that meet the length requirement) by determining the difference from the deletion length determined by the Deletion Caller (e.g., the number of nucleotide bases determined from the variant length minus the alternative sequence length) and by determining a left realignment offset and a right realignment offset.

[0091] Additionally, the call refinement system 106 can determine read-based sequencing metrics in the form of the number of nucleotide reads that exhibit a mapping quality metric that does not meet a threshold mapping quality metric. Specifically, the call refinement system 106 corrects true positives that indicate nucleotide reads with a low MAPQ score (i.e., below a threshold MAPQ) but that are still correctly mapped (although the local alignment may be inaccurate). In some cases, the call refinement system 106 utilizes MAPQ as a soft weighting to indicate the likelihood of alignment with an alternative contiguous sequence or reference genome. The call refinement system 106 can further determine a count or number of reads with a mapping quality metric (e.g., MAPQ score) that does not meet (or is below) a threshold mapping quality metric (e.g., MAPQ=10 or MAPQ=60 or a relative MAPQ threshold). In some cases, the call refinement system 106 determines or generates a structural variant call based on the number of reads with a low mapping quality metric. In certain embodiments, such as when MAPQ=60, the call refinement system 106 further incorporates the XQ score to determine an extended range of likelihoods for structural variants. The call refinement system 106 can determine and incorporate the standard deviation of XQ across locally mapped reads to improve the predictions of the structural variant refinement machine learning model.

[0092] Further as described above, in some embodiments, the call refinement system 106 also determines an insert size, which represents the length of a nucleotide read fragment corresponding to the initial structural variant call determined by the call generation model 306. Specifically, the call refinement system 106 determines the size or length (e.g., number of base pairs) of an insertion (or other structural variant) within a genomic region (e.g., an SV region) of the genomic sample.

[0093] In some cases, the call refinement system 106 determines read-based sequencing metrics in the form of palindrome metrics. For example, the call refinement system 106 analyzes portions of a reference sequence corresponding to a target genomic region for which a structural variant is called (e.g., by a call generation model). Specifically, if a reference sequence in such a target genomic region is palindromic (or within a threshold percentage of palindromes, or within a threshold number of base pairs from a palindrome), the likelihood of a folding effect increases. Based on the analysis, the call refinement system 106 identifies or detects fragments or portions of a genomic sample (e.g., subsequences of reads) that are within a threshold distance (e.g., within 200 base pairs) from each other and are palindromic (which may indicate deletions due to folding effects during base calling). The call refinement system 106 can determine or measure the distance or proximity of segments of a palindrome metric (e.g., the number of base pairs separating them). In some cases, the call refinement system 106 further incorporates permutation entropy into the palindrome metric, such that palindromic matches (e.g., pairs of segments that are palindromic to each other) with higher permutation entropy increase the likelihood of a deletion (or some other structural mutation).

[0094] Furthermore, in some embodiments, the call refinement system 106 determines a read-based sequencing metric in the form of a structural variant likelihood, which represents the ratio of an initial structural variant call to a reference call for one or more genomic coordinates based on insert size. In particular, assuming no structural variant is present, there is a certain implied insert size or fragment size. On the other hand, assuming a structural variant is present, there is a different implied insert size or fragment size. Thus, based on the mean and standard deviation of the fragment sizes, the call refinement system 106 can determine whether the presence or absence of a structural variant is more likely. For example, in some embodiments, the call refinement system 106 determines the ratio of an initial structural variant call to a reference call for one or more genomic coordinates according to the following formula:

[0095]

number

[0096]

number

[0097]

number

[0098] Depending on the read orientation and alignment to the candidate SV genomic region, the call refinement system 106 can subtract the length of the proposed structural variant (e.g., deletion) from the original insert size estimate (e.g., based on reference mapping and alignment). When considering all nucleotide reads that provide evidence supporting the alternative allele, the call refinement system 106 can determine a likelihood ratio (e.g., for the alternative versus the reference) based on the predicted insert size across the set of reads.

[0099] In some cases

[0100]

number

[0101] In one or more embodiments, the call refinement system 106 determines read-based sequencing metrics in the form of confidence intervals around end breakpoints. In particular, the call refinement system 106 utilizes the call generation model 306 to determine the confidence interval as a measure of the certainty of the breakpoint location. For example, the call refinement system 106 determines a range of reference coordinates within which the breakpoint corresponding to the structural variant call may be located. In some cases, the call refinement system 106 determines the range of reference coordinates to reflect a threshold percentile (e.g., the 95th percentile) for the confidence interval.

[0102] In certain embodiments, the call refinement system 106 further determines additional or alternative read-based sequencing metrics. For example, the call refinement system 106 determines homology length as a read-based sequencing metric. Specifically, the call refinement system 106 determines the length of a nucleotide base sequence that repeats in the target genomic region of the structural variant and / or the length of a nucleotide base sequence that has at least a threshold measure of homology with other nucleotide base sequences (of similar length) in the target genomic region of the structural variant (e.g., HOMLEN=8 GCTTGAAC GCTTAAAC GCTAGAAC GCTTGAAC GCTTGTAC, etc.). In some cases, the call refinement system 106 determines the length of an inserted nucleotide base sequence as a read-based sequencing metric. In these or other cases, the call refinement system 106 determines the homology of the inserted nucleotide base sequence to a reference sequence in the target genomic region of the structural variant.

[0103] B. Reference-Based Sequencing Metrics 3, in addition to the read-based sequencing metrics, the call refinement system 106 can further determine or identify reference-based sequencing metrics 301 from a reference database 300. In particular, the call refinement system 106 determines the reference-based sequencing metrics 301 by analyzing one or more genomic regions of a reference genome that correspond to (or align with) one or more genomic coordinates for the initial structural variant call 308.

[0104] Many challenging structural variant calls occur in low-complexity genomic regions of a reference genome. In some cases, these genomic regions are characterized by some combination of long repeat sequences (e.g., more than 50 base pairs), a very large number (e.g., more than 10), and multiple instances of shorter repeat sequences (e.g., 4-8 repeated bases), sometimes including a subset of bases (e.g., A and T, but not C or G). Nucleotide reads that align accurately to such low-complexity genomic regions often have portions or fragments of the nucleotide read that map to more unique sequences adjacent to the overlapping heavy chain region. Alternatively, a reference genome or genomic sample may contain several intermediate breaks (e.g., single bases between primary repeat patterns that break the repetitiveness) that aid in the alignment of nucleotide reads to low-complexity genomic regions of the reference genome. However, when combined with SNPs, indels, and sequencing errors, aligning and collecting reads with sufficient evidence to compare reference versus alternative allele support becomes problematic. Thus, in some embodiments, the call refinement system 106 monitors reference-based sequencing metrics (related to complexity), which may be augmented with read-based sequencing metrics, to provide an overall assessment of the likelihood of the presence of structural variants (for both Bayesian and machine learning approaches).

[0105] For example, the call refinement system 106 accesses or determines sequencing information (e.g., stored in the reference database 300 or database 116) for a particular reference sequence. In some cases, the call refinement system 106 determines reference-based sequencing metrics including tandem repeat lengths in nucleotide bases of target genomic regions within the reference genome corresponding to candidate SV regions of the genomic sample. Specifically, the call refinement system 106 analyzes portions of the reference genome corresponding to the SV regions of the genomic sample to identify tandem repeats (e.g., sequences of two or more bases that are repeated multiple times in a head-to-tail manner) and further determines the lengths (e.g., number of base pairs) within the tandem repeats.

[0106] In certain embodiments, the call refinement system 106 determines a reference-based sequencing metric in the form of a repetitiveness metric or a homopolymer metric. Indeed, one indication of the likelihood of a mismapping that needs to be corrected (e.g., a mismapping that results in a false positive) is based on the repetitiveness of bases in the reference sequence. Accordingly, the call refinement system 106 can utilize various sequencing metrics to measure this repetitiveness, including: i) a maximum repeat pattern length, which indicates the maximum length of a sequence of bases that is repeated at least twice across the range of the candidate SV region (corresponding to the reference genome); ii) a maximum repeat length percentage, which indicates the percentage of the SV region (corresponding to the portion of the reference genome) that is consumed or occupied by the maximum repeat pattern length; and iii) a maximum homopolymer length, which indicates the length of the longest sequence of the same base in the candidate SV region (corresponding to the portion of the reference genome).

[0107] In addition to, or instead of, a repeatability metric, in some cases, the call refinement system 106 determines a reference-based sequencing metric in the form of permutation entropy of nucleotide bases. For example, the call refinement system 106 determines a measure of randomness of nucleotide sequences from which mapping / alignment accuracy can be predicted. In some cases, the call refinement system 106 determines permutation entropy by determining the entropy over permutations of a given length of nucleotide sequence. For example, the call refinement system 106 can determine permutation entropy according to the following formula: S1∈{A,C,G,T} S2∈{AA,AC,AG,AT,CA,CC,CG,CT,GA,GC,GG,GT,TA,TC,TG,TT} S3∈{AAA,AAC,AAG,AAT,ACT,...,TTA,TTC,TTG,TTT} S4∈{AAAA,AAAC,AAAG,AAAT,AACA,...,TTGT,TTTA,TTTC,TTTG,TTTT} In the formula, S N is the set of all permutations of a base sequence of length N, |S N |=4 N set S N The permutation element s resulting from N,k Let the probability of be given by:

[0108]

number

[0109]

number

[0110] In addition to permutation entropy, the call refinement system 106 can further determine reference-based sequencing metrics in the form of identifying the presence or absence of cytosine quadruplexes (C-quadruplexes) or guanine quadruplexes (G-quadruplexes) in the target genomic region. Specifically, the call refinement system 106 determines the counts of cytosine calls and guanine calls in the target genomic region of the reference genome corresponding to the SV region of the genomic sample or genomic region under consideration for the initial structural variant call. To identify a cytosine quadruplex, the call refinement system 106 identifies the occurrence (within the target genomic region) of four or more instantiations of three consecutive cytosine bases separated by one or more different nucleotide bases (e.g., a pattern of CCC A CCC A CCC A CCC). Similarly, to identify a G-quadruplex, the call refinement system 106 identifies the occurrence (within the target genomic region) of four or more instantiations of three consecutive guanine bases separated by one or more different nucleotide bases (e.g., a pattern of GGG T GGG T GGG T GGG). In one or more embodiments, the call refinement system 106 identifies C-quadruplexes or G-quadruplexes where a maximum threshold number of nucleotide bases (e.g., up to 7 nucleotide bases) occurs between instantiations of triple C or triple G. For example, the call refinement system 106 identifies GGG TACC GGG TGTACA GGG AAGTCT GGG as a G-quadruplex. In some cases, G-quadruplexes (and C-quadruplexes) are known to cause sequencing problems. Thus, the call refinement system 106 uses the presence of such sequences to adjust the confidence in mapping and alignment of reads and the accuracy of subsequent sequential sequence assembly.

[0111] In certain embodiments, the call refinement system 106 determines a data compression metric as part of the reference-based sequencing metrics. In particular, the call refinement system 106 uses one or more data compression algorithms to determine a data compression metric that quantifies a measure of sequence randomness. One such data compression algorithm for lossless compression is the Liv-Zempel-Welch algorithm. Using this algorithm, the call refinement system 106 builds a dictionary of unique k-mers starting with a length of 1 and devise a coding for each entry in the dictionary. The call refinement system 106 can utilize the number of keys in the dictionary for structural variants and flanking regions in the reference genome as a sequencing metric.

[0112] In addition to or instead of the reference-based sequencing metrics described above, in some embodiments, the call refinement system 106 determines structural variant sequence alignment metrics as part of the reference-based sequencing metrics. For example, the call refinement system 106 uses gapless alignment scoring and Smith-Waterman alignment scoring of the proposed deletion sequence to the left / right flanking genomic regions in the reference. If there are multiple alignments that score above a threshold gapless alignment score and / or a threshold Smith-Waterman alignment score, the structural variant refinement machine learning model can treat the structural variant sequence alignment metrics as an indication of a higher likelihood of an incorrect structural variant call.

[0113] Furthermore, the call refinement system 106 can also determine simulated read alignment metrics as reference-based sequencing metrics. Assuming that the contiguous sequence representing or containing the structural variant is accurate, even in the case of a heterozygous deletion, theoretically, there should be many nucleotide reads with good alignment to the contiguous sequence. However, in true-positive cases with low evidence of a structural variant, there is a possibility of missing reads because the reads corresponding to the SV region were either mapped elsewhere or not mapped at all. Therefore, the call refinement system 106 can determine the possibility of missing reads by simulating reads.

[0114] Specifically, the call refinement system 106 selects a segment from the contiguous sequence that is equal in length to the SBS read. The call refinement system 106 selects a segment of contiguous sequence that crosses the break end, is equal to the SBS read length, and is aligned to the reference sequence in the SV region. If the alignment is ambiguous, the alternative alignment score will be higher and can serve as a possible guide to the expected read depth. The call refinement system 106 can further use a segment of contiguous sequence equal to the read length that is symmetric about the break end to obtain the highest alignment score. The call refinement system 106 can further determine an additional offset from this symmetry point to check the alternative alignment score for the extent of overlap.

[0115] C. Variant Region Quality Sequencing Metrics 3, the call refinement system 106 can determine variant region quality sequencing metrics as part of sequencing metrics 304 or sequencing metrics 310. More specifically, in some embodiments, the call refinement system 106 utilizes a call generation model 306 to generate a subset of variant region quality sequencing metrics from the sequencing data. For example, the call refinement system 106 extracts or determines sequence data based on read processing and mapping. In some cases, the call refinement system 106 generates the sequence data as part of one or more digital files, such as BCL and FASTQ files, as described above in connection with sequencing metrics 304.

[0116] In certain embodiments, the call refinement system 106 implements, utilizes, or applies a call generation model 306 to process or analyze the sequence data. Indeed, in some embodiments, the call refinement system 106 utilizes the call generation model 306 to generate a subset of variant region quality sequencing metrics by re-engineering raw sequencing metrics (e.g., uncorrected sequencing metrics in the sequence data). In particular, the call generation model 306 includes a mapping and alignment component for mapping and aligning nucleotide base calls from the sequence data. Furthermore, the call generation model 306 includes a variant calling component for generating initial structural variant calls 308 from the sequence data. In some cases, the call refinement system 106 extracts the generated variant region quality sequencing metrics utilizing the mapping and alignment component and the variant calling component of the call generation model 306.

[0117] As an example of a variant region quality sequencing metric, the call refinement system 106 can determine the number of nucleotide reads that include at least a threshold number of base calls and that correspond to the target genomic region of the initial structural variant call. For example, the call refinement system 106 analyzes sequence data to count base calls (e.g., via the sequencing device 302 and / or the call generation model 306) within the nucleotide reads from the genomic sample that correspond to the initial structural variant call 308. The call refinement system 106 can further identify and count reads that include at least the threshold number of base calls. In some cases, the call refinement system 106 determines a read count threshold metric to quantify or indicate that the number of reads with at least the threshold number of base calls does not meet the read count threshold.

[0118] In addition to or instead of such read counts, in some embodiments, the call refinement system 106 determines a base quality measure for reads with soft clipping in a candidate SV region as a variant region quality sequencing metric. For example, the call refinement system 106 determines a soft-clipped read count as the number of soft-clipped nucleotide reads within a candidate SV region (also known as a target genomic region) of a genomic sample. In addition, the call refinement system 106 determines a low base call quality count for the soft-clipped portion of the nucleotide reads as the number of calls having a base call quality score below a threshold base call quality score (e.g., a Q score or QUAL score of 20, 30, 35, or 40). Furthermore, the call refinement system 106 determines a low-quality read count as the number of nucleotide reads having a low base call quality count that meets a threshold low base call quality count (e.g., a count of five base calls having a base call quality below a threshold base call quality score).

[0119] Furthermore, the call refinement system 106 determines a variant region quality sequencing metric in the form of a low-quality read percentage that reflects the ratio of low-quality read counts to soft-clipped read counts. In other words, the call refinement system 106 combines the low-quality read counts and soft-clipped read counts in a certain ratio.

[0120] In addition to or instead of such read counts or ratios, in some embodiments, the call refinement system 106 determines, as a variant region quality sequencing metric, the number of nucleotide bases in an alternative contiguous sequence corresponding to a target genomic region from a reference genome where the base calls for the nucleotide reads do not meet a threshold base call quality score. Specifically, the call refinement system 106 can identify base calls that do not meet a threshold base call quality score (e.g., a Q score or QUAL score of 20, 30, 35, or 40). The call refinement system 106 can further determine an alternative base call quality metric to quantify or indicate the number of low-quality base calls used to derive bases in the alternative contiguous sequence. To this end, the call refinement system 106 can align reads in a candidate SV region of the genomic sample to the alternative contiguous sequence. Additionally, the call refinement system 106 can record the base call quality score from the alternative supporting reads for each position in the alternative contiguous sequence. Additionally, the call refinement system 106 can determine, for each position in the alternative contiguous sequence, a median base call quality score from the recorded base call quality scores for that position in the alternative supporting reads. The call refinement system 106 can further count the number of calls having a base call quality score below a threshold base call quality score (e.g., Q20, Q30, or Q40).

[0121] In addition to, or instead of, the various read-based sequencing metrics, variant region quality sequencing metrics, and / or reference-based sequencing metrics described above, the call refinement system 106 uses certain sequencing metrics that rely on percentages instead of the counts or numbers described above. As described above, certain sequencing metrics are based on numbers or counts associated with various reads or other features. As an alternative to, or in addition to, such sequencing metrics, in certain embodiments, the call refinement system 106 determines the variance of certain sequencing metrics based on percentage values ​​by normalizing the numbers / counts based on coverage in the target genomic region associated with the initial structural variant call. For example, some such sequencing metrics may include, but are not limited to, (i) the percentage of split nucleotide reads from the nucleotide reads corresponding to the initial structural variant call, (ii) the percentage of nucleotide reads that overlap with the target genomic region corresponding to a structural variant identified as present or absent by the initial structural variant call, (iii) the percentage of nucleotide reads that exhibit a mapping quality metric that does not meet a threshold mapping quality metric, (iv) the percentage of nucleotide reads that include at least a threshold number of base calls and that correspond to the target genomic region for the initial structural variant call, or (v) the percentage of nucleotide bases in an alternative contiguous sequence that corresponds to the target genomic region from the reference genome for which the base calls for the nucleotide reads do not meet a threshold base call quality score.

[0122] Based on one or more of the reference-based sequencing metrics 301, the sequencing metrics 304, the sequencing metrics 310, or the initial structural variant call 308, as further illustrated in FIG. 3 , the call refinement system 106 can utilize a structural variant refinement machine learning model 312. More specifically, the call refinement system 106 can utilize the structural variant refinement machine learning model 312 to process or analyze one or more of such sequencing metrics and the initial structural variant call 308 to generate a false positive likelihood 314. For example, the call refinement system 106 utilizes the structural variant refinement machine learning model 312 to generate a false positive likelihood 314 based on the reference-based sequencing metrics, the read-based sequencing metrics, the variant region quality sequencing metrics, and the initial structural variant call 308, the false positive likelihood reflecting the likelihood or probability that an initial structural variant call (e.g., an initial small-sized structural variant call) made by the call generation model 306 (e.g., the initial structural variant call 308) is a false positive.

[0123] In one or more embodiments, the false positive likelihood 314 indicates a high likelihood that the initial structural variant call 308 is a false positive, in which case the call refinement system 106 can correct the initial structural variant call. However, in certain cases, the false positive likelihood 314 indicates a low likelihood (e.g., below a threshold likelihood) that the initial structural variant call is a false positive. Thus, the call refinement system 106 can strengthen or confirm the initial structural variant call 308 made by the call generation model 306. Such confirmation can provide utility to the clinician by reinforcing that the initial structural variant call 308 is more likely to be correct (given that both models reached the same conclusion) and therefore more actionable for treatment or other measures.

[0124] In certain cases, the call refinement system 106 can utilize the false positive likelihood 314 for purposes other than (or in addition to) determining a revised structural variant call. For example, the call refinement system 106 can utilize the false positive likelihood 314 as input to the call generation model 306 to perform further processing (e.g., make additional variant calls, nucleotide base calls, and / or generate other metrics). Indeed, the call refinement system 106 can use the call generation model 306 to recursively utilize the false positive likelihood 314 as input for subsequent processing stages to regenerate the structural variant call (or some other call).

[0125] As described above, in certain embodiments, the call refinement system 106 utilizes a structural variant refinement machine learning model in conjunction with a call generation model to generate structural variant calls (e.g., small-sized structural variant calls). In particular, the call refinement system 106 utilizes a structural variant refinement machine learning model to modify data fields corresponding to a variant call file. Figure 4 illustrates the call refinement system 106 utilizing a structural variant refinement machine learning model and a call generation model according to one or more embodiments to generate structural variant calls by modifying a variant call file.

[0126] In certain implementations, the call refinement system 106 determines, refines, or modifies the initial structural variant call based on the false positive likelihood 314. In some cases, the call refinement system 106 further considers factors in addition to or alternative to the false positive likelihood 314 when generating the modified structural variant call. For example, the call refinement system 106 utilizes metrics associated with single nucleotide variants (SNVs) and / or copy number variants (CNVs) to determine the modified structural variant call. Specifically, the call refinement system 106 determines SNV metrics, such as SNV calls within a threshold distance of the initial structural variant call, base call quality scores associated with the SNV calls, and other SNV metrics. In addition, the call refinement system 106 determines CNV metrics, such as CNV calls within a threshold distance of the initial structural variant call, base call quality scores associated with the CNV calls, and other CNV metrics. In some cases, the call refinement system 106 uses SNV and / or CNV metrics (along with the false positive likelihood 314) to determine a refined or revised structural variant call. In certain embodiments, the call refinement system 106 can utilize the SNV and / or CNV metrics as further sequencing metrics to input into the structural variant refinement machine learning model 312 to determine the false positive likelihood 314.

[0127] As illustrated in Figure 4, the call refinement system 106 accesses a sequencing information database 402, a reference sequence 404 (e.g., a reference genome), and sequence data 406 inferred from one or more nucleotide reads. In practice, the call refinement system 106 performs sequencing metric extraction 412 to extract or re-engineer sequencing metrics (e.g., read-based sequencing metrics, reference-based sequencing metrics, and variant region quality sequencing metrics), as described above in connection with Figure 3. In some cases, the call refinement system 106 utilizes a mapping and alignment component 408 of a call generation model 422 (e.g., call generation model 306) to determine mapping and alignment metrics (e.g., as part of the read-based sequencing metrics, reference-based sequencing metrics, and / or variant region quality sequencing metrics). Additionally, the call refinement system 106 utilizes the variant caller component 410 of the call generation model 422 to generate variant calling metrics (e.g., as part of read-based sequencing metrics, reference-based sequencing metrics, and variant region quality sequencing metrics). In some embodiments, the call refinement system 106 utilizes the variant caller component 410 of the call generation model 422 to also generate initial structural variant calls for one or more genomic coordinates of the genomic sample.

[0128] 4, the call refinement system 106 generates a false positive likelihood 416. More specifically, the call refinement system 106 utilizes a structural variant refinement machine learning model 414 to generate the false positive likelihood 416 from the sequencing metrics and / or the initial structural variant call from the variant caller component 410. For example, the structural variant refinement machine learning model 414 generates a false positive likelihood that indicates the likelihood that the initial structural variant call of the call generation model 422 is a false positive. As indicated above, in some embodiments, the call refinement system 106 determines the false positive likelihood by determining, based on sequencing metrics, that the initial structural variant call is a false positive call or a true positive call.

[0129] From the false positive likelihood 416, the call refinement system 106 further determines a revised structural variant call or confirms the initial structural variant call. Specifically, the call refinement system 106 determines a revised structural variant call by (i) changing the initial structural variant call from a positive structural variant call to a negative structural variant call based on the initial structural variant call being a false positive call, or (ii) changing the initial structural variant call from a negative structural variant call to a positive structural variant call based on the initial structural variant call being a true positive call.

[0130] In some cases, the structural variant refinement machine learning model 414 is an ensemble of gradient-boosted trees that process sequencing metrics to generate false positive likelihoods 416. For example, the structural variant refinement machine learning model 414 includes a series of weak learners, such as nonlinear decision trees, that are trained in logistic regression to generate false positive likelihoods 416. In some cases, the structural variant refinement machine learning model 414 includes various intra-tree metrics that define how the structural variant refinement machine learning model 414 processes sequencing metrics to generate false positive likelihoods 416. Further details regarding training the structural variant refinement machine learning model 414 are provided below with reference to FIG. 6.

[0131] In certain embodiments, the structural variant refinement machine learning model 414 is a different type of machine learning model, such as a neural network, a support vector machine, or a random forest. For example, if the structural variant refinement machine learning model 414 is a neural network, the structural variant refinement machine learning model 414 includes one or more layers, some of which have neurons that constitute the layer for processing sequencing metrics. In some cases, the structural variant refinement machine learning model 414 generates the false positive likelihood 416 by extracting a latent vector from the sequencing metrics, passing the latent vector from layer to layer (or neuron to neuron), and manipulating the vector using an output layer (e.g., one or more fully connected layers) until it generates the false positive likelihood 416.

[0132] Additionally (or alternatively), the call refinement system 106 can determine the false positive likelihood 416 by (i) utilizing an accumulation of statistical analyses across complex functions (depending on the architecture of the structural variant refinement machine learning model 414) to determine how best to fit the data (e.g., based on relationships between various sequencing metrics), or (ii) comparing other sequencing metrics, such as read depth, base call quality score, or others associated with the structural variant call, to corresponding thresholds. For example, in some embodiments, the call refinement system 106 trains the structural variant refinement machine learning model 414 to minimize the loss generated from several (different types of) sequencing metrics to determine weights and biases that best fit the data (e.g., result in reduced or minimized loss) to generate the false positive likelihood 416.

[0133] 4 , the call refinement system 106 performs data field generation 418. More specifically, the call refinement system 106 utilizes the variant caller component 410 of the call generation model 422 to generate data fields for structural variant calls and modifies or maintains values ​​for such data fields based on the false positive likelihood 416. For example, the call refinement system 106 modifies various metrics, such as quality metrics, mapping metrics, or other metrics associated with structural variant calls. In certain embodiments, the structural variant calls are represented or defined by a variant call file 420 that includes metrics corresponding to data fields, such as call quality metrics corresponding to call quality fields, genotype metrics corresponding to genotype fields, and genotype quality metrics corresponding to genotype quality fields. Other fields include a CIGAR string field, a read depth field, an ancestral allele field, and / or other variant call format fields.

[0134] In addition to generating initial structural variant calls via call generation model 422, call refinement system 106 also refines or modifies the initial structural variant calls based on false positive likelihoods 416 from structural variant refinement machine learning model 414. In one or more implementations, call refinement system 106 modifies nucleotide base calls by modifying or refining one or more data fields of metrics associated with the nucleotide base calls (e.g., as included in variant call file 420).

[0135] As described, the call refinement system 106 generates false positive likelihoods 416 and structural variant calls from the same set of sequencing metrics (or a subset of sequencing metrics shared between the structural variant refinement machine learning model 414 and the call generation model 422) and / or initial structural variant calls from the variant caller component 410. In effect, the call refinement system 106 utilizes the structural variant refinement machine learning model 414 to generate false positive likelihoods 416 from sequencing metrics while also generating initial structural variant calls for the genomic sample. In effect, the call refinement system 106 can operate the structural variant refinement machine learning model 414 in parallel with the call generation model 422 to generate metrics for the initial structural variant calls and false positive likelihoods 416 for recalibrating the generated metrics.

[0136] In one or more implementations, the call refinement system 106 updates or otherwise modifies data fields in the variant call file 420 according to a particular algorithm. After modifying such data fields, the call refinement system 106 can generate the variant call file 420 (e.g., a post-filter variant call file) to include metrics reflecting the updated data fields of QUAL, GT, and GQ (or other VCF fields). For example, in some cases, the call refinement system 106 updates the QUAL field of one or more structural variant calls based on the false positive likelihood 416. As noted above, in some cases, QUAL indicates the probability of a certain variant (or other nucleotide base call) being present at a given position, as measured on the PHRED scale.

[0137] The call refinement system 106 can remove false-positive structural variant calls and recover false-negative structural variant calls by modifying the corresponding VCF metric based on the false-positive likelihood 416. To remove false-positive structural variant calls, in some cases, the call refinement system 106 reduces the quality metric (e.g., QUAL score) of the structural variant call that initially passed the quality filter based on the false-positive likelihood 416 from the structural variant refinement machine learning model 414. Based on determining that the reduced base call quality metric falls below a threshold metric, the call refinement system 106 determines that the nucleotide base call no longer passes the quality filter. Thus, the call refinement system 106 filters out or removes the false structural variant calls that initially passed the filter by modifying the quality metric (or one or more other metrics).

[0138] To recover a false-negative structural variant call, the call refinement system 106 increases the quality metric of the structural variant call that did not initially pass the quality filter based on the false-positive likelihood 416 from the structural variant refinement machine learning model 414. Based on determining that the increased base call quality metric exceeds a threshold metric, the call refinement system 106 determines that the structural variant call passes the quality filter. Thus, the call refinement system 106 recovers the false-negative structural variant call that was initially filtered out by modifying its quality metric.

[0139] As just described, the call refinement system 106 can improve the accuracy of structural variant calling compared to conventional systems. In particular, by using a structural variant refinement machine learning model trained on the sequencing metrics described herein, the call refinement system 106 reduces or eliminates false-positive and / or false-negative structural variant calls by correcting structural variant calls originally made by the call generation model. Figure 5 shows an exemplary table of correcting structural variant calls using a structural variant refinement machine learning model, according to one or more embodiments.

[0140] As illustrated in FIG. 5 , researchers have demonstrated certain improvements to the call refinement system 106. Detailing the experimental results, table 500 includes rows corresponding to different datasets, such as HG002, HG003, HG004, HG005, HG006, and HG007, which are specific sets of available human genome data corresponding to the genetics of various genomic samples. As shown, table 500 includes a “TP” column indicating the number of true positive structural variant calls determined using a call generation model (e.g., call generation model 422). Table 500 further includes a “Det TP” column indicating the number of true positives (or recovered from false positives and / or false negatives) detected using a structural variant refinement machine learning model (e.g., structural variant refinement machine learning model 414). Summing the “Det TP” and “TP” columns results in a “Total TP” column. Here, the "Total TP" column indicates the total number of true positive structural variant calls, including those determined via the call generation model and those recovered or refined via the structural variant refinement machine learning model.

[0141] Additionally, table 500 includes a "<50 bp" column, which indicates the number of structural variant calls that the call refinement system 106 filters out (false positives) because they do not meet a minimum length threshold of at least 50 base pairs. Additionally, table 500 includes a "FP" column, which indicates the number of false positives that remain after the call refinement system 106 applies the call generation model and the structural variant refinement machine learning model. Thus, summing the "<50 bp," "Det TP," and "FP" columns gives the total number of false positive structural variant calls before applying the structural variant refinement machine learning model. Thus, as shown by table 500, the call refinement system 106 reduces the number of false positive structural variant calls and increases the number of true positive structural variant calls due to better accuracy of structural variant calling.

[0142] As noted above, in certain described embodiments, the call refinement system 106 trains a structural variant refinement machine learning model to generate false positive likelihoods for correcting or confirming a structural variant call. In particular, the call refinement system 106 trains the structural variant refinement machine learning model using specific training data tuned and designed for the structural variant refinement machine learning model. Figure 6 shows an exemplary diagram illustrating the training process for a structural variant refinement machine learning model, according to one or more embodiments.

[0143] As shown in FIG. 6 , the call refinement system 106 determines or performs corrections 604 to ground truth structural variant calls. Specifically, the call refinement system 106 identifies ground truth structural variant calls from a truth dataset (e.g., a dataset of reads and variant calls from a CCS Read-Based SV Caller) that correspond to structural variant calls that were incorrectly labeled as false positives rather than true positives. The call refinement system 106 identifies such incorrectly labeled ground truth structural variant calls based on one or more truth-set nucleotide reads for the ground truth structural variant calls that meet one or more structural variant criteria. The truth-set nucleotide reads may include long nucleotide reads (e.g., CCS long reads or nanopore long reads) and / or short nucleotide reads. In some cases, the truth-set nucleotide reads underlying the ground truth structural variant call are aligned according to long reads in the truth dataset (e.g., from database 602) to include adjacent regions upstream or downstream of the structural variant and / or correct ambiguity in the potential sequence location of the structural variant. In certain embodiments, the call refinement system 106 performs a correction process that corrects ambiguity by identifying or detecting matches between the nucleotide reads used to generate the truth dataset and contiguous sequences corresponding to the nucleotide reads (e.g., for the target genomic region) and generated by the call generation model, but representing alternative nucleotide base sequences. As alluded to above, for example, the call generation model (e.g., DRAGEN SV Caller) can generate contiguous sequences corresponding to the nucleotide reads with a reference sequence of a reference genome that has been corrected to include the structural variant corresponding to the initial structural variant call 603.

[0144] After identifying the mislabeled ground truth structural variant calls, the call refinement system 106 further changes the labels of the mislabeled ground truth structural variant calls from false positive structural variant calls to true positive structural variant calls, and uses the corrected truth dataset (including the changed labels) as training data for the structural variant refinement machine learning model 606. Further details regarding determining structural variant criteria and correcting the ground truth data for training the structural variant refinement machine learning model 606 are provided below in connection with FIG. 7.

[0145] As further illustrated in FIG. 6 , call refinement system 106 accesses sample sequencing metrics 600 and corrected ground truth structural variant calls (and / or other corrected training data) from database 602 (e.g., database 116). Thus, in some cases, sample sequencing metrics 600 have corresponding corrected ground truth structural variant calls 616 associated with them, where ground truth structural variant calls 616 indicate the actual structural variant calls and their various metrics resulting from the sample sequencing metrics. For example, call refinement system 106 utilizes sample sequencing metrics 600 and ground truth structural variant calls (e.g., ground truth structural variant calls 616) from a training dataset generated using the CCS Read-Based SV Caller. Alternatively, the training dataset includes metrics and structural variant calls from the U.S. Food and Drug Administration (FDA), referred to as the PrecisionFDA dataset. In some cases, sample sequencing metrics 600 includes a subset of sample sequencing metrics for each structural variant call in a ground truth variant call file, which can have ground truth variant calls (e.g., genotype metrics in a genotype field) and / or ground truth structural variant calls corresponding to each subset of sample sequencing metrics.

[0146] 6 , the call refinement system 106 generates a predicted false positive likelihood 608 based on the sample sequencing metrics 600 and further based on the initial structural variant call 603 (e.g., the structural variant call made by the call generation model). Specifically, the call refinement system 106 inputs the sample sequencing metrics 600 and the initial structural variant call 603 into a structural variant refinement machine learning model 606 and utilizes the structural variant refinement machine learning model 606 to generate a predicted false positive likelihood 608 from the sample sequencing metrics 600.

[0147] Based on the predicted false positive likelihood 608, the call refinement system 106 determines a predicted structural variant call 610. In some training iterations, the predicted structural variant call 610 differs from or matches the initial structural variant call determined by the call generation model. As indicated above, the call refinement system 106 can (i) utilize the call generation model to generate an initial structural variant call, and (ii) utilize the structural variant refinement machine learning model 606 to modify the structural variant call (data fields corresponding to the variant call file). Such modified or refined values ​​are output, for example, by the call generation model, in a modified variant call file (VCF).

[0148] 6, the call refinement system 106 performs a comparison 612. Specifically, the call refinement system 106 performs a comparison 612 between (i) predicted structural variant calls 610 and (ii) ground truth structural variant calls 616. In some embodiments, the call refinement system 106 utilizes a loss function 614 to compare such structural variant calls (e.g., determine a measure of error or loss between them). For example, if the structural variant refinement machine learning model 606 is an ensemble of gradient-boosted trees, the call refinement system 106 utilizes a mean squared error loss function (e.g., for regression) and / or a logarithmic loss function (e.g., for classification) as the loss function 614.

[0149] In contrast, in embodiments in which the structural variant refinement machine learning model 606 is a neural network, the call refinement system 106 may utilize a cross-entropy loss function, an L1 loss function, or a mean squared error loss function as the loss function 614. For example, the call refinement system 106 utilizes the loss function 614 to determine the difference between the predicted structural variant call 610 and the ground truth structural variant call 616.

[0150] 6, the call refinement system 106 performs model fitting 618. In particular, the call refinement system 106 adapts the structural variant refinement machine learning model 606 based on the comparison 612. For example, the call refinement system 106 implements modifications or adjustments to various parameters of the structural variant refinement machine learning model 606 to reduce the loss measure from the loss function 614 for subsequent training iterations.

[0151] In the case of gradient-boosted trees, for example, the call refinement system 106 trains the structural variant refinement machine learning model 606 on the gradient of the error determined by the loss function 614. For example, the call refinement system 106 solves a (e.g., infinite-dimensional) convex optimization problem while regularizing the objective function to avoid overfitting. In one particular implementation, the call refinement system 106 scales the gradient to emphasize corrections for underrepresented classes (e.g., when there are significantly more true-positive variant calls than false-positive variant calls).

[0152] In some embodiments, as part of solving the optimization problem, the call refinement system 106 adds new weak learners (e.g., new boosted trees) to the structural variant refinement machine learning model 606 at each successive training iteration. For example, the call refinement system 106 finds a feature (e.g., a sequencing metric) that minimizes the loss from the loss function 614 and adds that feature to the tree of the current iteration or starts building a new tree with that feature.

[0153] In addition to or instead of gradient boosting decision trees, the call refinement system 106 trains a logistic regression to learn parameters for generating one or more variant call classifications, such as true positive classifications. To avoid overfitting, the call refinement system 106 further regularizes based on hyperparameters such as learning rate, stochastic gradient boosting, number of trees, tree depth, complexity penalty, and L1 / L2 regularization.

[0154] In embodiments where the structural variant refinement machine learning model 606 is a neural network, the call refinement system 106 performs model fitting 618 by modifying the internal parameters (e.g., weights) of the structural variant refinement machine learning model 606 to reduce a loss measure for the loss function 614. In effect, the call refinement system 106 modifies how the structural variant refinement machine learning model 606 analyzes and passes data between layers and neurons by modifying the internal network parameters. Thus, over multiple iterations, the call refinement system 106 improves the accuracy of the structural variant refinement machine learning model 606.

[0155] In some embodiments, the call refinement system 106 adjusts the weights of the structural variant refinement machine learning model 606 based on structural variant call class imbalance to improve training. More specifically, the call refinement system 106 detects structural variant class imbalance (e.g., the number of false positives is significantly less than the number of true positives), such as at least a threshold difference (e.g., a difference of more than 20%, 45%, or 55% in classes) between the number of false positive structural variant calls and the number of true positive structural variant calls. Based on the detection of structural variant class imbalance, the call refinement system 106 weights the gradients of less frequent classes (e.g., true positive structural variant calls) more heavily relative to the gradients of more frequent classes (e.g., false positive structural variant calls) during training. For example, the call refinement system 106 determines a scaling factor for weighting the gradients based on the ratio of false positive structural variant calls to true positive structural variant calls in the training dataset. In some cases, the call refinement system 106 dynamically adjusts the scaling factor based on changes in the ratio of false-positive structural variant calls to true-positive structural variant calls that may occur in a training dataset (e.g., a new training dataset).

[0156] By determining and applying scaling factors for the structural variant refinement machine learning model 606, the call refinement system 106 can dynamically adjust the sensitivity or true positive rate at which the call refinement system 106 makes structural variant calls based on the false positive likelihood from the structural variant refinement machine learning model 606. Similarly, by determining and applying scaling factors for the structural variant refinement machine learning model 606, the call refinement system 106 can dynamically adjust the F-1 score at which the call refinement system 106 classifies or makes structural variant calls (e.g., initial structural variant calls) based on the false positive likelihood from the structural variant refinement machine learning model 606. Such scaling factors can adjust the weights of the structural variant refinement machine learning model 606, for example, to make it more or less likely that the false positive likelihood (or likelihood score) indicates that the initial structural variant call is actually a false positive, or that a particular structural variant is actually present at one or more genomic coordinates of the genomic sample.

[0157] Indeed, in some cases, the call refinement system 106 repeats the training process illustrated in FIG. 6 multiple times. For example, the call refinement system 106 repeats the training iterations by selecting a new set of corrected training data along with the corresponding ground truth structural variant calls. The call refinement system 106 further generates a new predicted false positive likelihood for each iteration along with the new predicted structural variant calls. As described above, the call refinement system 106 also performs comparisons and further model fitting at each iteration. The call refinement system 106 repeats this process until the structural variant refinement machine learning model 606 generates false positive likelihoods that result in predicted structural variant calls that meet a threshold measure of loss.

[0158] As noted above, in certain described embodiments, the call refinement system 106 generates a corrected set of training data for adjusting parameters of a structural variant refinement machine learning model. In particular, the call refinement system 106 corrects the training data by correcting errors in a ground truth dataset, such as a dataset generated by the CCS Read-Based SV Caller and / or the PrecisionFDA dataset. Figure 7 shows an Integrated Genomic Viewer (IGV) chart for an exemplary scenario in which the call refinement system 106 corrects errors indicated by a ground truth dataset, in accordance with one or more embodiments.

[0159] As illustrated in FIG. 7 , IGV chart 700 shows the target genomic region of the reference genome along with the input BAM file data (represented by the “Input BAM” region), the circular consensus sequencing (CCS) nucleotide reads (represented by the “HG002-CCS-BAM-hg38” region), the call generation model SV Caller call indicator (represented by the “Call Generation Model SV VCF” region), and the structural variant call indicator in the truth dataset (represented by the “True VCF” region). As shown, the truth dataset indicates that no structural variants are present for the genomic sample when compared to the indicated target genomic region of the reference genome. However, the Call Generation Model SV Caller made a structural variant call for the same target genomic region. Furthermore, other sequencing data (e.g., sequencing metrics) shown in IGV chart 700 indicate that a structural variant is indeed present in the indicated target genomic region. When training a structural variant refinement machine learning model, relying on a ground truth dataset that reflects these inaccurate calls will be inaccurate and will incorrectly train the structural variant refinement machine learning model.

[0160] Thus, in some embodiments, the call refinement system 106 automatically (e.g., without prompting or guiding user interaction) corrects inaccurate structural variant calls to generate more reliable training data (e.g., more accurate ground truth structural variant calls). To correct erroneous calls in the ground truth dataset, the call refinement system 106 can determine that a ground truth structural variant call has been incorrectly labeled as a false positive rather than a true positive. Indeed, the call refinement system 106 can determine that a ground truth structural variant call has been incorrectly labeled by determining the structural variant criteria associated with the ground truth structural variant call. Specifically, the call refinement system 106 analyzes sequencing data (e.g., nucleotide reads and other information shown in the IGV chart 700) to determine that a target genomic region of a genomic sample analyzed by a ground truth SV caller (e.g., a CCS Read-Based SV Caller) exhibits a structural variant for which no such call was made.

[0161] In some cases, to make the correction, the call refinement system 106 determines that the nucleotide read for the incorrect ground truth structural variant call satisfies one or more structural variant criteria. For example, the call refinement system 106 analyzes a concise, specific gap alignment report (CIGAR) string (e.g., a CIGAR string generated for a genomic sample and / or a reference genome) to identify ground truth nucleotide reads (e.g., CCS long reads or nanopore long reads) in the ground truth dataset that satisfy a threshold mapping quality metric. In addition, the call refinement system 106 determines a portion of the CIGAR string that includes or indicates the start index of the structural variant call generated by the call generation model (e.g., DRAGEN SV Caller) where the call is missing in the ground truth dataset. Furthermore, the call refinement system 106 determines that the start index corresponds to a structural variant and matches the length (e.g., number of base pairs) of the corresponding structural variant call generated by the call generation model (as shown in the IGV chart 700).

[0162] In one or more embodiments, as part of making corrections to the truth dataset, the call refinement system 106 compares the contiguous lengths of the truth-set nucleotide reads on either side of the structural variant call to a threshold contiguous length (e.g., a threshold number of base pairs). When searching for potential false positives in the truth dataset, the call refinement system 106 searches for truth-set nucleotide reads (e.g., CCS long reads) whose alignment to the reference genome supports the initial structural variant call from the call generation model. For example, the call refinement system 106 determines whether the following criteria are met: i) the mapping quality metric for the truth-set nucleotide read meets a threshold mapping quality metric, and ii) both ends of the truth-set nucleotide read align outside a specific reference range of genomic coordinates. Specifically, the call refinement system 106 determines a reference range of genomic coordinates based on the genomic coordinates of the initial structural variant call.

[0163] For example, the call refinement system 106 determines a reference range of genomic coordinates defined by A-D to B-D, where A and B represent the ends of the structural variant call in the reference genomic coordinates, and D represents a minimum neighbor size threshold (e.g., 1,000-2,000 base pairs). The motivation for setting a minimum neighbor size threshold is to increase the likelihood that truth-set nucleotide reads will be accurately aligned at the position of the structural variant. If the neighbor size is too short, CCS long reads or nanopore long reads as truth-set nucleotide reads are susceptible to alternative (and possibly inaccurate) alignments similar to short reads.

[0164] As mentioned above, in certain described embodiments, the call refinement system 106 uses one or more training datasets to train the structural variant refinement machine learning model. In particular, the call refinement system 106 utilizes a five-way split of the training data for cross-validation. Figure 8 shows an exemplary table illustrating the split of the training data for cross-validation and corresponding performance of the structural variant refinement machine learning model, according to another embodiment.

[0165] As shown in FIG. 8 , table 800 shows six training datasets for genomic samples HG002-HG007. Table 800 also shows the number of false positives and false negatives generated by the structural variant refinement machine learning model when trained on each training dataset. The call refinement system 106 performs cross-validation training by selecting a portion of each training dataset (e.g., 1 / 5 or 20%) to use as test data, while using the remaining portion (e.g., 4 / 5 or 80%) as training data for learning or adjusting model parameters. In effect, table 800 shows the gaps in which the corresponding data portions are withheld for testing, i.e., the gaps are shifted one position to the right for each training dataset to represent different withheld portions for cross-validation.

[0166] Because ground truth data for structural variants can be difficult to find in large quantities and can be inaccurate when relying on the CCS Read-Based SV Caller as a proxy for ground truth, researchers used the base call quality score ("QS") for structural variant calls determined by a call generation model (e.g., DRAGEN SV Caller) as an approximate ground truth. Notably, as a point of comparison, Table 800 includes estimates of false negative structural variant calls ("FN") and false positive structural variant calls ("FP") for call generation models based on a threshold base call quality score ("QS"), such as a Q score of 20 or a Q score of 30. As shown in Table 800, positive structural variant calls with base call quality scores below the threshold base call quality score are counted as false positive structural variant calls. In contrast, negative structural variant calls with base call quality scores below the threshold base call quality score are counted as false negative structural variant calls. Table 800 counts false positive and false negative structural variant calls using the same approach for the call generation model, both with and without corrected structural variant calls, using the structural variant refinement machine learning model.

[0167] As shown, for each of HG002-HG007, the call refinement system 106 reduces the number of false-negative and false-positive structural variant calls by correcting the structural variant calls based on the false-positive likelihood output by the structural variant refinement machine learning model, compared to the absence of such corrected structural variant calls determined by the call generation model. In this example, the structural variant reference machine learning model takes the form of XGBoost. For most genomic samples HG002-HG007, the call refinement system 106 demonstrates a 25-50% reduction in FP+FN by using the structural variant refinement machine learning model.

[0168] As just described, researchers have demonstrated improved accuracy of the call refinement system 106 compared to conventional systems. In particular, the researchers compared results when training various machine learning architectures using the corrected ground truth dataset and sequencing metrics described herein. Figure 9 illustrates an exemplary graph of experimental results of various machine learning architectures for a structural variant refinement machine learning model compared to call generation model SV Caller quality, according to one or more embodiments.

[0169] As illustrated in FIG. 9 , the receiver operating characteristic (ROC) curves in graph 900 show the performance for various versions or architectures of structural variant refinement machine learning models. Specifically, graph 900 shows the results of training different machine learning architectures to determine small-size deletion calls for variants 50 to 200 base pairs in length. For comparison, graph 900 also shows the performance of the call generation model, SV Caller. When evaluating ROC curves, the fit in the upper left of graph 900 indicates better performance, with a higher true positive rate ("TPR") and a lower false positive rate ("FPR").

[0170] As shown in Figure 9, each version of the structural variant refinement machine learning model outperforms the call generation model SV Caller alone (e.g., the call generation model). In the experiments shown, the best-performing architectures for the structural variant refinement machine learning model are gradient boosting trees (e.g., XGBoost) and random forest models, which show the highest area under the curve ("AUC").

[0171] In certain embodiments, the call refinement system 106 generates or determines an importance measure associated with each sequencing metric. For example, an importance measure may refer to a measure of the effect, influence, or impact that a sequencing metric has on determining or predicting a structural variant call. For example, an importance measure indicates the extent to which one sequencing metric plays a role over different nucleotide base calls (and compared to other sequencing metrics) in determining a nucleotide base call. Figure 10 shows an exemplary graph illustrating importance measures for several sequencing metrics, according to one or more embodiments.

[0172] As illustrated in FIG. 10, graph 1000 shows a ranked order of sequencing metrics (e.g., for deletions) based on their respective importance measures. For example, call refinement system 106 determines an importance measure for each sequencing metric used to generate deletions. In some cases, call refinement system 106 determines different importance measures for the same sequencing metric for different types of structural variants. To determine the importance measure, call refinement system 106 determines a weight to apply to each sequencing metric, taking into account its impact on the resulting structural variant call determined via the structural variant refinement machine learning model.

[0173] As shown, graph 1000 shows "alternative support function" (e.g., the percentage of nucleotide reads with sufficient overlap of structural variant break-ends to have perfect or near-perfect alignment with alternative contiguous sequences) as the most important sequencing metric with the highest weight. Graph 1000 further shows importance measures for other sequencing metrics in descending order of importance for (using) structural variant refinement machine learning models to determine deletions.

[0174] For a more complete list of sequencing metrics including indications of respective importance measures for different structural variants, the call refinement system 106 determines one or more of the following read-based sequencing metrics: i) an alternative support ratio (high importance for deletions, high importance for insertions), indicating the percentage of nucleotide reads with sufficient overlap of the structural variant break-ends to have perfect or near-perfect alignment with the alternative contiguous sequence; ii) a left soft-clipped count (high importance for deletions, high importance for insertions), indicating the number of nucleotide reads that support the alternative sequence with the most common deletion length inferred from remapping of right soft-clipped reads; iii) a left soft-clipped count (high importance for deletions, high importance for insertions), indicating the number of nucleotide reads that support the alternative sequence with the most common deletion length inferred from remapping of right soft-clipped reads; ) Nearby structural variant calls, indicating whether there is another structural variant call within a threshold number of base pairs of the initial structural variant call (high importance for deletions, high importance for insertions); iv) Low MAPQ counts, indicating the number of reads that are fully aligned to the alternative contiguous sequence with at least the threshold mapping quality metric (high importance for deletions, high importance for insertions); v) Insertion size statistics, indicating the mean and median insertion size of nucleotide reads that support the alternative sequence more than the reference sequence (high importance for deletions, medium importance for insertions); vi) Estimated deletion length and call generation model SV length based on realignment of right soft-clipped reads (e.g., DRAGEN vii) right adjacent soft clip count (moderate importance for deletions, high importance for insertions), indicating the count of nucleotide reads that support the alternative sequence with the most common deletion length inferred from remapping of right soft clipped reads; viii) soft left offset (moderate importance for deletions, low importance for insertions), indicating the offset between the estimated deletion length based on realignment of left soft clipped reads and the call generation model SV length; and ix) call generation model SV, which represents the likelihood that a structural variant will be called.x) Quality Score (medium importance for deletions, high importance for insertions), indicating the quality score from the caller; x) Reference / Alternate Insertion Size Log-Likelihood Ratio (medium importance for deletions, medium importance for insertions), indicating the likelihood ratio of the reference to the alternative based on the implied insertion size of the read; xi) Median Read Depth (medium importance for deletions, low importance for insertions), indicating the median read depth across the range of structural variants with at least a threshold MAPQ (e.g., MAPQ>20); xii) Alternate Forward Support Ratio (medium importance for deletions, low importance for insertions), indicating the percentage of nucleotide reads that are fully aligned to the alternative contiguous sequence and have a forward orientation; xiii) Extended MAPQ Standard Deviation (low importance for deletions, medium importance for insertions), which indicates the standard deviation of MAPQ across reads with perfect alignment to the alternative contiguous sequence on an extended MAPQ scale (e.g., maximum MAPQ=250), xiv) Left / Right Median Depth (low importance for deletions, low importance for insertions), which indicates the median read depth of the left and right flanking regions, respectively, and xv) Split Read Counts (moderate importance for deletions, medium importance for insertions), which indicates the split read counts supporting the reference sequence and the split read counts supporting the alternative sequence. Some of these features are described in more detail above.

[0175] For a more complete list of reference-based sequencing metrics, including an indication of the respective importance scales for different structural variants, the call refinement system 106 determines one or more of the following reference-based sequencing metrics: i) tandem repeat length (high importance for deletions, high importance for insertions), indicating the length of the tandem repeat sequence in the local reference across the coordinates of the initial structural variant call (if the reference is not a tandem repeat, this metric is 0); ii) the number of tandem repeats in the initial structural variant call, indicating the number of tandem repeats in the local reference across the coordinates of the initial structural variant call; ii) tandem repeat ratio (high importance for deletions, high importance for insertions), which indicates the ratio or comparison between tandem repeat length and structural variant length (e.g., TR length / SV length) in the reference sequence; iii) tandem repeat match percentage (medium importance for deletions, low importance for insertions), which indicates the accuracy of the match between tandem repeats in the reference sequence; iv) normalized alignment score of the alternative contig to the reference corrected for variants only (e.g., a measure of the divergence of the alternative contig from the reference in the flanking regions). v) Alternate / Reference Alignment: Estimated SV Length, indicating the estimated total length of the deletion or insertion based on the CIGAR string from the alignment of the alternative contiguous sequence to the reference sequence corrected for the variant only without soft clipping (medium importance for deletions, high importance for insertions); vi) Quadruple Reference Permutation Entropy, indicating the entropy measure of the quadruple nucleotide sequence in the local reference sequence (high importance for deletions, low importance for insertions); vii) Reference Palindrome Match (medium importance for deletions, medium importance for insertions), which indicates a measure of the closeness of the local reference sequence to the palindrome in the region of the structural variant (which may be a predictor of chromosome folding); viii) Reference → Alternate Levenshtein Distance (medium importance for deletions, low importance for insertions), which indicates the Levenshtein distance between the alternative contiguous sequence and the reference sequence corrected only for the variant (another measure of the divergence of the alternative contig from the reference in the adjacent region);ix) Dipalindromic permutation entropy, which indicates a measure of entropy of dinucleotide sequences for palindromic (or near-palindromic) sections of the local reference sequence (medium importance for deletions, low importance for insertions); x) Trireference permutation entropy, which indicates a measure of entropy of trinucleotide sequences in the local reference sequence (medium importance for deletions, high importance for insertions); xi) Tandem repeat permutation entropy, which indicates a measure of entropy of dinucleotide sequences in tandem repeat sections of the local reference sequence (low importance for deletions, , low importance for insertions), xii) deletion sequence alignment score (low importance for deletions, medium importance for insertions), which indicates the normalized alignment score of a deleted variant sequence to the left / right flanks of the local reference sequence, xiii) single-reference permutation entropy (low importance for deletions, low importance for insertions), which indicates the entropy measure of a single nucleotide in the local reference sequence, and xiv) double-reference permutation entropy (low importance for deletions, medium importance for insertions), which indicates the entropy measure of a dinucleotide in the local reference sequence. Some of these features are described in more detail above.

[0176] For a more complete list of variant region quality sequencing metrics, including an indication of the respective importance measures for different structural variants, the call refinement system 106 determines one or more of the following variant region quality sequencing metrics: i) the number of soft-clipped reads (moderate importance for deletions, medium importance for insertions) with a large number of bases with low base call quality, indicating the proportion of soft-clipped reads with a large number of nucleotide bases called with a low base call quality (e.g., BQ<15), and ii) the calculation of the median base call quality (BQ) for each column among the alternative supporting reads aligned to the alternative contiguous sequence and the alternative contiguous sequences with low base call quality (low importance for deletions, low importance for insertions), indicating the median count below a threshold (e.g., 20). These features are described in more detail above.

[0177] Referring now to Figure 11, this figure shows an illustrative flowchart of a series of operations for determining revised structural variant calls from false positive likelihoods using a structural variant refinement machine learning model, according to one or more embodiments. While Figure 11 shows operations according to one embodiment, alternative embodiments may omit, add, reorder, and / or modify any of the operations shown in Figure 11. The operations of Figure 11 may be performed as part of a method. Alternatively, a non-transitory computer-readable storage medium may include instructions that, when executed by one or more processors, cause a computing device to perform the operations shown in Figure 11. In yet a further embodiment, a system includes at least one processor and a non-transitory computer-readable medium including instructions that, when executed by one or more processors, cause the system to perform the operations of Figure 11.

[0178] 11 , the series of operations 1100 includes operation 1102, which determines an initial structural variant call. In particular, operation 1102 may include determining an initial structural variant call for one or more genomic coordinates of the genomic sample based on nucleotide reads corresponding to the genomic sample. For example, operation 1102 may include determining deletions of more than a threshold number of base pairs, insertions of more than a threshold number of base pairs, duplications of more than a threshold number of base pairs, inversions, translocations, or copy number variations (CNVs). In some cases, operation 1102 involves determining structural variant calls for several base pairs within a threshold range of base pairs.

[0179] Additionally, the series of operations 1100 includes an operation 1104 that identifies sequencing metrics for the initial structural variant calls. In particular, operation 1104 may involve identifying sequencing metrics corresponding to one or more of the initial structural variant calls or one or more genomic coordinates. For example, operation 1104 may involve identifying one or more of read-based sequencing metrics, reference-based sequencing metrics, or variant region quality sequencing metrics. In some cases, operation 1104 includes utilizing a call generation model to determine that base calls corresponding to one or more genomic coordinates of the genomic sample are indicative of structural variants relative to the reference genome.

[0180] Identifying read-based sequencing metrics may include determining, for the initial structural variant call, one or more of: a base call quality score; a percentage of nucleotide reads that support an alternative contiguous sequence from the reference genome; a number of split nucleotide reads from the nucleotide read corresponding to the initial structural variant call; a coverage depth of the nucleotide read corresponding to the initial structural variant call; additional structural variant calls located within a threshold number of base pairs from the initial structural variant call in the genomic sample; an alignment of the contiguous sequence corresponding to the nucleotide read with a reference sequence of the reference genome modified to include the structural variant corresponding to the initial structural variant call; a deletion length in nucleotide bases based on one or more soft-clipped nucleotide reads; a number of nucleotide reads that exhibit a mapping quality metric that does not meet a threshold mapping quality metric; an insert size corresponding to one or more genomic coordinates of the genomic sample; or a likelihood ratio between the reference call and the alternative call based on insert size.

[0181] As part of operation 1104, identifying variant region quality sequencing metrics may involve determining one or more of: a number of nucleotide reads that include at least a threshold number of base calls and that correspond to the target genomic region for the initial structural variant call, or a number of nucleotide bases in an alternative contiguous sequence that corresponds to the target genomic region from the reference genome where the base calls for the nucleotide reads do not meet a threshold base call quality score. As a further part of operation 1104, identifying reference-based sequencing metrics may involve identifying one or more of: tandem repeat length in nucleotide bases, or permutation entropy of nucleotide bases, cytosine quadruplexes (C-quadruplexes), or guanine quadruplexes (G-quadruplexes) within one or more genomic regions of the reference genome that correspond to one or more genomic coordinates of the genomic sample.

[0182] Further, the series of operations 1100 includes an operation 1106 of generating a false positive likelihood from the sequencing metrics. In particular, operation 1106 may involve utilizing a structural variant refinement machine learning model based on the sequencing metrics to generate a false positive likelihood indicating the likelihood that the initial structural variant call is a false positive. For example, operation 1106 may involve determining, based on the sequencing metrics, that the initial structural variant call is a false positive call or a true positive call. As a further example, operation 1106 may involve utilizing a structural variant refinement machine learning model based on the sequencing metrics and the initial structural variant call as inputs to generate the false positive likelihood.

[0183] Additionally, the series of operations 1100 includes operation 1108, which determines a revised structural variant call based on the false positive likelihood. In particular, operation 1108 may involve determining a revised structural variant call for one or more genomic coordinates of the genomic sample based on the false positive likelihood. For example, operation 1108 may involve changing the initial structural variant call from a positive structural variant call to a negative structural variant call based on the initial structural variant call being a false positive call, or changing the initial structural variant call from a negative structural variant call to a positive structural variant call based on the initial structural variant call being a true positive call. In some cases, operation 1108 involves correcting the initial structural variant call for one or more genomic coordinates based on the false positive likelihood generated by the structural variant refinement machine learning model.

[0184] In some embodiments, the series of operations 1100 involves determining, based on one or more truth-set nucleotide reads from a truth dataset for the ground truth structural variant call that meets the structural variant criteria, that the ground truth structural variant call corresponding to the revised structural variant call is incorrectly labeled as a false positive rather than a true positive. The series of operations 1100 may also include changing the labeling of the ground truth structural variant call from a false positive to a true positive. Furthermore, the series of operations 1100 may include adjusting parameters of a structural variant refinement machine learning model based on a comparison between the revised structural variant call and the ground truth structural variant call.

[0185] In one or more embodiments, determining that a ground truth structural variant call is incorrectly labeled based on a structural variant criterion may involve analyzing a concise, specific gap alignment report (CIGAR) string to identify truth set nucleotide reads of the truth dataset that meet a threshold mapping quality metric; determining a portion of the CIGAR string that includes a start index of a corresponding structural variant call generated by a call generation model; and determining that the start index corresponds to a structural variant and matches a length of the corresponding structural variant call generated by the call generation model.

[0186] The methods described herein can be used in conjunction with various nucleic acid sequencing techniques. Particularly applicable techniques involve attaching nucleic acids to fixed positions within an array so that their relative positions do not change, and repeatedly imaging the array. For example, embodiments in which images are obtained in different color channels corresponding to different labels used to distinguish one nucleotide base type from another are particularly applicable. In some embodiments, the process of determining the nucleotide sequence of a target nucleic acid can be an automated process. A preferred embodiment involves sequencing-by-synthesis (SBS) technology.

[0187] SBS technology generally involves the enzymatic extension of nascent nucleic acid chain by repeatedly adding nucleotide to template chain.In the traditional method of SBS, a single nucleotide monomer can be provided to target nucleic acid in the presence of polymerase in each delivery.However, in the method described herein, in the presence of polymerase during delivery, two or more types of nucleotide monomers can be provided to target nucleic acid.

[0188] SBS can utilize nucleotide monomers with terminator moieties or nucleotide monomers lacking any terminator moiety. Methods utilizing nucleotide monomers lacking terminators include, for example, pyrosequencing and sequencing using γ-phosphate-labeled nucleotides, as described in more detail below. In methods using nucleotide monomers without terminators, the number of nucleotides added in each cycle is generally variable and depends on the template sequence and the mode of nucleotide delivery. In SBS techniques utilizing nucleotide monomers with terminator moieties, the terminators can be effectively irreversible under the sequencing conditions used, as in conventional Sanger sequencing using dideoxynucleotides, or the terminators can be reversible, as in the sequencing method developed by Solexa (now Illumina, Inc.).

[0189] SBS techniques can use nucleotide monomers that have a label moiety or lack a label moiety. Therefore, incorporation events can be detected based on the properties of the label, such as the fluorescence of the label, the properties of the nucleotide monomer, such as molecular weight or charge, or by-products of nucleotide incorporation, such as the release of pyrophosphate. In embodiments in which two or more different nucleotides are present in the sequencing reagent, the different nucleotides can be distinguishable from one another, or alternatively, the two or more different labels can be distinguishable under the detection technique used. For example, the different nucleotides present in the sequencing reagent can have different labels, which can be distinguished using appropriate optical systems, as exemplified by the sequencing method developed by Solexa (now Illumina, Inc.).

[0190] A preferred embodiment is pyrosequencing, which detects the release of inorganic pyrophosphate (PPi) when a specific nucleotide is incorporated into a nascent strand (Ronaghi, M., Karamohamed, S., Pettersson, B., Uhlen, M., and Nyren, P. (1996) "Real-time DNA sequencing using detection of pyrophosphate release." Analytical Biochemistry 242(1), 84-9; Ronaghi, M. (2001) "Pyrosequencing sheds light on DNA sequencing." Genome Res. 11(1), 3-11; Ronaghi, M., Uhlen, M., and Nyren, P. (1998) "A sequencing method based on real-time pyrophosphate." Science 281(5375),363, U.S. Patent No. 6,210,891, U.S. Patent No. 6,258,568, and U.S. Patent No. 6,274,320, the disclosures of which are incorporated herein by reference in their entireties. In pyrosequencing, released PPi can be detected by its immediate conversion to adenosine triphosphate (ATP) by ATP sulfurase, and the level of generated ATP is detected via luciferase-generated photons. Nucleic acids to be sequenced can be attached to features in an array, and the array can be imaged to capture chemiluminescent signals generated by nucleotide incorporation into the array features. Images can be obtained after treating the array with specific nucleotide types (e.g., A, T, C, or G). Images obtained after the addition of each nucleotide type differ in terms of which features in the array are detected. These differences in the images reflect the different sequence content of the features on the array. However, the relative positions of each feature remain unchanged in the image. Images can be stored, processed, and analyzed using the methods described herein.For example, images obtained after treating the array with each different nucleotide type can be processed in the same manner as exemplified herein for images obtained from different detection channels for reversible terminator-based sequencing methods.

[0191] In another exemplary type of SBS, cyclic sequencing is achieved by the stepwise addition of reversible terminator nucleotides containing cleavable or photobleachable dye labels, as described, for example, in International Publication No. 04 / 018497 and U.S. Patent No. 7,057,026, the disclosures of which are incorporated by reference. This approach has been commercialized by Solexa (now Illumina Inc.) and is also described in International Publication Nos. 91 / 06678 and 07 / 123,744, each of which is incorporated by reference herein. The availability of fluorescently labeled terminators, both of whose ends can be reversed and from which the fluorescent labels are cleaved, facilitates efficient cyclic reversible termination (CRT) sequencing. Polymerases can also be co-engineered to efficiently incorporate and extend from these modified nucleotides.

[0192] Preferably, in reversible terminator-based sequencing embodiments, the label does not substantially inhibit extension under SBS reaction conditions. However, the detection label may be removable, for example, by cleavage or degradation. Images can be taken after incorporation of the label into arrayed nucleic acid features. In certain embodiments, each cycle involves simultaneous delivery of four different nucleotide types to the array, each nucleotide type having a spectrally distinct label. Four images can then be obtained, each using a detection channel selective for one of the four different labels. Alternatively, different nucleotide types can be added sequentially, with images of the array being obtained between each addition step. In such embodiments, each image shows nucleic acid features incorporating a particular type of nucleotide. Because the sequence content of each feature is different, different features may or may not be present in different images. However, the relative positions of the features remain unchanged within the image. Images obtained from such reversible terminator-SBS methods can be stored, processed, and analyzed as described herein. Following the image acquisition step, the label can be removed, and the reversible terminator moiety can be removed for subsequent cycles of nucleotide addition and detection. Removal of the label after detection in a particular cycle and before the subsequent cycle has the advantage of reducing background signal and crosstalk between cycles. Examples of useful labeling and removal methods are described below.

[0193] In certain embodiments, some or all of the nucleotide monomers can contain reversible terminators. In such embodiments, the reversible terminator / cleavable fluorophore can comprise a fluorophore attached to the ribose moiety via a 3' ester bond (Metzker, Genome Res. 15:1767-1776 (2005), which is incorporated herein by reference). Other approaches separate the terminator chemistry from the cleavage of the fluorescent label (Ruparel et al., Proc Natl Acad Sci USA 102:5932-7 (2005), which is incorporated herein by reference in its entirety). Ruparel et al. describe the development of a reversible terminator that uses a small 3' allyl group to block extension but can be easily deblocked by brief treatment with a palladium catalyst. The fluorophore was attached to the group via a photocleavable linker that can be easily cleaved by 30 seconds of exposure to long-wavelength UV light. Therefore, either disulfide reduction or photocleavage can be used as a cleavable linker. Another approach to reversible termination is the use of a natural terminator followed by the placement of a bulky dye on the dNTP. The presence of a charged bulky dye on the dNTP can act as an effective terminator through steric and / or electrostatic hindrance. The presence of one incorporation event prevents further binding unless the dye is removed. Cleavage of the dye removes the fluorophore, effectively reversing the terminus. Examples of modified nucleotides are also described in U.S. Pat. Nos. 7,427,673 and 7,057,026, the disclosures of which are incorporated herein by reference in their entireties.

[0194]

[0013] Additional exemplary SBS systems and methods that can be utilized with the methods and systems described herein are described in U.S. Patent Application Publication No. 2007 / 0166705, U.S. Patent Application Publication No. 2006 / 0188901, U.S. Patent No. 7,057,026, U.S. Patent Application Publication No. 2006 / 0240439, U.S. Patent Application Publication No. 2006 / 0281109, International Publication No. WO05 / 065814, U.S. Patent Application Publication No. 2005 / 0100900, International Publication No. WO06 / 064199, International Publication No. WO07 / 010,251, U.S. Patent Application Publication No. 2012 / 0270305, and U.S. Patent Application Publication No. 2013 / 0260372, the disclosures of which are incorporated herein by reference in their entireties.

[0195] Some embodiments may utilize detection of four different nucleotides using fewer than four different labels. For example, SBS may be performed using the methods and systems described in the incorporated document, U.S. Patent Application Publication No. 2013 / 0079232. As a first example, pairs of nucleotide types may be detected at the same wavelength but may be distinguished based on differences in intensity for one member of the pair or based on a change to one member of the pair (e.g., via chemical, photochemical, or physical modification) that results in the appearance or disappearance of a distinct signal compared to the signal detected for the other member of the pair. As a second example, three of the four different nucleotide types may be detected under certain conditions, while the fourth nucleotide type may have no detectable label under those conditions or may be minimally detected under those conditions (e.g., minimal detection due to background fluorescence, etc.). Incorporation of the first three nucleotide types into a nucleic acid may be determined based on the presence of their respective signals, and incorporation of the fourth nucleotide type into a nucleic acid may be determined based on the absence or minimal detection of any signal. As a third example, one nucleotide type can include a label that is detected in two different channels, while the other nucleotide type is detected in no more than one of the channels. The foregoing three exemplary configurations are not considered mutually exclusive and can be used in various combinations.An exemplary embodiment combining all three examples is a fluorescence-based SBS method that uses a first nucleotide type that is detected in a first channel (e.g., dATP having a label that is detected in the first channel when excited by a first excitation wavelength), a second nucleotide type that is detected in a second channel (e.g., dCTP having a label that is detected in the second channel when excited by a second excitation wavelength), a third nucleotide type that is detected in both the first and second channels (e.g., dTTP having at least one label that is detected in both channels when excited by the first and / or second excitation wavelength), and a fourth nucleotide type that is not detected or minimally detected in either channel (e.g., unlabeled dGTP).

[0196] Furthermore, as described in incorporated U.S. Patent Application Publication No. 2013 / 0079232, sequencing data can be obtained using a single channel. In such so-called single-dye sequencing methods, a first nucleotide type is labeled but the label is removed after the first image is generated, and a second nucleotide type is labeled only after the first image is generated. A third nucleotide type retains its label in both the first and second images, and a fourth nucleotide type remains unlabeled in both images.

[0197] Some embodiments may utilize sequencing by ligation techniques. Such techniques utilize DNA ligase to incorporate oligonucleotides and identify their incorporation. The oligonucleotides typically have different labels that correlate with the identity of specific nucleotides in the sequence to which the oligonucleotides hybridize. As with other SBS methods, images can be obtained after treating an array of nucleic acid features with labeled sequencing reagents. Each image shows nucleic acid features that incorporate a specific type of label. Because the sequence content of each feature varies, different features may or may not be present in different images, but the relative positions of the features remain constant within the image. Images obtained from ligation-based sequencing methods can be stored, processed, and analyzed as described herein. Exemplary SBS systems and methods that can be utilized with the methods and systems described herein are described in U.S. Patent Nos. 6,969,488, 6,172,218, and 6,306,597, the disclosures of which are incorporated herein by reference in their entireties.

[0198] Some embodiments can utilize nanopore sequencing (Deamer, DW & Akeson, M. "Nanopores and nucleic acids: prospects for ultrarapid sequencing." Trends Biotechnol. 18, 147-151 (2000); Deamer, D. and D. Branton, "Characterization of nucleic acids by nanopore analysis." Acc. Chem. Res. 35:817-825 (2002); Li, J., M. Gershow, D. Stein, E. Brandin, and J. A. Golovchenko, "DNA molecules and configurations in a solid-state nanopore microscope." Nat. Mater. 2:611-615 (2003), the disclosures of which are incorporated herein by reference in their entireties). In such embodiments, the target nucleic acid passes through a nanopore. The nanopore can be a synthetic pore or a biological membrane protein, such as α-hemolysin. As the target nucleic acid passes through the nanopore, each base pair can be identified by measuring the fluctuations in the electrical conductance of the pore. (U.S. Pat. No. 7,001,792; Soni, GV & Meller, "A. Progress toward ultrafast DNA sequencing using solid-state nanopores." Clin. Chem. 53, 1996-2001 (2007); Healy, K. "Nanopore-based single-molecule DNA analysis." Nanomed. 2, 459-481 (2007); Cockroft, SL, Chu, J., Amorin, M. & Ghadiri, MR "A single-molecule nanopore device detects DNA polymerase activity with single-nucleotide resolution." J. Am Chem. Soc. 130, 818-820 (2008), the disclosures of which are incorporated herein by reference in their entireties.)The data obtained from nanopore sequencing can be stored, processed, and analyzed as described herein. Specifically, the data can be processed as images according to the exemplary processing of optical and other images described herein.

[0199] Some embodiments can utilize methods involving real-time monitoring of DNA polymerase activity. Nucleotide incorporation can be detected via fluorescence resonance energy transfer (FRET) interactions between a fluorophore-containing polymerase and a γ-phosphate-labeled nucleotide, as described, for example, in U.S. Patent No. 7,329,492 and U.S. Patent No. 7,211,414 (each of which is incorporated herein by reference), or nucleotide incorporation can be detected using zero-mode waveguides, as described, for example, in U.S. Patent No. 7,315,019 (each of which is incorporated herein by reference), and fluorescent nucleotide analogs and engineered polymerases, as described, for example, in U.S. Patent No. 7,405,281 and U.S. Patent Application Publication No. 2008 / 0108082 (each of which is incorporated herein by reference). Illumination can be restricted to a zeptoliter-scale volume around the surface-tethered polymerase so that incorporation of fluorescently labeled nucleotides can be observed with low background (Levene, MJ et al., "Zero-mode waveguides for single-molecule analysis at high concentrations." Science, 299, 682-686 (2003); Lundquist, PM et al., "Parallel confocal detection of single molecules in real time." Opt. Lett. 33, 1026-1028 (2008); Korlach, J. et al., "Selective aluminum passivation for targeted immobilization of single DNA polymerase molecules in zero-mode waveguide nanostructures." Proc. Natl. Acad. Sci. USA 105, 1176-1181 (2008), the disclosures of which are incorporated herein by reference in their entireties).Images obtained from such methods can be stored, processed, and analyzed as described herein.

[0200] Some SBS embodiments involve the detection of protons released upon incorporation of a nucleotide into an extension product. For example, sequencing based on the detection of released protons can use commercially available electrical detectors and related technology from Ion Torrent (Guilford, CT, a subsidiary of Life Technologies), or the sequencing methods and systems described in U.S. Patent Application Publication Nos. 2009 / 0026082 (A1), 2009 / 0127589 (A1), 2010 / 0137143 (A1), or 2010 / 0282617 (A1), each of which is incorporated herein by reference. The methods described herein for amplifying target nucleic acids using kinetic exclusion can be easily adapted to substrates used for detecting protons. More specifically, the methods described herein can be used to generate clonal populations of amplicons used for detecting protons.

[0201] The SBS method described above can be advantageously performed in a multiplex format, allowing multiple different target nucleic acids to be manipulated simultaneously. In certain embodiments, the different target nucleic acids can be processed in a common reaction vessel or on the surface of a particular substrate. This allows for convenient delivery of sequencing reagents, removal of unreacted reagents, and detection of incorporation events in a multiplexed manner. In embodiments using surface-bound target nucleic acids, the target nucleic acids can be in an array format. In an array format, the target nucleic acids are typically bound to a surface in a spatially distinguishable manner. The target nucleic acids can be bound by direct covalent binding, binding to beads or other particles, or binding to a surface-bound polymerase or other molecule. The array can contain a single copy of the target nucleic acid at each site (also referred to as a feature), or multiple copies with the same sequence can be present at each site or feature. Multiple copies can be generated by amplification methods such as bridge amplification or emulsion PCR, which are described in more detail below.

[0202] The methods described herein can use arrays having any of a variety of densities of features, including, for example, at least about 10 features / cm, 100 features / cm, 500 features / cm, 1,000 features / cm, 5,000 features / cm, 10,000 features / cm, 50,000 features / cm, 100,000 features / cm, 1,000,000 features / cm, 5,000,000 features / cm, or more.

[0203] An advantage of the methods described herein is that they provide rapid and efficient detection of multiple target nucleic acids in parallel. Accordingly, the present disclosure provides an integrated system capable of preparing and detecting nucleic acids using techniques known in the art, such as those exemplified above. Accordingly, the integrated system of the present disclosure can include fluidic components capable of delivering amplification and / or sequencing reagents to one or more immobilized DNA fragments, including components such as pumps, valves, reservoirs, and fluid lines. A flow cell can be configured and / or used in the integrated system for detecting target nucleic acids. Exemplary flow cells are described, for example, in U.S. Patent Application Publication No. 2010 / 0111768 (A1) and U.S. Patent Application No. 13 / 273,666, each of which is incorporated herein by reference. As exemplified for the flow cell, one or more of the fluidic components of the integrated system can be used in the amplification and detection methods. Taking a nucleic acid sequencing embodiment as an example, one or more of the fluidic components of the integrated system can be used to deliver sequencing reagents in the amplification methods described herein and in the sequencing methods exemplified above. Alternatively, an integrated system may include separate fluidic systems for performing the amplification method and for performing the detection method. Examples of integrated sequencing systems capable of producing amplified nucleic acids and sequencing the nucleic acids include, but are not limited to, the MiSeq™ platform (Illumina, Inc., San Diego, CA) and the apparatus described in U.S. Patent Application No. 13 / 273,666, which is incorporated herein by reference.

[0204] The sequencing system described above sequences nucleic acid polymers present in a sample received by the sequencing device. As defined herein, "sample" and its derivatives are used in the broadest sense and include any sample, culture, etc. suspected of containing a target. In some embodiments, a sample includes DNA, RNA, PNA, LNA, chimeric, or hybrid forms of nucleic acid. A sample can include any biological, clinical, surgical, agricultural, air, or water sample containing one or more nucleic acids. The term also includes any isolated nucleic acid sample, such as genomic DNA, fresh-frozen, or formalin-fixed, paraffin-embedded nucleic acid sample. It is also contemplated that a sample can be derived from a single individual, a collection of nucleic acid samples from genetically related members, nucleic acid samples from genetically unrelated members, nucleic acid samples from a single individual (matched), such as a tumor sample and a normal tissue sample, or a sample from a single source containing two different forms of genetic material, such as maternal and fetal DNA obtained from a maternal subject, or the presence of contaminating bacterial DNA in a sample containing plant or animal DNA. In some embodiments, the source of nucleic acid material can include nucleic acid obtained from a newborn, such as is typically used for newborn screening.

[0205] A nucleic acid sample can include high molecular weight material, such as genomic DNA (gDNA). A sample can include low molecular weight material, such as nucleic acid molecules obtained from FFPE or archived DNA samples. In another embodiment, the low molecular weight material includes enzymatically or mechanically fragmented DNA. A sample can include cell-free circulating DNA. In some embodiments, a sample can include nucleic acid molecules obtained from biopsies, tumors, scrapings, swabs, blood, mucus, urine, plasma, semen, hair, laser capture microdissection, surgical resection, and other clinical or laboratory samples. In some embodiments, a sample can be an epidemiological, agricultural, forensic, or pathogenic sample. In some embodiments, a sample can include nucleic acid molecules obtained from animals, such as humans or mammalian sources. In another embodiment, a sample can include nucleic acid molecules obtained from non-mammalian sources, such as plants, bacteria, viruses, or fungi. In some embodiments, the source of the nucleic acid molecules can be an archived or extinct sample or species.

[0206] Additionally, the methods and compositions disclosed herein may be useful for amplifying nucleic acid samples with low-quality nucleic acid molecules, such as degraded and / or fragmented genomic DNA from forensic samples. In one embodiment, a forensic sample may include nucleic acids obtained from a crime scene, from a missing persons DNA database, from a laboratory associated with a forensic investigation, or may include forensic samples obtained by law enforcement agencies, one or more military services, or any such personnel. A nucleic acid sample may be crude DNA, including purified samples or lysates, derived from, for example, oral swabs, paper, cloth, or other substrates that may be impregnated with saliva, blood, or other bodily fluids. Thus, in some embodiments, a nucleic acid sample may contain small amounts of DNA or fragmented portions of DNA, such as genomic DNA. In some embodiments, target sequences may be present in one or more bodily fluids, including, but not limited to, blood, sputum, plasma, semen, urine, and serum. In some embodiments, target sequences may be obtained from hair, skin, tissue samples, autopsies, or remains of victims. In some embodiments, nucleic acids containing one or more target sequences may be obtained from deceased animals or humans. In some embodiments, the target sequence can comprise nucleic acid obtained from non-human DNA, such as microbial, plant, or entomological DNA. In some embodiments, the target sequence or amplified target sequence is intended for human identification. In some embodiments, the present disclosure generally relates to methods for identifying characteristics of forensic samples. In some embodiments, the present disclosure generally relates to human identification methods using one or more target-specific primers disclosed herein or one or more target-specific primers designed using the primer design criteria outlined herein. In one embodiment, a forensic sample or human identification sample containing at least one target sequence can be amplified using any one or more of the target-specific primers disclosed herein or using the primer criteria outlined herein.

[0207] Components of the call refinement system 106 may include software, hardware, or both. For example, components of the call refinement system 106 may include one or more instructions stored on a computer-readable storage medium and executable by a processor of one or more computing devices (e.g., client device 108). When executed by one or more processors, the computer-executable instructions of the call refinement system 106 cause the computing devices to perform the call refinement methods described herein. Alternatively, components of the call refinement system 106 may include hardware, such as a dedicated processing device for performing a particular function or group of functions. Additionally or alternatively, components of the call refinement system 106 may include a combination of computer-executable instructions and hardware.

[0208] Furthermore, components of the call refinement system 106 that perform the functionality described herein with respect to the call refinement system 106 may be implemented, for example, as part of a standalone application, as a module of an application, as a plug-in to an application, as a library function that can be called by other applications, and / or as a cloud computing model. Thus, components of the call refinement system 106 may be implemented as part of a standalone application on a personal computing device or a mobile device. Additionally or alternatively, components of the call refinement system 106 may be implemented in any application that provides sequencing services, including, but not limited to, Illumina BaseSpace, Illumina DRAGEN, Illumina DRAGEN SV Caller, or Illumina TruSight software. "Illumina," "BaseSpace," "DRAGEN," "DRAGEN SV," "DRAGEN SV Caller," and "TruSight" are registered trademarks or trademarks of Illumina, Inc. in the United States and / or other countries.

[0209] Embodiments of the present disclosure may include or utilize special purpose or general purpose computers, including computer hardware such as, for example, one or more processors and system memory, as discussed in more detail below. Embodiments within the scope of the present disclosure also include physical and other computer-readable media for carrying or storing computer-executable instructions and / or data structures. In particular, one or more of the processes described herein may be embodied in a non-transitory computer-readable medium and implemented at least in part as instructions executable by one or more computing devices (e.g., any of the media content access devices described herein). Generally, a processor (e.g., a microprocessor) receives instructions from a non-transitory computer-readable medium (e.g., memory, etc.) and executes those instructions, thereby performing one or more processes, including one or more of the processes described herein.

[0210] Computer-readable media may be any available media that can be accessed by a general-purpose or special-purpose computer system. Computer-readable media that store computer-executable instructions are non-transitory computer-readable storage media (devices). Computer-readable media that carry computer-executable instructions are transmission media. Thus, by way of example, and not limitation, embodiments of the present disclosure may include at least two distinctly different kinds of computer-readable media: non-transitory computer-readable storage media (devices) and transmission media.

[0211] Non-transitory computer-readable storage media (devices) include RAM, ROM, EEPROM, CD-ROM, solid state drives (SSD) (e.g., based on RAM), flash memory, phase-change memory (PCM), other types of memory, other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other medium that can be used to store desired program code means in the form of computer-executable instructions or data structures and that can be accessed by a general-purpose or special-purpose computer.

[0212] A "network" is defined as one or more data links that enable the transport of electronic data between computer systems and / or modules and / or other electronic devices. When information is transferred or provided to a computer over a network or another communications connection (either hardwired, wireless, or a combination of hardwired or wireless), the computer properly views the connection as a transmission medium. Transmission media can be used to transport desired program code means in the form of computer-executable instructions or data structures and can include networks and / or data links that can be accessed by a general-purpose or special-purpose computer. Combinations of the above should also be included within the scope of computer-readable media.

[0213] Furthermore, upon reaching various computer system components, program code means in the form of computer-executable instructions or data structures may be automatically transferred from transmission media to non-transitory computer-readable storage media (devices) (or vice versa). For example, computer-executable instructions or data structures received over a network or data link may be buffered in RAM within a network interface module (e.g., a NIC) and then eventually transferred to computer system RAM and / or less volatile computer storage media (devices) within the computer system. Thus, it should be understood that non-transitory computer-readable storage media (devices) may be included in computer system components that also (or even primarily) utilize transmission media.

[0214] Computer-executable instructions include, for example, instructions and data that, when executed by a processor, cause a general-purpose computer, a special-purpose computer, or a special-purpose processing device to perform a certain function or group of functions. In some embodiments, computer-executable instructions are executed on a general-purpose computer to transform the general-purpose computer into a special-purpose computer that implements elements of the present disclosure. Computer-executable instructions may be, for example, binaries, intermediate format instructions such as assembly language, or even source code. While the subject matter has been described in language specific to structural features and / or methodological acts, it should be understood that the subject matter defined in the appended claims is not necessarily limited to the described features or acts described above. Rather, the described features and acts are disclosed as example forms of implementing the claims.

[0215] Those skilled in the art will appreciate that the present disclosure may be implemented in networked computing environments having many types of computer system configurations, including personal computers, desktop computers, laptop computers, message processors, handheld devices, multiprocessor systems, microprocessor-based or programmable consumer electronics, network PCs, minicomputers, mainframe computers, cellular phones, PDAs, tablets, pagers, routers, switches, etc. The present disclosure may also be implemented in distributed system environments where tasks are performed by both local and remote computer systems that are linked through a network (either by hardwired data links, wireless data links, or a combination of hardwired and wireless data links). In a distributed system environment, program modules may be located in both local and remote memory storage devices.

[0216] Embodiments of the present disclosure may also be implemented in a cloud computing environment. As used herein, "cloud computing" is defined as a model for enabling on-demand network access to a shared pool of configurable computing resources. For example, cloud computing may be adopted in markets to provide ubiquitous, convenient, on-demand access to a shared pool of configurable computing resources. The shared pool of configurable computing resources can be quickly configured through virtualization, exposed with low management effort or service provider interaction, and then scaled accordingly.

[0217] Cloud computing models can consist of various characteristics, such as, for example, on-demand self-service, wide area network access, resource pooling, rapid elasticity, and measured service. Cloud computing models can also expose various service models, such as, for example, Software as a Service (SaaS), Platform as a Service (PaaS), and Infrastructure as a Service (IaaS). Cloud computing models can also be deployed using different deployment models, such as private cloud, community cloud, public cloud, and hybrid cloud. As used herein and in the claims, a "cloud computing environment" is an environment in which cloud computing is employed.

[0218] 12 illustrates a block diagram of a computing device 1200 that may be configured to perform one or more of the processes described above. It will be understood that one or more computing devices, such as computing device 1200, may implement call refinement system 106 and sequencing system 104. As illustrated by FIG. 12 , computing device 1200 may include a processor 1202, a memory 1204, a storage device 1206, an I / O interface 1208, and a communication interface 1210, which may be communicatively coupled by a communication infrastructure 1212. In certain embodiments, computing device 1200 may include fewer or more components than those illustrated in FIG. 12 . The following paragraphs describe in more detail the components of computing device 1200 illustrated in FIG. 12 .

[0219] In one or more embodiments, processor 1202 includes hardware for executing instructions, such as those comprising a computer program. By way of example and not limitation, to execute instructions for dynamically modifying a workflow, processor 1202 may retrieve (or fetch) instructions from an internal register, an internal cache, memory 1204, or storage device 1206, decode them, and execute them. Memory 1204 may be volatile or non-volatile memory used to store data, metadata, and programs for execution by the processor. Storage device 1206 includes storage, such as a hard disk, flash disk drive, or other digital storage device, for storing data or instructions for implementing the methods described herein.

[0220] I / O interface 1208 enables a user to provide input to, receive output from, or otherwise transfer data to or receive data from computing device 1200. I / O interface 1208 may include a mouse, a keypad or keyboard, a touchscreen, a camera, an optical scanner, a network interface, a modem, other known I / O devices, or a combination of such I / O interfaces. I / O interface 1208 may include one or more devices for presenting output to a user, including, but not limited to, a graphics engine, a display (e.g., a display screen), one or more output drivers (e.g., a display driver), one or more audio speakers, and one or more audio drivers. In a particular embodiment, I / O interface 1208 is configured to provide graphical data to a display for presentation to a user. The graphical data may represent one or more graphical user interfaces and / or any other graphical content that may be useful in a particular implementation.

[0221] Communications interface 1210 may include hardware, software, or both. In any case, communications interface 1210 may provide one or more interfaces for communications (e.g., packet-based communications, etc.) between computing device 1200 and one or more other computing devices or networks. By way of example and not limitation, communications interface 1210 may include a network interface controller (NIC) or network adapter for communicating with an Ethernet or other wired-based network, or a wireless NIC (WNIC) or wireless adapter for communicating with a wireless network such as WI-FI.

[0222] Additionally, communication interface 1210 can facilitate communication with various types of wired or wireless networks. Communication interface 1210 can also facilitate communication using various communication protocols. Communication infrastructure 1212 can also include hardware, software, or both that couple components of computing device 1200 to one another. For example, communication interface 1210 can use one or more networks and / or protocols to enable multiple computing devices connected by a particular infrastructure to communicate with each other to perform one or more aspects of the processes described herein. By way of example, a sequencing process can enable multiple devices (e.g., client device, sequencing device, and server device) to exchange information such as sequencing data and error notifications.

[0223] In the foregoing specification, the present disclosure has been described with reference to specific exemplary embodiments thereof. Various embodiments and aspects of the present disclosure will be described with reference to the details discussed herein, and the accompanying drawings illustrate various embodiments. The above description and drawings are illustrative of the present disclosure and should not be construed as limiting the disclosure. Numerous specific details are set forth to provide a thorough understanding of various embodiments of the present disclosure.

[0224] The present disclosure may be embodied in other specific forms without departing from its spirit or essential characteristics. The described embodiments are to be considered in all respects as illustrative only and not restrictive. For example, methods described herein may be implemented using fewer or more steps / actions, or the steps / actions may be performed in a different order. Additionally, steps / actions described herein may be repeated or performed in parallel with each other, or with different occurrences of the same or similar steps / actions. The scope of the present application is therefore indicated by the appended claims, rather than the foregoing description. All changes that come within the meaning and range of equivalency of the claims are intended to be embraced within their scope.

Claims

1. 1. A system comprising: at least one processor; a non-transitory computer-readable medium, the non-transitory computer-readable medium, when executed by the at least one processor, providing the system with: determining initial structural variant calls for one or more genomic coordinates of the genomic sample based on nucleotide reads corresponding to said genomic sample; determining sequencing metrics corresponding to one or more of the initial structural variant calls or the one or more genomic coordinates; utilizing a structural variant refinement machine learning model to generate a false positive likelihood, based on the sequencing metrics, that indicates the likelihood that the initial structural variant call is a false positive; and instructions for determining a revised structural variant call for the one or more genomic coordinates of the genomic sample based on the false positive likelihood.

2. 10. The system of claim 1, further comprising instructions that, when executed by the at least one processor, cause the system to determine the initial structural variant call by determining deletions of more than a threshold number of base pairs, insertions of more than the threshold number of base pairs, duplications of more than the threshold number of base pairs, inversions, translocations, or copy number variations (CNVs).

3. 10. The system of claim 1, further comprising instructions that, when executed by the at least one processor, cause the system to determine the initial structural variant call by determining structural variant calls for a number of base pairs within a threshold range of base pairs.

4. 10. The system of claim 1, further comprising instructions that, when executed by the at least one processor, cause the system to determine the sequencing metrics corresponding to the initial structural variant calls by determining one or more of: read-based sequencing metrics, reference-based sequencing metrics, or variant region quality sequencing metrics.

5. When executed by the at least one processor, the system performs the following steps on the initial structural variant call: one or more base call quality scores; the proportion of nucleotide reads that support alternative contiguous sequences from the reference genome; the number of split nucleotide reads from the nucleotide reads corresponding to the initial structural variant call; the coverage depth of the nucleotide read corresponding to the initial structural variant call; an additional structural variant call located within a threshold number of base pairs from the initial structural variant call within the genomic sample; an alignment of a contiguous sequence corresponding to the nucleotide reads with a reference sequence of a reference genome modified to include structural variants corresponding to the initial structural variant calls; a deletion length in nucleotide bases based on one or more soft-clipped nucleotide reads; the number of nucleotide reads exhibiting a mapping quality metric that does not meet a threshold mapping quality metric; an insert size, which represents the length of the nucleotide read fragment corresponding to the initial structural variant call; or a structural variant likelihood representing a ratio of the initial structural variant call to a reference call for the one or more genomic coordinates based on the insert size.

6. When executed by the at least one processor, the system: the number of nucleotide reads that include at least a threshold number of base calls and that correspond to the target genomic region for the initial structural variant call; or a number of nucleotide bases in an alternative contiguous sequence corresponding to the target genomic region from a reference genome where a base call for the nucleotide read does not meet a threshold base call quality score.

7. When executed by the at least one processor, the system provides for: the tandem repeat length in nucleotide bases, permutation entropy of nucleotide bases, a cytosine quadruplex (C-quadruplex), or 5. The system of claim 4, further comprising instructions to determine the reference-based sequencing metric by identifying one or more of: a guanine quadruplex (G-quadruplex);

8. When executed by the at least one processor, the system: generating the false positive likelihood by determining whether the initial structural variant call is a false positive call or a true positive call based on the sequencing metric; by changing the initial structural variant call from a positive structural variant call to a negative structural variant call based on the initial structural variant call being the false positive call; or 10. The system of claim 1, further comprising instructions for determining the revised structural variant call by changing the initial structural variant call from a negative structural variant call to a positive structural variant call based on the initial structural variant call being the true positive call.

9. When executed by the at least one processor, the system: determining, from a truth dataset, that a ground truth structural variant call corresponding to said corrected structural variant call has been incorrectly labeled as a false positive rather than a true positive based on one or more truth set nucleotide reads for said ground truth structural variant call that satisfy a structural variant criterion; changing the label of the ground truth structural variant call from false positive to true positive; 10. The system of claim 1, further comprising instructions for adjusting parameters of the structural variant refinement machine learning model based on a comparison of the revised structural variant call and the ground truth structural variant call.

10. When executed by the at least one processor, the system: analyzing a concise specific gap alignment report (CIGAR) string to identify truth set nucleotide reads of the truth dataset that meet a threshold mapping quality metric and that correspond to genomic coordinates that are adjacent to the one or more genomic coordinates and that include read ends that meet a threshold contiguous length; determining a portion of the CIGAR string that includes a start index of a corresponding structural variant call generated by a call generation model; 10. The system of claim 9, further comprising instructions for determining that the ground truth structural variant call is incorrectly labeled based on the structural variant criteria by determining that the starting index corresponds to a structural variant and matches a length of the corresponding structural variant call generated by the call generation model.

11. 1. A computer-implemented method comprising: determining an initial structural variant call for one or more genomic coordinates of the genomic sample based on nucleotide reads corresponding to the genomic sample; identifying sequencing metrics corresponding to one or more of the initial structural variant calls or the one or more genomic coordinates; utilizing a structural variant refinement machine learning model based on the sequencing metrics to generate a false positive likelihood indicating the likelihood that the initial structural variant call is a false positive; determining a revised structural variant call for the one or more genomic coordinates of the genomic sample based on the false positive likelihood.

12. determining the initial structural variant call comprises utilizing a call generation model to determine base calls corresponding to the one or more genomic coordinates of the genomic sample that exhibit structural variants relative to a reference genome; determining the revised structural variant call comprises correcting the initial structural variant call for the one or more genomic coordinates based on the false positive likelihood generated by the structural variant refinement machine learning model; The computer-implemented method of claim 11 , comprising:

13. 12. The computer-implemented method of claim 11, wherein determining the initial structural variant calls comprises determining deletions of more than a threshold number of base pairs, insertions of more than the threshold number of base pairs, duplications of more than the threshold number of base pairs, inversions, translocations, or copy number variations (CNVs).

14. 12. The computer-implemented method of claim 11, wherein determining the sequencing metrics corresponding to the initial structural variant calls comprises determining one or more of read-based sequencing metrics, reference-based sequencing metrics, or variant region quality sequencing metrics.

15. determining the sequencing metrics for the initial structural variant call; one or more base call quality scores; the proportion of nucleotide reads that support alternative contiguous sequences from the reference genome; the number of split nucleotide reads from the nucleotide reads corresponding to the initial structural variant call; the coverage depth of the nucleotide read corresponding to the initial structural variant call; an additional structural variant call located within a threshold number of base pairs from the initial structural variant call within the genomic sample; an alignment of a contiguous sequence corresponding to the nucleotide reads with a reference sequence of a reference genome modified to include structural variants corresponding to the initial structural variant calls; a deletion length in nucleotide bases based on one or more soft-clipped nucleotide reads; the number of nucleotide reads exhibiting a mapping quality metric that does not meet a threshold mapping quality metric; an insert size, which represents the length of the nucleotide read fragment corresponding to the initial structural variant call; or a structural variant likelihood representing a ratio of the initial structural variant call to a reference call for the one or more genomic coordinates based on the insert size.

16. determining the sequencing metric, the number of nucleotide reads that include at least a threshold number of base calls and that correspond to the target genomic region for the initial structural variant call; or the number of nucleotide bases in an alternative contiguous sequence corresponding to the target genomic region from a reference genome where a base call for the nucleotide read does not meet a threshold base call quality score.

17. determining the sequencing metrics within one or more genomic regions of a reference genome corresponding to the one or more genomic coordinates of the genomic sample; the tandem repeat length in nucleotide bases, permutation entropy of nucleotide bases, a cytosine quadruplex (C-quadruplex), or 12. The computer-implemented method of claim 11, comprising identifying one or more of: a guanine quadruplex (G-quadruplex);

18. A non-transitory computer-readable medium that, when executed by at least one processor, causes a computing device to: determining initial structural variant calls for one or more genomic coordinates of the genomic sample based on nucleotide reads corresponding to said genomic sample; determining sequencing metrics corresponding to one or more of the initial structural variant calls or the one or more genomic coordinates; utilizing a structural variant refinement machine learning model to generate a false positive likelihood, based on the sequencing metrics, that indicates the likelihood that the initial structural variant call is a false positive; A non-transitory computer-readable medium comprising instructions for determining a revised structural variant call for the one or more genomic coordinates of the genomic sample based on the false positive likelihood.

19. 20. The non-transitory computer-readable medium of claim 18, wherein the structural variant refinement machine learning model comprises one or more gradient boosting decision trees.

20. When executed by the at least one processor, the computing device: generating the false positive likelihood by determining whether the initial structural variant call is a false positive call or a true positive call based on the sequencing metric; by changing the initial structural variant call from a positive structural variant call to a negative structural variant call based on the initial structural variant call being the false positive call; or 20. The non-transitory computer-readable medium of claim 18, further comprising instructions for determining the revised structural variant call by changing the initial structural variant call from a negative structural variant call to a positive structural variant call based on the initial structural variant call being the true positive call.

21. When executed by the at least one processor, the computing device: determining, from a truth dataset, that a ground truth structural variant call corresponding to said corrected structural variant call has been incorrectly labeled as a false positive rather than a true positive based on one or more truth set nucleotide reads for said ground truth structural variant call that satisfy a structural variant criterion; changing the label of the ground truth structural variant call from false positive to true positive; 20. The non-transitory computer-readable medium of claim 18, further comprising instructions for adjusting parameters of the structural variant refinement machine learning model based on a comparison of the revised structural variant call and the ground truth structural variant call.

22. When executed by the at least one processor, the computing device: analyzing a concise specific gap alignment report (CIGAR) string to identify truth-set nucleotide reads of said truth dataset that satisfy a threshold mapping quality metric; determining a portion of the CIGAR string that includes a start index of a corresponding structural variant call generated by a call generation model; 22. The non-transitory computer-readable medium of claim 21 , further comprising instructions for determining that the ground truth structural variant call is incorrectly labeled based on the structural variant criteria by determining that the starting index corresponds to a structural variant and matches a length of the corresponding structural variant call generated by the call generation model.

23. 20. The non-transitory computer-readable medium of claim 18, further comprising instructions that, when executed by the at least one processor, cause the computing device to utilize the structural variant refinement machine learning model to generate the false positive likelihood based on the sequencing metrics and the initial structural variant call as input.

Images