Systems and methods for identifying minor somatic variations
By combining assembly diagram generation, pruning, and machine learning models, a variant identification algorithm has been developed to address the challenges of existing tools in processing nanopore sequencing data. This approach enables more efficient variant identification and recognition, thereby improving the accuracy of sequencing data analysis.
Patent Information
- Application Number
- CN202580028620.2
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Priority Date
- 2024-04-17
- Filing Date
- 2025-04-17
- Publication Date
- 2026-11-17
Smart Images

Figure CN123125652A_ABST
Abstract
Description
[0001] Cross-references to related applications
[0002] This application claims the benefit of U.S. Provisional Patent Application No. 63 / 635,568, filed April 17, 2024, which is incorporated herein by reference in its entirety. Background Technology
[0003] The development of affordable and rapid DNA sequencing technologies has enabled targeted therapies that rely on the use of DNA biomarkers to identify patients suitable for targeted treatment. For example, mutations in certain genes, such as those involved in cell proliferation, are known to cause certain types of cancer that can be treated very effectively with specific types of drugs. Other mutations are known to cause resistance to certain therapies. Therefore, improved systems and methods are needed to identify variants from sequencing data. Summary of the Invention
[0004] The embodiments described herein relate to systems and methods for variant identification in sequencing data. More specifically, the embodiments described herein relate to identifying single nucleotide variants, insertions, and deletions in sequencing data.
[0005] According to a first aspect of this disclosure, a method for identifying somatic cell variations is provided. The method includes: receiving a computer file comprising a plurality of congruent reads generated from a patient sample; aligning the plurality of congruent reads; determining identifiable regions from the aligned congruent reads; determining active regions from the identifiable regions based on a comparison of the identifiable regions with a reference sequence, and identifying one or more differences in the active regions compared to the reference sequence; generating an assembly map from the reference sequence and the active regions, wherein the assembly map includes a plurality of paths, wherein each path includes a plurality of path segments, and wherein each path segment includes a count of congruent reads supporting that path segment; determining a plurality of haplotype sequences from the plurality of paths of the assembly map; determining a likelihood score for each haplotype sequence based on the count of congruent reads supporting the path segments included in each haplotype sequence; determining a plurality of candidate variants by comparing a weighted count for each variant with a first threshold dynamically determined from the patient sample, wherein the weighted count is the number of congruent reads with candidate variants; filtering candidate variants with a weighted count greater than the first threshold using a machine learning classification model, the machine learning classification model generating a probability score for each candidate variant; and determining a plurality of filtered variants by comparing the probability score for each candidate variant with a second threshold.
[0006] In some embodiments, the identifiable areas are based on minimum coverage requirements.
[0007] In some embodiments, the assembly graph is pruned to remove at least one of a plurality of paths. In other embodiments, the assembly graph is not pruned.
[0008] In some embodiments, the first threshold is determined dynamically by fitting a sample-specific regression model to a background distribution of weighted counts for candidate variants.
[0009] In some embodiments, the machine learning classification model includes one or more features selected from the group consisting of: non-double strand count, double strand count, weighted count, distance from candidate variant to the 5' end of the consistent read, substitution type for single nucleotide variant, sequence context, strand bias, alignment quality, base quality, cluster size, and double strand percentage.
[0010] In some embodiments, the machine learning classification model includes the gradient boosting decision tree algorithm.
[0011] In some embodiments, the gradient boosting decision tree algorithm is selected from the group consisting of LightGBM and XGBoost.
[0012] According to a second aspect of this disclosure, a system for generating sequencing data is provided. The system may include a measurement device and / or a logic system. The logic system may include a processor coupled to a memory storing instructions executable by the processor. When executing these instructions, the processor is configured to perform the method described according to one or more embodiments of the first aspect.
[0013] In some embodiments of the second aspect, the system further includes a treatment device for determining treatment for a patient and / or administering treatment to a patient based on at least one of a plurality of filtered variants.
[0014] In some embodiments of the third aspect, the system further includes a reporting device for displaying information related to at least one of a plurality of filtered variants.
[0015] According to a third aspect of this disclosure, a non-transitory computer-readable medium is provided. The computer-readable medium stores a set of instructions that, when executed by at least one processor, cause the processor to perform the methods described according to one or more embodiments of the first aspect. Attached Figure Description
[0016] The features of the invention are set forth in the following claims. A better understanding of the features and advantages of the invention will be achieved by referring to the following detailed description of illustrative embodiments (in which the principles of the invention are utilized) and the accompanying drawings.
[0017] Figure 1 is a flowchart of a method for a mutation identification procedure workflow according to some embodiments.
[0018] Figure 2 is a diagram illustrating how, according to some embodiments, a threshold is set by fitting a sample-specific regression model to the background distribution of weighted variant counts for all locations within the sample that have evidence of alternative alleles (i.e., candidate variant sites).
[0019] Figure 3 illustrates the relationship between false positives and sensitivity of the variant identification procedure according to some embodiments.
[0020] Figure 4 illustrates a flowchart of a three-stage filtering process according to some embodiments, which can be used to improve the sensitivity and / or accuracy of variant identification procedures.
[0021] Figure 5 illustrates a sequencing system according to some embodiments.
[0022] Figure 6 illustrates an exemplary computer device according to some embodiments. Detailed Implementation
[0023] This disclosure provides a variety of techniques for variant identification as part of a secondary analysis workflow for sequencing data generated by today's next-generation sequencing devices. More specifically, a variant identification algorithm is provided for identifying single nucleotide variants (SNVs) and / or insertions / deletions (InDels) from sequencing data, such as nanopore-based sequencing data.
[0024] In at least one aspect of the secondary analysis workflow, a variant identification algorithm is provided that generates an assembly graph using reference sequences (e.g., multiple reads generated by sequencing a sample) targeting one or more active regions of sequencing data. The weight of each edge of the graph is then calculated based on the sequencing data. Candidate variants are then identified by traversing the graph. These candidate variants are then filtered according to a two-stage process. In the first stage, candidate variants are removed based on a comparison of their weights with a threshold. In the second stage, a machine learning model is used to score these candidate variants that passed the first stage based on multiple features. The scores are then compared with a threshold to determine a final list of identified variants targeting active regions.
[0025] In another aspect of the secondary analysis workflow, an InDel identification algorithm is provided. This InDel identification algorithm may include a hotspot module and an adaptive module. In the hotspot module, the InDel identification algorithm uses multiple heuristics to identify InDel variants in hotspot regions. Simultaneously, the adaptive module uses a two-stage approach to identify variants with low AF (Average Fission) in plasma samples that may not be strongly supported. In the first stage, a core linear regression model is used to filter out multiple variants based on a comparison of the score of each candidate variant with a threshold. In the second stage, a machine learning classifier (such as a gradient booster (GBM) model) is used to score each variant that passed the first stage, and then the classifier score is compared with a threshold to determine the final list of identified variants. Optionally, these identified variants can be further filtered using an intercept list filter.
[0026] In another aspect of the secondary analysis workflow, a SNV identification algorithm is provided, which is similar in many respects to the InDel identification algorithm described above. This SNV identification algorithm may include a hotspot module and an adaptive module. The hotspot module is similar to the hotspot module of the InDel identification algorithm, except that it may include one or more additional heuristics in addition to or instead of the heuristics used in the InDel identification algorithm. The adaptive module of this SNV identification algorithm also uses a two-stage approach to identify variants. In the first stage, based on a comparison of the score of each candidate variant with a threshold, a core linear regression model is used to filter out multiple variants. In the second stage, based on a comparison of the score of each candidate variant with a threshold, an extended linear model containing multiple additional weighted features is used to filter out variants that passed through the first stage.
[0027] These secondary analysis workflows can be used to analyze sequencing data from a variety of next-generation sequencing devices, including nanopore-based sequencing systems. Accurately identifying variants from raw sequencing data is a crucial step in bioinformatics processes used for patient diagnosis and / or the creation of therapies for specific diseases.
[0028] sequencing
[0029] As part of a procedure for determining sequencing reads from multiple microsatellite loci, sequencing assays can be used to sequence prepared target nucleic acid molecules (e.g., sequencing libraries). Any of a variety of sequencing technologies or sequencing analyses can be used. As used herein, the term “next-generation sequencing (NGS)” refers to a sequencing method that allows for massively parallel sequencing of clonal amplified molecules and individual nucleic acid molecules (or nucleic acid analogs).
[0030] Non-limiting examples of sequencing assays suitable for use with the methods disclosed herein include nanopore sequencing (see, for example, U.S. Patent Application Publication Nos. 2013 / 0244340, 2013 / 0264207, 2014 / 0134616, 2015 / 0119259, and 2015 / 0337366), Sanger sequencing, capillary array sequencing, thermal cycling sequencing (see, for example, Sears et al., Biotechniques, 13:626-633 (1992)), solid-phase sequencing (see, for example, Zimmerman et al., Methods Mol. Cell Biol., 3:39-42 (1992)), sequencing using mass spectrometry (such as matrix-assisted laser desorption / ionization time-of-flight mass spectrometry (MALDI-TOF / MS)) (see, for example, Fu et al., Nature Biotech., 16:381-384 (1998)), and sequencing by hybridization (see, for example, Drmanac et al., Nature). Biotech., 16:54-58(1998)), and NGS methods, including but not limited to sequencing by synthesis (see, for example, HiSeq™, MiSeq™ or Genome Analyzer, available from Inmena (San Diego, CA), sequencing by ligation (see, for example, SOLiD™, available from Thermo Fisher Scientific (Waltham, MA), sequencing by ion semiconductors (see, for example, IonTorrent™, available from Thermo Fisher Scientific (Waltham, MA), and sequencing by SMRT® (available from Pacific Biosciences of California, Inc. (Menlo Park, CA)).
[0031] Commercially available sequencing technologies include: hybridization sequencing platforms from Affymetrix, Inc. (Sunnyvale, CA); synthesis sequencing platforms from Inmena (San Diego, Calif.); and ligation sequencing platforms from Thermo Fisher Scientific (Waltham, MA). Other sequencing technologies include, but are not limited to, Thermo Fisher Scientific (Waltham, MA)'s Ion Torrent technology, and nanopore sequencing from Roche Sequencing Solutions, Inc. (Santa Clara, CA) and / or Oxford Nanopore Technologies, plc (Oxford, UK).
[0032] Bioinformatics Workflow Overview
[0033] The output of an NGS sequencer is typically processed by a bioinformatics workflow. This workflow processes the raw signal from the NGS sequencer and converts it into base identification (often referred to as raw reads). These raw reads are typically stored in a FASTQ file, which combines these raw reads with relevant quality data. This part of the bioinformatics workflow is usually referred to as primary analysis.
[0034] The next part of this bioinformatics workflow is called secondary analysis, which takes the original reads generated by the primary analysis and performs several tasks, including alignment and variant identification.
[0035] The tertiary analysis is the final part of this bioinformatics process and uses variant identification information to generate medical insights that healthcare practitioners can use to improve treatment for their patients.
[0036] Secondary analysis
[0037] Sequencing data generated by new sequencing technologies, such as nanopore-based sequencers, exhibits characteristics distinct from those generated by currently market-leading sequencers, such as Imina sequencers. These differences may include variations in raw read accuracy and error distribution. Because Imina sequencers currently dominate the market, the vast majority of secondary analysis software tools developed are specifically tailored to handle the type of data generated by Imina sequencers. These tools typically handle Imina sequencer data well but may not be well-suited for data generated by next-generation sequencing technologies, such as nanopore sequencers. Therefore, there is a need to develop new secondary analysis tools that can work well with emerging sequencing technologies currently under development. Furthermore, while the variant identification methods described herein may be particularly effective for nanopore sequencing data, they can also be used with other types of sequencing data, such as those from Imina sequencers.
[0038] Figure 1 illustrates a secondary analysis workflow for a variant identification algorithm according to some embodiments. This variant identification algorithm utilizes some of the methods used by Mutect2 (a haplotype variant identification program with somatic cell-specific genotyping and filtering, available as part of the Genome Analysis Toolkit (GATK) maintained by the Broad Institute), with several modifications or additions to the algorithm.
[0039] The variant identification algorithm first receives congruent reads 100 from, for example, a nanopore sequencer or another type of sequencer. A typical format for receiving these reads is a file using the FASTQ format. These congruent reads stored in the file can be accessed and processed by the process to align them with a reference sequence. Identifiable regions 104 can then be identified as regions with sufficient read coverage depth to allow variant identification. For example, identifiable regions 104 may have a minimum read coverage depth of at least 5, 10, 15, 20, 25, 30, 35, 40, 45, or 50. In some embodiments, the desired coverage depth can vary depending on various factors, such as the type of bases in the region (i.e., GC-rich regions or other types of motifs that may have a higher error rate during sequencing) and the quality fraction of bases in the region.
[0040] Next, within the identifiable region 104, the bases of these reads are used to identify mismatches or gaps between the reads and the reference sequence to identify active regions 108 containing potential SNVs (single nucleotide variants) and / or InDels (insertions and deletions) 106.
[0041] For each active region 108, for example, by generating an assembled graph 110 such as a Debruijn graph starting from a reference sequence, the reference sequence is decomposed into a series of kmer (of length 108). A short sequence of kmers (kmers of k bases), where each consecutive kmer overlaps with the previous kmer. Each kmer consists of 1 base. These kmers can be represented as nodes, which are connected by lines called edges. These edges can be weighted to track the number of kmers found in the sample, where the weights are initially set to zero. This forms a reference graph.
[0042] Next, each sequence read can be similarly decomposed into a series of kmer nodes, which can be matched against the reference graph. Whenever two consecutive kmer nodes match the graph, the weight of the edge connecting the two kmer nodes is increased by one. If a kmer node cannot match the graph, a new node and edge are added. This process is repeated for all kmer nodes in the sequence read. In this method, these weights indicate the number of times a particular kmer node is found in the sequence read. Additionally, these weights can be used to determine the most probable path through the graph.
[0043] In some embodiments, the assembled graph can then be optionally pruned by removing segments of the graph supported by edge weights less than a threshold (such as 2). For example, a weight of 2 means that two reads in the sample support a segment of the graph. Increasing the threshold can result in more aggressive pruning, which leads to faster processing and higher specificity, but lower sensitivity. Decreasing the threshold means less pruning, which reduces specificity but increases sensitivity. In some embodiments, the threshold can be set to zero, meaning no pruning of the graph is performed to obtain maximum sensitivity.
[0044] After assembling and optionally pruning the graph, haplotype sequences can be generated from the graph by traversing all paths, where a likelihood score is calculated for each haplotype sequence as the product of the transition probabilities of the edges along those paths. The probability of an edge can be calculated as the weight of that edge divided by the sum of the weights of all edges sharing the same source node. The haplotype with the highest likelihood score can be used for candidate variant detection.
[0045] These haplotypes are then aligned with a reference sequence to identify candidate variants. For example, this alignment can be performed using Smith-Waltman alignment (SWA), and the alignment can be stored in a SAM or BAM file. Candidate variants can be determined by comparing the aligned sequence with the reference sequence, and these candidate variants can be stored in a .vcf file.
[0046] For example, the above steps can be performed using optimized settings for the open-source variant identification program GATK. Optimized settings include: initial tumor LOD-5, tumor LOD-5 to be emitted, pruned LOD threshold of 9, maximum number of reads to start per alignment of 0, active probability threshold of 0.00005, and minimum pruning of 0. These parameters have been modified from their default values to more sensitively detect candidate variants from realignments at 0.1% AF. These optimal parameters can be identified by maximizing sensitivity through a grid search.
[0047] A two-stage process can be used to filter these candidate variants, designed to reduce false positives and improve accuracy. As shown in Figure 1, in the first stage 114, a weighted count of variant molecules is compared to a threshold dynamically learned from the sample. This threshold is calculated by fitting a sample-specific regression model to the background distribution of weighted variant counts for all locations within the sample that have evidence of alternative alleles (i.e., candidate variant sites). In some embodiments, a smoothed spline may optionally be used instead of the regression model to fit a more general curve. All variants with weighted counts above the sample threshold are retained for the second stage. The sample-specific regression is illustrated in Figure 2. The vertical line in Figure 2, which shows the threshold, can be set to achieve a specific desired or predetermined value for the cumulative count against the y-axis, such as 1 / 100, 1 / 200, 1 / 300, 1 / 400, 1 / 500, 1 / 600, 1 / 700, 1 / 800, 1 / 900, or 1 / 1000 of the cumulative count per base pair on the chart. This can be learned from the training dataset, where these cumulative counts can be matched or set based on the known number of mutations, depending on the desired sensitivity and accuracy distribution.
[0048] In the second stage, as shown in Figure 1, a machine learning classification model 116 (e.g., LightGBM or XGBoost) is used to further filter variants and generate the final identification. This model uses the count of molecules supporting the variant, along with additional features such as the following, to generate a probability score for each variant: distance of the variant relative to the 5' end of the fragment, substitution type (for SNVs), sequence context, cluster size, strand bias, single-strand / double-strand support, ref / alt, base quality score (e.g., the base quality score used in GATK), MAPQ score, and strand information. Sequence context refers to the bases upstream and downstream of the variant location. Therefore, if the variant occurs at position 1000 on chromosome 1, the sequence context is the combination of bases at positions 999 and 1001. Strand bias is a measure of the imbalance in the distribution of positive and negative strands in the data. If the number of positive and negative strands is equal, the strand bias is 0. A higher strand bias value indicates that either the positive or negative strand is significantly greater than the other. The maximum possible chain preference value is 0.25. Table 1 below lists all features extracted from the consistent reads, which can be used by the machine learning classifier model 116. In some embodiments, the classifier may use any combination of the features listed herein. For example, the classifier may use all features in some embodiments, or a subset of those features in other embodiments.
[0049] Table 1
[0050]
[0051] All variants from the machine learning classifier model 116 whose classifier probability scores are higher than the classifier threshold represent the final identifications passed through this two-stage filtering. Figure 3 illustrates the trade-off between sensitivity and false positives from the filtering step for different values of the classifier threshold.
[0052] For example, a machine learning classification threshold can be determined based on a training set containing positive samples with known somatic variants and negative / healthy samples expected to be free of somatic variants. This threshold is set or selected to maximize the F1 score for classifying variants in the training data. The F1 score is a typical metric used to evaluate the performance of machine learning classifier models.
[0053] In some embodiments, as shown in Figure 4, an optional third filtering step may be performed to remove systematic noise that may be introduced during sequencing, such as errors introduced during sample preparation.
[0054] Starting with candidate variants 400 and the assembled BAM 401 (corresponding to step 114 in Figure 1) as the output of the variant identification procedure, the first filtering stage 402 passes candidate variants with weighted counts greater than a sample-specific threshold, as described above with respect to step 114 in Figure 1. If a candidate variant is below the threshold, it is filtered out as background noise 404.
[0055] If a candidate variant has a weighted count greater than the threshold of the first stage 402, the candidate variant is passed to the second stage 406 (as described above with respect to step 116 in Figure 1) for machine learning classifier filtering step 406. If the variant has an ML score less than the ML threshold, the variant is filtered out 408 for one or more reasons, such as having low quality, low MAPQ, low base quality, chain bias, low depth, etc. If the variant has an ML score greater than the ML threshold, the variant is passed to an optional third stage 410 intercept list filter.
[0056] You can start by creating an intercept list filter from normal samples using a VCF file from a variant identification program such as GATK / mutect2. Any variant that appears in multiple normal samples (which are not expected to have any variants) and has a count greater than or equal to 3 can be added to the intercept list.
[0057] If the variant passed to stage 3 410 is on the intercept list, it is filtered out as systematic noise 412. If the variant passed to stage 3 410 is not on the intercept list, it is passed as an identified variant 414.
[0058] In some embodiments, the third stage 410 may include an additional recovery step for variants on the intercept list. If the variant passed to the third stage 410 is on the intercept list and has a high allele frequency (AF) compared to the AF in the healthy sample... Score (i.e., above the threshold) If the score is not obtained, the variant is recovered and passed as the identified variant 414. This is used to calculate... The formula is:
[0059]
[0060] in This represents the average allele frequency in healthy samples, and This represents the standard deviation of allele frequencies in healthy samples. Training data can be used to determine this. Threshold to recover known variants on the intercept list.
[0061] Exemplary System
[0062] Figure 5 illustrates a sequencing system 500 according to an embodiment of the present disclosure. The illustrated system includes a sample 505, such as an Xpandomer within a assay device 510, wherein the sample 505 can be assayed 508. For example, the sample 505 can be contacted with reagents of assay 508 to provide a signal (e.g., an intensity signal) of a physical characteristic 515 (e.g., sequence information of a cell-free nucleic acid molecule). Assay 508 may include sequencing by amplification using an assay device 510 (such as a nanopore sequencing device as discussed above). A detector 520 detects the physical characteristic 515 from the sample (e.g., fluorescence intensity, voltage, or current). The detector 520 may perform measurements at intervals (e.g., periodic intervals) to obtain data points constituting a data signal. In one embodiment, an analog-to-digital converter converts the analog signal from the detector into digital form multiple times.
[0063] The assay device 510 and detector 520 may form an assay system, such as a sequencing system 500 performing sequencing according to the embodiments described herein. Data signal 525 is transmitted from detector 520 to logic system 530. As an example, data signal 525 may be used to determine the sequence of nucleic acid molecules (e.g., DNA and / or RNA) and / or their location in a reference genome. Data signal 525 may include various measurements performed simultaneously, such as different colored fluorescent dyes or different electrical signals of different molecules of sample 505, and therefore data signal 525 may correspond to multiple signals. Data signal 525 may be stored in local memory 535, external memory 540, or storage device 545. Sequencing system 500 may consist of multiple assay devices 510 and detectors 520.
[0064] Logic system 530 may be or may include a computer system, ASIC, processor, graphics processing unit (GPU), etc. The system may also include or be coupled to a display (e.g., monitor, LED display, etc.) and user input devices (e.g., mouse, keyboard, buttons, etc.). Logic system 530 and other components may be part of a stand-alone or network-connected computer system, or they may be directly attached to or incorporated into a device including detector 520 and / or assay device 510 (e.g., a sequencing device). Logic system 530 may also include software executing in processor 550. Logic system 530 may include a computer-readable medium storing instructions for controlling sequencing system 500 to perform any of the methods described herein. For example, logic system 530 may provide commands to a system including assay device 510 to cause sequencing or other physical operations to be performed. Such physical operations may be performed in a specific order, e.g., reagents are added and removed in a specific order. Such physical operations can be performed by robotic systems (e.g., including robotic arms), such as robotic systems that can be used to obtain samples and perform determination 508. The logic system 530 can also perform any steps of the computer processing methods described herein, such as, but not limited to, base identification, alignment, variant identification, and the variant identification procedure algorithm shown in Figure 1.
[0065] The sequencing system 500 may also include a treatment device 560 for providing treatment to a subject. The treatment device 560 may determine a treatment and / or be used to administer a treatment. Examples of such treatments may include surgery, radiation therapy, chemotherapy, immunotherapy, targeted therapy, hormone therapy, and stem cell transplantation. A logic system 530 may be connected to the treatment device 560, for example, to provide results of the methods described herein. The treatment device may receive input from other devices, such as imaging devices, and user input (e.g., to control the treatment, such as control of a robotic system).
[0066] The sequencing system 500 may also include a reporting device 555 that can present the results of any of the methods described herein, such as results determined using the sequencing system 500. The reporting device 555 can communicate with a reporting module within the logic system 530, which can compile, format, and send reports to the reporting device 555. The reporting module can present information determined using any of the methods described herein. This information can be presented by the reporting device 555 in any format that can be recognized and interpreted by a user of the sequencing system 500. For example, the information can be presented by the reporting device 555 in a displayed, printed, or transmitted format, or any combination thereof.
[0067] Any computer system mentioned herein can utilize any suitable number of subsystems. An example of such a subsystem in computer system 600 is shown in Figure 6. In some embodiments, computer system 600 includes a single computer device, wherein the subsystem may be a component of that computer device. In other embodiments, computer system 600 may include multiple computer devices, each of which is a subsystem with internal components. The computer system may include desktop and laptop computers, tablet computers, mobile phones, and other mobile devices.
[0068] The subsystems shown in Figure 6 are interconnected via system bus 675. Additional subsystems are shown, such as printer 674, keyboard 678, storage devices 679, 682, monitor 676 (e.g., a display screen, such as an LED, coupled to display adapter 682), etc. Peripheral devices and input / output (I / O) devices coupled to I / O controller 671 can be connected via any number of components known in the art, such as input / output (I / O) ports 677 (e.g., USB, FireWire). ®The system 600 is connected to a computer system. For example, I / O port 677 or external interface 681 (e.g., Ethernet, Wi-Fi, etc.) can be used to connect computer system 600 to a wide area network, such as the Internet, a mouse input device, or a scanner. Interconnection via system bus 675 allows central processing unit 673 to communicate with each subsystem and control the execution of multiple instructions from system memory 672 or storage device 679 (e.g., a fixed disk, such as a hard disk drive, or optical disk), as well as the exchange of information between subsystems. System memory 672 and / or storage device 679 may be embodied in a computer-readable medium. Another subsystem is a data collection device 685, such as a camera, microphone, accelerometer, etc. Any data mentioned herein can be output from one component to another and can be output to the user.
[0069] A computer system may include multiple identical components or subsystems, for example, connected together via an external interface 681, an internal interface, or a removable storage device that can be connected to or moved from one component to another. In some embodiments, the computer system, subsystem, or device may communicate via a network. In this case, one computer may be considered a client and another computer may be considered a server, with each computer being considered part of the same computer system. The client and server may each include multiple systems, subsystems, or components. In various embodiments, the method may involve a variety of numbers of clients and / or servers, including at least 10, 20, 50, 100, 200, 500, 1,000, or 10,000 devices. The method may include a variety of numbers of communication messages between devices, including at least 100, 200, 500, 1,000, 10,000, 50,000, 100,000, 500,000, or one million communication messages. Such communications may involve at least 1 MB, 10 MB, 100 MB, 1 GB, 10 GB, or 100 GB of data.
[0070] Various aspects of the embodiments may be implemented in the form of control logic that uses hardware circuitry (e.g., application-specific integrated circuits or field-programmable gate arrays) and / or uses computer software stored in a modular or integrated manner in memory having a generally programmable processor. Therefore, the processor may include memory storing software instructions for configuring the hardware circuitry, and an FPGA or ASIC having configuration instructions. As used herein, the processor may include a single-core processor, a multi-core processor on the same integrated chip, or multiple processing units on a single circuit board or networked, as well as dedicated hardware. Based on the disclosure and teachings provided herein, those skilled in the art will recognize and understand other ways and / or methods of implementing embodiments of this disclosure using hardware and combinations of hardware and software.
[0071] Any suitable computer language, such as Java, C, C++, C#, Objective-C, Swift, or scripting languages such as Perl or Python, using, for example, conventional or object-oriented techniques, can be used to implement any software component or function described in this application as software code to be executed by a processor. The software code can be stored as a series of instructions or commands on a computer-readable medium for storage and / or transmission. Suitable non-transitory computer-readable media may include random access memory (RAM), read-only memory (ROM), magnetic media such as hard disk drives or floppy disks, or optical media such as optical discs (CDs) or DVDs (Digital Universal Optical Discs) or Blu-ray discs, flash memory, etc. The computer-readable medium can be any combination of such devices. Furthermore, the order of operations can be rearranged. A process may terminate upon completion of its operations, but may have additional steps not included in the figures. A process may correspond to a method, function, program, subroutine, subroutines, etc. When a process corresponds to a function, the termination of the process may correspond to the function returning to an identification function or the main function.
[0072] Such programs can also be encoded and transmitted using carrier signals adapted for transmission over wired, optical, and / or wireless networks conforming to various protocols, including the Internet. Thus, computer-readable media can be created using data signals encoded with such programs. Computer-readable media encoded with program code can be packaged with compatible devices (e.g., as firmware) or provided separately from other devices (e.g., for download via the Internet). Any such computer-readable media can reside on or within a single computer product (e.g., a hard drive, CD, or an entire computer system) and can exist on or within different computer products within a system or network. A computer system may include a monitor, printer, or other suitable display for providing the user with any of the results mentioned herein.
[0073] Any method described herein can be performed wholly or partially using a computer system comprising one or more processors, which can be configured to perform the steps. Any operation performed using a processor can be performed in real time. The term "real time" can refer to a computational operation or process completed within a certain time constraint. As an example, the time constraint can be 30 seconds, 1 minute, 10 minutes, 30 minutes, 1 hour, 4 hours, 1 day, or 7 days. Therefore, embodiments may be directed to a computer system configured to perform the steps of any method described herein, possibly with different components performing the respective steps or groups of respective steps. Although the steps are presented as numbered, the steps of the methods described herein may be performed simultaneously or at different times or in different orders. Furthermore, some steps may be used in conjunction with some steps from other methods. Additionally, all or some steps may be optional. Furthermore, any step of any method can be performed using modules, units, circuits, or other means for a system to perform those steps.
[0074] The specific details of a particular embodiment may be combined in any suitable manner without departing from the spirit and scope of the embodiments of this disclosure. However, other embodiments of this disclosure may be directed to specific embodiments related to each individual aspect, or specific combinations of these individual aspects.
[0075] For purposes of illustration and description, the above description of exemplary embodiments of the present disclosure has been presented. It is not intended to be exhaustive or to limit the disclosure to the precise forms described, and many modifications and variations are possible in accordance with the above teachings.
[0076] When a feature or element is referred to herein as being “on” another feature or element, it may be directly on the other feature or element, or there may be intermediate features and / or elements present. Conversely, when a feature or element is referred to as being “directly on” another feature or element, there are no intermediate features or elements present. It will also be understood that when a feature or element is referred to as being “connected,” “attached,” or “coupled” to another feature or element, the feature or element may be directly connected, attached, or coupled to the other feature or element, or there may be intermediate features or elements present. Conversely, when a feature or element is referred to as being “directly connected,” “directly attached,” or “directly coupled” to another feature or element, there are no intermediate features or elements present. Although described or illustrated with respect to one embodiment, the features and elements thus described or illustrated are applicable to other embodiments. Those skilled in the art will also recognize that a structure or feature referred to as being “adjacent” to another feature may have portions overlapping with or beneath the adjacent feature.
[0077] The terminology used herein is for the purpose of describing particular embodiments only and is not intended to limit the invention. For example, as used herein, the singular forms “a,” “an,” and “the” are also intended to include the plural forms unless the context clearly indicates otherwise. It will also be understood that when the terms “comprising” and / or “including” are used in this specification, they specify the presence of the defined features, steps, operations, elements, and / or components, but do not exclude the presence or addition of one or more other features, steps, operations, elements, components, and / or groups thereof. As used herein, the term “and / or” includes any and all combinations of one or more of the associated listed items and may be abbreviated to “ / ”.
[0078] For ease of description, spatially relative terms such as “below,” “below,” “lower than,” “above,” “over,” etc., are used herein to describe the relationship of one element or feature to another, as illustrated in the accompanying drawings. It should be understood that, in addition to the orientations depicted in the drawings, spatially relative terms are also intended to cover different orientations of the device in use or operation. For example, if the device in the drawings is inverted, an element described as “below” or “under” other elements or features would then be oriented “above” other elements or features. Thus, the exemplary term “below” can encompass both the orientations of “above” and “below.” The device may be oriented in other ways (rotated 90 degrees or otherwise), and the spatially relative descriptive terms used herein shall be interpreted accordingly. Similarly, unless otherwise specifically indicated, terms such as “up,” “down,” “vertical,” “horizontal,” etc., are used herein for illustrative purposes only.
[0079] Although the terms “first” and “second” may be used herein to describe various features / elements (including steps), these features / elements should not be limited by these terms unless the context otherwise indicates. These terms can be used to distinguish one feature / element from another. Therefore, without departing from the teachings of the invention, the first feature / element discussed below may be referred to as the second feature / element, and similarly, the second feature / element discussed below may be referred to as the first feature / element.
[0080] Throughout this specification and the following claims, unless the context otherwise requires, the word “comprising” and variations such as “including” and “containing” mean that various components may be used together in methods and articles (e.g., compositions and devices that include means and methods). For example, the term “comprising” will be understood to imply the inclusion of any of the specified elements or steps, but does not exclude any other elements or steps.
[0081] As used herein in the specification and claims, including as in the examples, and unless otherwise expressly specified, all figures may be interpreted as if preceded by the word "about" or "approximately," even if the term is not explicitly stated. When describing magnitude and / or location, the phrase "about" or "approximately" may be used to indicate that the described value and / or location is within a reasonably expected range of value and / or location. For example, numerical values may have values of + / - 0.1% of a specified value (or range of values), + / - 1% of a specified value (or range of values), + / - 2% of a specified value (or range of values), + / - 5% of a specified value (or range of values), + / - 10% of a specified value (or range of values), etc. Unless the context otherwise indicates, any numerical value given herein should also be understood to include about or approximately that value. For example, if the value "10" is disclosed, "about 10" is also disclosed. Any numerical range described herein is intended to include all subranges contained therein. It should also be understood that, as those skilled in the art would appropriately understand, when a value is disclosed, the terms "less than or equal to" that value, "greater than or equal to" that value, and possible ranges between values are also disclosed. For example, if the value "X" is disclosed, "less than or equal to X" and "greater than or equal to X" are also disclosed (e.g., in the case where X is a numerical value). It should also be understood that throughout this application, data is provided in a variety of different formats, and the data represents a range of endpoints and start points, as well as any combination of data points. For example, if specific data point "10" and specific data point "15" are disclosed, it should be understood that values greater than, greater than or equal to, less than, less than or equal to, equal to 10 and 15, and values between 10 and 15 are considered disclosed. It should also be understood that each unit between two specific units is also disclosed. For example, if 10 and 15 are disclosed, 11, 12, 13, and 14 are also disclosed.
[0082] Although various illustrative embodiments have been described above, any of a variety of changes may be made to the various embodiments without departing from the scope of the invention as described in the claims. For example, in alternative embodiments, the order in which the various method steps described are performed may often be changed, while in other alternative embodiments, one or more method steps may be skipped entirely. Optional features of the various apparatus and system embodiments may be included in some embodiments but not in others. Therefore, the foregoing description is provided primarily for illustrative purposes and should not be construed as limiting the scope of the invention as set forth in the claims.
[0083] The examples and illustrations included herein are shown in an illustrative and not limiting manner, specific embodiments in which the subject matter may be practiced. As mentioned, other embodiments may be utilized and derived therefrom, allowing for structural and logical substitutions and changes without departing from the scope of this disclosure. Such embodiments of the subject matter of the invention may be referred to herein individually or collectively by the term "invention," merely for convenience and not intended to actively limit the scope of this application to any single invention or inventive concept, given that more than one invention or inventive concept has actually been disclosed. Therefore, although specific embodiments have been shown and described herein, any arrangement calculated to achieve the same purpose may replace the specific embodiments shown. This disclosure is intended to cover any and all adaptations or variations of the various embodiments. Combinations of the above embodiments, as well as other embodiments not specifically described herein, will be apparent to those skilled in the art upon review of the foregoing description.
Claims
1. A method for identifying somatic cell variations, the method comprising: Receive a computer file that includes multiple consistent reads generated from a patient sample; Compare the multiple consistent read segments; Identifiable regions are determined from the consistent reading segments compared; Active regions are determined from the identifiable regions based on a comparison with a reference sequence, and one or more differences in the active regions compared with the reference sequence are identified. An assembly graph is generated from the reference sequence and the active region, wherein the assembly graph includes multiple paths, each path includes multiple path segments, and each path segment includes a count of consistent read segments supporting the path segment; Multiple haplotype sequences are determined from multiple paths in the assembly diagram; The likelihood score for each haplotype sequence is determined based on the count of consistent reads that support the path segments included in each haplotype sequence. Multiple candidate variants are identified by comparing a weighted count for each variant with a first threshold dynamically determined from the patient sample, wherein the weighted count is the number of consistent reads with the candidate variants; The machine learning classification model is used to filter candidate variants whose weighted count is greater than the first threshold, and the machine learning classification model generates a probability score for each candidate variant. as well as Multiple filtered variants are identified by comparing the probability score for each candidate variant with a second threshold.
2. The method of claim 1, wherein the identifiable area is based on a minimum coverage requirement.
3. The method of claim 1, wherein the assembly graph is pruned to remove at least one of the plurality of paths.
4. The method of claim 1, wherein the first threshold is determined dynamically by fitting a sample-specific regression model to a background distribution of weighted counts for candidate variants.
5. The method of claim 1, wherein the machine learning classification model comprises one or more features selected from the group consisting of: non-double strand count, double strand count, weighted count, distance of candidate variant to the 5' end of the consistent read, substitution type for single nucleotide variant, sequence context, strand bias, alignment quality, base quality, cluster size, and double strand percentage.
6. The method according to claim 1, wherein the machine learning classification model includes the gradient boosting decision tree algorithm.
7. The method of claim 6, wherein the gradient boosting decision tree algorithm is selected from the group consisting of LightGBM and XGBoost.
8. A system comprising: Measuring device; as well as A logic system comprising at least a processor and a memory storing a set of instructions, wherein the processor, when executing the instructions, is configured to perform the method according to any one of claims 1 to 7.
9. The system of claim 8, further comprising a treatment device for determining treatment for or administering treatment to a patient based on at least one of a plurality of filtered variants.
10. The system of claim 8, further comprising a reporting device for displaying information about at least one of a plurality of filtered variants.
11. A non-transitory computer-readable medium storing instructions that, when executed by at least one processor, cause the at least one processor to perform the method according to any one of claims 1 to 7.
Citation Information
Patent Citations
Nanopore Based Molecular Detection and Sequencing
US20130244340A1
DNA sequencing by synthesis using modified nucleotides and nanopore detection
US20130264207A1
Nucleic acid sequencing using tags
US20140134616A1
Nucleic acid sequencing by nanopore detection of tag molecules
US20150119259A1
Methods for creating bilayers for use with nanopore sensors
US20150337366A1
