Copy number variant call and recovery

By combining the data of structural variants and copy number variants, the CNV breakpoint position and length are updated, and the problem of low accuracy of short CNV detection in the prior art is solved, and the recognition accuracy and confidence of copy number changes are improved.

CN118946933APending Publication Date: 2024-11-12ILLUMINA INC
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202480001936.8
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Priority Date
2023-01-31
Filing Date
2024-01-24
Publication Date
2024-11-12

AI Technical Summary

Technical Problem

The prior art has challenges in detecting and accurately calling short copy number variants (CNVs), especially because low accuracy results in CNV events in the range of less than 10 kbp and lack of sufficient accuracy in structural variant (SV) calls. To support accurate CNV identification.

Method used

By combining the data of structural variant (SV) and copy number variant (CNV), the information of SV is used to update the breakpoint position and length of CNV, thereby improving the call accuracy and confidence of CNV and achieving better short CNV Accurate identification.

Benefits of technology

Improves recall and accuracy of short CNVs, enhances accuracy and confidence in the location of copy number variations, avoids CNV events filtered out due to low confidence, and provides higher accuracy and reliability.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118946933A_ABST
    Figure CN118946933A_ABST
Patent Text Reader

Abstract

The present invention provides an improved copy number variant (CNV) call and potential recovery in a genomic sequence, the improved copy number variant call and potential recovery in a genomic sequence comprising: (i) obtaining gene sequence variant data comprising a record indicative of structural variants (SV) in the genomic sequence and a record indicative of CNV; (ii) determining a CNV call of an SV notification as an updated version of the initial CNV based on the initial CNV indicated in the gene sequence variant data and the initial SV indicated in the gene sequence variant data, where the determination uses information from the initial SV to determine a start breakpoint position and an end breakpoint position of the CNV call of the SV notification, at least one of the start breakpoint position and the end breakpoint position is updated compared to a corresponding start breakpoint position and / or end breakpoint position of the initial CNV, notified by the initial SV; and (ii) writing the CNV call of the determined SV notification as a record into the gene sequence variant data file.
Need to check novelty before this filing date? Find Prior Art

Description

Background Art

[0001] In the field of nucleic acid sequencing, structural variants (SVs) are relatively large genomic variations found in the genomic deoxyribonucleic acid (DNA) of an individual. Variants are determined relative to a reference sequence. Copy number variants / variations (CNVs) - a subset of SVs - are structural variations in base pairs (bp) of genetic material, in which large portions of the genome are duplicated or deleted. Variations in DNA copy number are well-described causes of human genetic diseases. CNV detection technology has evolved from karyotyping or microarray-based clinical diagnostic tests on the order of kilobases to megabases in length to next-generation sequencing (NGS), which provides advances in sequencing technology, including technology for more accurate CNV calling. Summary of the invention

[0002] By providing a computer-implemented method for improved calling of copy number variants in a genomic sequence, the shortcomings of the prior art are overcome and additional advantages are provided. The method includes obtaining gene sequence variant data, the gene sequence variant data including a record indicating at least one structural variant (SV) in the genomic sequence and a record indicating at least one copy number variant (CNV). The method is also based on the initial CNV indicated in the gene sequence variant data and at least one initial SV indicated in the gene sequence variant data, and the CNV call notified by the SV is determined as an updated version of the initial CNV, wherein the determination uses information from the at least one initial SV to determine the starting breakpoint position and the ending breakpoint position of the CNV call notified by the SV, and at least one of the starting breakpoint position and the ending breakpoint position is updated compared to the corresponding starting breakpoint position and / or ending breakpoint position of the initial CNV, and is notified by the at least one initial SV. The method further writes the CNV call notified by the determined SV as one or more records in the gene sequence variant data file.

[0003] Further, a computer system is provided, the computer system comprising a memory and a processor communicating with the memory, wherein the computer system is configured to perform a method for improved calling of copy number variants in a genomic sequence. The method includes obtaining gene sequence variant data, the gene sequence variant data including a record indicating at least one structural variant (SV) in the genomic sequence and a record indicating at least one copy number variant (CNV). The method is also based on the initial CNV indicated in the gene sequence variant data and at least one initial SV indicated in the gene sequence variant data, and the CNV call notified by the SV is determined as an updated version of the initial CNV, wherein the determination uses information from the at least one initial SV to determine the starting breakpoint position and the ending breakpoint position of the CNV call notified by the SV, and compared with the corresponding starting breakpoint position and / or ending breakpoint position of the initial CNV, at least one of the starting breakpoint position and the ending breakpoint position is updated, and is notified by the at least one initial SV. The method further writes the CNV call notified by the determined SV as one or more records in the gene sequence variant data file.

[0004] Further, a computer program product is provided, the computer-readable storage medium can be read by a processing circuit and store instructions, the instructions are executed by the processing circuit to perform a method for improved calling of copy number variants in a genomic sequence. The method includes obtaining gene sequence variant data, the gene sequence variant data including a record indicating at least one structural variant (SV) in the genomic sequence and a record indicating at least one copy number variant (CNV). The method is also based on the initial CNV indicated in the gene sequence variant data and at least one initial SV indicated in the gene sequence variant data, and the CNV call notified by the SV is determined as an updated version of the initial CNV, wherein the determination uses information from the at least one initial SV to determine the starting breakpoint position and the ending breakpoint position of the CNV call notified by the SV, and at least one of the starting breakpoint position and the ending breakpoint position is updated compared to the corresponding starting breakpoint position and / or ending breakpoint position of the initial CNV, and is notified by the at least one initial SV. The method further writes the CNV call notified by the determined SV as one or more records in the gene sequence variant data file.

[0005] In one or more embodiments, the initial CNV is provided by a CNV calling component of a genome analysis software. In one or more embodiments, the genome analysis software has a filtering component configured to filter out CNVs having a confidence level less than a threshold confidence level, the CNV calling component provides a confidence level for the initial CNV less than the threshold confidence level, and the CNV call of the SV notification is provided with a confidence level greater than the threshold confidence level, such that the filtering component does not filter out the CNV call of the SV notification.

[0006] In one or more embodiments, the breakpoint resolution of the breakpoint of the initial CNV is equal to a window size of n base pairs, where 2000>n>200, such that the position of the breakpoint of the initial CNV is an approximate position identified based on a window of length n, wherein the breakpoint of the initial CNV is determined to be within the window. In one or more embodiments, the breakpoint resolution of the CNV call of the SV notification is 1 base pair.

[0007] In one or more embodiments, the determining the CNV call of the SV notification as an updated version of the initial CNV includes modifying the record of the initial CNV to generate the record of the CNV call of the SV notification. The modification may change the start and / or end breakpoint positions of the initial CNV as indicated in the record of the initial CNV to the updated breakpoint positions determined by the at least one initial SV notification, and may further update the length of the CNV indicated in the record of the initial CNV and the quality score in the record of the initial CNV to provide the record of the CNV call of the SV notification.

[0008] In one or more embodiments, the record of the initial CNV is a copy of the original record of the initial CNV, wherein the gene sequence variant data file is part of one or more gene sequence variant data files, and wherein the original record of the initial CNV is retained and output in at least one of the one or more gene sequence variant data files.

[0009] In one or more embodiments, determining the SV-informed CNV calls includes, for each of the at least one initial SV, performing a pairwise comparison of the initial CNV with the initial SV.

[0010] In one or more embodiments, the pairwise comparison of the initial CNV to the initial SV includes one or more breakpoint comparisons that each compare the corresponding first breakpoint position to the corresponding second breakpoint position of the initial CNV to provide a proposed modified CNV by evaluating one or more pass / fail rules based on the corresponding first breakpoint position of the initial CNV proposed to be modified to the corresponding second breakpoint position of the initial SV.

[0011] In one or more embodiments, the one or more breakpoint comparisons include at least one of: comparing the starting breakpoint position of the initial CNV with at least one of the starting breakpoint position or the ending breakpoint position of the initial SV; or comparing the ending breakpoint position of the initial CNV with at least one of the starting breakpoint position or the ending breakpoint position of the initial SV.

[0012] In one or more embodiments, the one or more rules include at least one of: a rule requiring that at least some positions between the initial SV and the proposed modified CNV overlap; a compatibility rule for the orientations of the initial SV and the proposed modified CNV; a rule that the associated breakpoints of the initial SV and the proposed modified CNV are within a threshold distance; or a uniqueness rule requiring that the breakpoints of the initial CNV proposed for modification match at most one SV breakpoint of the at least one initial SV.

[0013] In one or more embodiments, the length of the CNV call of the SV notification is less than or equal to 20,000 base pairs. In one or more embodiments, the length of the CNV call of the SV notification is less than or equal to 10,000 base pairs. In one or more embodiments, the length of the CNV call of the SV notification is less than the length of the initial CNV. In one or more embodiments, the length of the initial CNV is less than or equal to 20,000 base pairs.

[0014] Additional features and advantages are achieved through the concepts described herein. BRIEF DESCRIPTION OF THE DRAWINGS

[0015] The various aspects described herein are particularly pointed out and clearly claimed as examples in the claims at the end of this specification. The foregoing and other objects, features and advantages of the present disclosure will become apparent from the following detailed description taken in conjunction with the accompanying drawings, in which:

[0016] Figure 1 Exemplary structural variant types are depicted;

[0017] Figure 2 Exemplary copy number variant duplication and deletion events are depicted;

[0018] Figure 3 An exemplary copy number variant calling workflow is depicted;

[0019] Figure 4 An exemplary structural variant calling workflow is depicted;

[0020] Figure 5-Figure 6 Depicted are exemplary accuracies of copy number variant and structural variant deletion calls against benchmark datasets;

[0021] Figure 7 depicts exemplary accuracy in copy number variant deletion calling of structural variant-informed copy number variant calling according to various aspects described herein;

[0022] Figure 8 depicts a comparison graph of structural variants, copy number variants, and structural variant-informed copy number variant calls according to various aspects described herein;

[0023] Fig. 9 A conceptual representation of unaligned breakpoints depicting structural variant calls and copy number variant calls corresponding to the same event;

[0024] Fig.10 An exemplary interface is presented that illustrates a comparison between structural variant-informed copy number variant calls according to aspects described herein and associated copy number variant-only and structural variant-only calls from conventional copy number variant and structural variant calling processing;

[0025] Fig.11 Another exemplary interface is presented that illustrates a comparison between structural variant informed copy number variant calls according to aspects described herein and associated copy number variant only and structural variant only calls from conventional copy number variant and structural variant calling processing;

[0026] Fig.12 presents an additional exemplary interface showing a comparison between structural variant informed copy number variant calls according to aspects described herein and associated copy number variant only and structural variant only calls from conventional copy number variant and structural variant calling processing;

[0027] Fig.13 An exemplary conceptual diagram depicting CNV and SV calls along a segment of the genome;

[0028] Fig.14 A conceptual diagram depicting a process for copy number variant calling and output for structural variant notification according to various aspects described herein;

[0029] Fig.15 depicts depth and breakend distributions for exemplary scenarios of SV-informed CNV calling according to various aspects described herein;

[0030] Fig.16 According to the various aspects described herein, Fig.15 An illustrative possible reconstruction of the events depicted in;

[0031] Fig.17depicts another depth and break-end distribution for an exemplary scenario of SV-informed CNV calling according to various aspects described herein;

[0032] Figures 18A-18C Depicts additional exemplary scenarios for SV-informed CNV calls in accordance with various aspects described herein;

[0033] Figure 19A-19B Depicted are exemplary processes for improved calling of copy number variants in genomic sequences according to various aspects described herein; and

[0034] Fig. 20 Examples of computer systems and associated devices that may incorporate and / or use the aspects described herein are depicted. DETAILED DESCRIPTION

[0035] There are challenges and shortcomings in the detection and accurate calling of 'short' CNVs. Although 'short' is not a fixed number in this article, it is usually at most about 20 kilobase pairs (kbp). For this reason, many conventional methods filter out short CNV events that are less than some configurable numbers, usually in the range of 10kbp to 20kbp due to low accuracy. Although NGS provides some improvements in short CNV detection, better CNV calls are needed, and specifically short CNVs. For the purpose of explanation and description herein, 'short' CNVs are CNVs with a length of <10kbp.

[0036] Therefore, methods for improved CNV calls are described herein, which use SV call data to inform CNV calls to modify. This may lead to potential recovery of CNVs, which would otherwise be filtered out of reports. Improved CNV calls as described herein provide valuable copy number information that cannot otherwise be obtained from SV callers. Unlike CNV callers, SV callers do not usually include copy number assignments, but this information may be critical for genome analysis, and therefore CNVs, such as including accurate identification and calling of short CNVs are useful. Further provides increased precision and confidence in specific locations of copy number changes. SV calls historically lack the accuracy required for some clinical applications alone. Conventional CNV calls partially address this limitation, but as noted, have been limited by the low confidence level of short CNV calls. Aspects described herein provide integration of SV call data and CNV call data to enable CNV callers to provide more accurate CNV calls with higher confidence.

[0037] Unless otherwise defined, the technical and scientific terms used herein have the same meaning as those generally understood by those of ordinary skill in the art to which the present disclosure belongs. See, for example, Singleton et al., Dictionary of Microbiology and Molecular Biology, 2nd edition, J. Wiley & Sons (New York, NY 1994); Sambrook et al., Molecular Cloning, A Laboratory Manual, Cold Spring Harbor Press (Cold Spring Harbor, NY 1989). For the purposes of this disclosure, the following terms are defined as follows.

[0038] As used herein, "nucleotide" includes a nitrogenous heterocyclic base, a sugar, and one or more phosphate groups. Nucleotides are monomeric units of nucleic acid sequences. Examples of nucleotides include, for example, ribonucleotides or deoxyribonucleotides. In ribonucleotides (RNA), the sugar is ribose, and in deoxyribonucleotides (DNA), the sugar is deoxyribose, i.e., a sugar lacking a hydroxyl group present at the 2' position in the ribose. The nitrogenous heterocyclic base can be a purine base or a pyrimidine base. Purine bases include adenine (A) and guanine (G) and their modified derivatives or analogs. Pyrimidine bases include cytosine (C), thymine (T) and uracil (U) and their modified derivatives or analogs. The C-1 atom of deoxyribose is bonded to the N-1 of pyrimidine or the N-9 of purine. The phosphate group can be in the form of monophosphate, diphosphate or triphosphate. These nucleotides can be natural nucleotides, but it should be further understood that non-natural nucleotides, modified nucleotides or analogs of the aforementioned nucleotides can also be used.

[0039] As used herein, "nucleobase" is a heterocyclic base, such as adenine, guanine, cytosine, thymine, uracil, inosine, xanthine, hypoxanthine, or a heterocyclic derivative, analog or tautomer thereof. Nucleobases may be naturally occurring or synthetic. Non-limiting examples of nucleobases are adenine, guanine, thymine, cytosine, uracil, xanthine, hypoxanthine, 8-azapurine, purine substituted by methyl or bromine at the 8 position, 9-oxo-N6-methyladenine, 2-aminoadenine, 7-deazaxanthine, 7-deazaguanine, 7-deaza-adenine, N4-ethanolylcytosine, 2,6-diaminopurine, N6-ethanolyl-2,6-diaminopurine, 5-methylcytosine , 5-(C3-C6)-alkynylcytosine, 5-fluorouracil, 5-bromouracil, thiouracil, pseudoisocytosine, 2-hydroxy-5-methyl-4-triazolopyridine, isocytosine, isoguanine, inosine, 7,8-dimethylalloxazine, 6-dihydrothymine, 5,6-dihydrouracil, 4-methyl-indole, ethanoladenine, and U.S. Patent Nos. 5,432,272 and 6,150,510, and PCT Application No. WO 92 / 002258, WO 93 / 10820, WO 94 / 22892 and WO 94 / 24144, and non-naturally occurring nucleobases described in Fasman (Practical Handbook of Biochemistry and Molecular Biology, pp. 385-394, 1989, CRC Press, Boca Raton, LO), all of which are incorporated herein by reference in their entirety.

[0040] The term "nucleic acid" or "polynucleotide" refers to a deoxyribonucleotide or ribonucleotide polymer in single-stranded or double-stranded form, and unless otherwise limited, encompasses known analogs of natural nucleotides that hybridize to nucleic acids in a manner similar to naturally occurring nucleotides, such as peptide nucleic acids (PNA) and thiophosphate DNA. Unless otherwise specified, a specific nucleic acid sequence includes its complementary sequence. Nucleotides include, but are not limited to, ATP, dATP, CTP, dCTP, GTP, dGTP, UTP, TTP, dUTP, 5-methyl-CTP, 5-methyl-dCTP, ITP, dITP, 2-amino-adenosine-TP, 2-amino-deoxyadenosine-TP, 2-thiothymidine triphosphate, pyrrolopyrimidine triphosphate and 2-thiocytidine, as well as α-thiotriphosphates of all of the above substances, and 2'-O-methyl-ribonucleotide triphosphates of all of the above bases. Modified bases include, but are not limited to, 5-Br-UTP, 5-Br-dUTP, 5-F-UTP, 5-F-dUTP, 5-propynyl dCTP, and 5-propynyl-dUTP.

[0041] As used herein, the term "primer" refers to an isolated oligonucleotide that can serve as a starting point for synthesis when placed under conditions that induce the synthesis of extension products (e.g., conditions that include nucleotides, an inducing agent (such as a DNA polymerase) and a suitable temperature and pH). Primers are preferably single-stranded, which is the most efficient in amplification, but can also be double-stranded. If double-stranded, the primer is first treated to separate its strands before being used to prepare extension products. Preferably, the primer is an oligodeoxyribonucleotide. The primer must be long enough to initiate the synthesis of extension products in the presence of an inducing agent. The exact length of the primer will depend on many factors, including temperature, primer source, the purpose of the method, and parameters for primer design.

[0042] As used herein, the term "chromosome" refers to the hereditary gene carrier of a living cell, which is derived from a chromatin chain containing DNA and protein components (especially histones). The conventional internationally recognized individual human genome chromosome numbering system is used herein.

[0043] "Genome" refers to the complete genetic information of an organism or virus expressed as nucleic acid sequences.

[0044] As used herein, the term "reference genome" or "reference sequence" refers to any specific known genomic sequence, whether partial or complete, of any organism or virus that can be used to reference an identification sequence from a subject. For example, reference genomes for human subjects, as well as many other organisms, can be found at the National Center for Biotechnology Information at ncbi.nlm.nih.gov. In various embodiments, the reference sequence is significantly larger than the reads to which it is compared. For example, the reference sequence can be at least about 100 times larger, or at least about 1000 times larger, or at least about 10,000 times larger, or at least about 10,000 times larger than the compared reads. 5 times larger, or at least about 10 6 times larger, or at least about 10 7 times larger. In one example, the reference sequence is the sequence of the full-length genome. Such sequences may be referred to as genome reference sequences. For example, the reference sequence may be a reference human genome sequence, such as hg19 or hg38. In another example, the reference sequence is limited to a specific human chromosome, such as chromosome 13. In some embodiments, the reference chromosome is a Y chromosome sequence from human genome version hg19. Such sequences may be referred to as chromosome reference sequences. Other examples of reference sequences include genomes of other species, and chromosomes, subchromosome regions (such as chains) of any species, etc. In various embodiments, the reference sequence is a consensus sequence or other combination derived from multiple individuals. However, in certain applications, the reference sequence may be taken from a specific individual.

[0045] The term "nucleic acid sample" herein refers to a sample generally derived from a biological fluid, a cell, a tissue, an organ or an organism, and the sample comprises a nucleic acid or a nucleic acid mixture, and the nucleic acid or nucleic acid mixture comprises at least one nucleic acid sequence of a copy number variation to be screened. In certain embodiments, the nucleic acid sample comprises at least one nucleic acid sequence in which the copy number is suspected to have varied. Such samples may include but are not limited to sputum / oral fluid, amniotic fluid, blood, blood fractions or fine needle biopsy samples (e.g., surgical biopsy, fine needle biopsy, etc.), urine, peritoneal fluid, pleural fluid, etc. Although the sample is usually taken from a human subject (e.g., a patient), the sample may be from any mammal, including but not limited to dogs, cats, horses, goats, sheep, cattle, pigs, etc. The sample may be used directly after being obtained from a biological source or after pretreatment to change the characteristics of the sample. For example, such pretreatment may include preparing plasma from blood, diluting viscous fluids, etc. The method of pretreatment may also include but is not limited to filtering, precipitation, dilution, distillation, mixing, centrifugation, freezing, freeze-drying, concentration, amplification, nucleic acid fragmentation, interfering component inactivation, adding reagents, cracking, etc. If such pretreatment methods are used for a sample, such pretreatment methods generally result in the retention of the nucleic acid of interest in the test sample, sometimes at a concentration proportional to that in an untreated test sample (e.g., a sample that has not been subjected to any such pretreatment methods). For purposes of the methods described herein, such "treated" or "treated" samples are still considered biological "test" samples.

[0046] The term "subject" herein refers to human subjects as well as non-human subjects such as mammals, invertebrates, vertebrates, fungi, yeasts, bacteria, and viruses. Although the examples herein relate to humans and the language is primarily directed to humans, the concepts disclosed herein are applicable to genomes from any plant or animal and can be used in veterinary medicine, animal science, research laboratories, and other fields.

[0047] The term "condition" or "medical condition" is used herein as a broad term that includes all diseases and disorders and may also include injuries and normal health conditions that may affect a person's health, benefit from medical assistance or be amenable to medical treatment, such as pregnancy.

[0048] As used herein, the term "cluster" or "clump" refers to a group of molecules, such as a group of DNA or a group of signals. In some embodiments, the signal of the cluster is derived from different features. In some embodiments, the signal cluster represents a physical area covered by an amplified oligonucleotide. Each signal cluster can be ideally observed as several signals. Therefore, repeated signals can be detected from the same signal cluster. In some embodiments, a signal cluster or a signal cluster may include one or more signals or spots corresponding to a specific feature. When a cluster is used in conjunction with a microarray device or other molecular analysis equipment, it may include one or more of the following signals: these signals together occupy the physical area occupied by the amplified oligonucleotide (or other polynucleotides or polypeptides with the same or similar sequence). For example, when the feature is an amplified oligonucleotide, the cluster may be a physical area covered by an amplified oligonucleotide. In other embodiments, a signal cluster or a signal cluster does not need to strictly correspond to a feature. For example, a stray noise signal may be included in a signal cluster, but not necessarily in a feature region. For example, a signal cluster from four sequencing reaction cycles may include at least four signals.

[0049] The term "next generation sequencing (NGS)" herein refers to a sequencing method that allows for massively parallel sequencing of clonally amplified molecules and single nucleic acid molecules. Non-limiting examples of NGS include sequencing by ligation and sequencing by synthesis using reversible dye terminators.

[0050] The term "read" or "sequence read" (or sequencing read) refers to a sequence obtained from a portion of a nucleic acid sample. A read can be represented by a nucleotide string sequenced from any portion or all of a nucleic acid molecule. Typically, although not necessarily, a read represents a short sequence of adjacent base pairs in a sample. A read can be symbolically represented by a base pair sequence (in A, T, C, or G) of a sample portion. The read can be stored in a memory device and processed as appropriate to determine whether the read matches a reference sequence or meets other criteria. The read can be obtained directly from a sequencing device or indirectly from stored sequence information about a sample. In some cases, a read is a DNA sequence of sufficient length (e.g., at least about 25 bp) that can be used to identify a larger sequence or region, for example, it can be aligned and specifically assigned to a chromosome or genomic region or gene. For example, a sequence read can be a short nucleotide string (e.g., 20-150 bases) sequenced from a nucleic acid fragment, a short nucleotide string at one end or both ends of a nucleic acid fragment, or sequencing of an entire nucleic acid fragment present in a biological sample. Sequence reads can be obtained in a variety of ways, such as using sequencing techniques or using probes (e.g., in hybridization arrays or capture probes), or amplification techniques such as polymerase chain reaction (PCR) or linear amplification or isothermal amplification using a single primer. Sequence reads can be generated by techniques such as sequencing by synthesis, sequencing by binding, or sequencing by ligation. Sequence reads can be generated using instruments such as the MINISEQ, MISEQ, NEXTSEQ, HISEQ, and NOVASEQ sequencing instruments from Illumina, Inc. (San Diego, California).

[0051] As used herein, the term "sequencing depth" generally refers to the number of times a locus is covered by sequence reads aligned to the locus. A locus may be as small as one nucleotide, or as large as a chromosome arm, or as large as an entire genome. Sequencing depth may be expressed as 50×, 100×, etc., where "×" refers to the number of times a locus is covered by sequence reads. Sequencing depth may also be applied to multiple loci or whole genomes, in which case x may refer to the average number of times a locus or haploid genome or whole genome is sequenced, respectively. When citing an average depth, the actual depths of the different loci included in the data set span a range of values. Ultra-deep sequencing may refer to a sequencing depth of at least 100×.

[0052] The term "coverage" refers to the abundance of sequence tags mapped to a defined sequence. Coverage can be quantitatively indicated by sequence tag density (or count of sequence tags), sequence tag density ratio, normalized coverage amount, adjusted coverage value, etc. In some cases, the "effective read coverage" of a chromosome is defined as the actual amount of bases covered by the read. Sequencing depth (which refers to the expected coverage of the read to nucleotides) is calculated based on the assumption that reads are uniformly synthesized in chromosomes. In fact, the read coverage across genomes is not uniform. Although, for example, 10x coverage means that nucleotides are covered 10 times on average, in some parts of the genome, nucleotides are covered much more or much less. A factor affecting coverage is the ability of the read alignment tool to align the read with the genome. If a part of the genome is more complex, such as with many repeats, the alignment tool may be difficult to align the read with the district, thereby producing low coverage.

[0053] As used herein, the term "aligned, alignment or aligning" refers to comparing a read or tag to a reference sequence to determine the possibility that the reference sequence includes the read sequence. If the reference sequence contains the read, the read can be mapped to the reference sequence, or in some embodiments, to a specific position in the reference sequence. For example, the alignment of the read with the reference sequence of human chromosome 13 will inform the possibility that the read exists in the reference sequence of chromosome 13. In some cases, the alignment further indicates the position to which the read or tag is mapped in the reference sequence. For example, if the reference sequence is a human whole genome sequence, the alignment may indicate that the read is present on chromosome 13, and may also indicate that the read is present on a specific chain and / or site of chromosome 13. A "site" can be a unique position on a polynucleotide sequence or a reference genome (i.e., chromosome ID, chromosome position and orientation). In some embodiments, the site can provide the position of a residue, sequence tag or segment on a sequence.

[0054] The reads or tags of the alignment are one or more sequences that are identified as matching known sequences from a reference genome in terms of their nucleic acid molecule order. The alignment can be performed manually, although it is usually implemented by a computer algorithm because it is not possible to align the reads within a reasonable time period for implementing the methods disclosed herein. The matching of sequence reads in the alignment can be 100% sequence matching or less than 100% (non-complete matching).

[0055] The alignment can be performed by modifications and / or combinations of methods such as Burrows-Wheeler Aligner (BWA), iSAAC, BarraCUDA, BFAST, BLASTN, BLAT, Bowtie, CASHX, Cloudburst, CUDA-EC, CUSHAW, CUSHAW2, CUSHAW2-GPU, DRAGEN, drFAST, ELAND, ERNE, GNUMAP, GEM, GensearchNGS, GMAP and GSNAP, Geneious Assembler, LAST, MAQ, mrFAST and mrsFAST, MOM, MOSAIK, MPscan, Novoalign and NovoalignCS, NextGENe, Omixon, PALMapper, Partek, PASS, PerM, PRIMEX, QPalma, RazerS, REAL, cREAL, RMAP, rNA, RT Investigator, Segemehl, SeqMap, Shrec, SHRiMP, SLIDER, SOAP, SOAP2, SOAP3 and SOAP3-dp, SOCS, SSAHA and SSAHA2, Stampy, SToRM, Subread and Subjunc, Taipan, UGENE, VelociMapper, XpressAlign and ZOOM.

[0056] As used herein, the term "mapping" refers to the specific assignment of sequence reads to a larger sequence, such as a reference genome, by alignment.

[0057] "Genetic variation" or "genetic change" refers to a specific genotype present in certain individuals, and generally genetic variation is present in a statistically significant subgroup of individuals. The presence or absence of genetic variance can be determined using the methods or devices described herein. In certain embodiments, the presence or absence of one or more genetic variations is determined according to the results provided by the methods and devices described herein. In some embodiments, genetic variation is a chromosomal abnormality (e.g., aneuploidy), a partial chromosomal abnormality, or mosaicism, each of which is described in more detail herein. Non-limiting examples of genetic variation include one or more deletions (e.g., microdeletions), repetitions (e.g., microrepetitions), insertions, mutations, polymorphisms (e.g., single nucleotide polymorphisms), fusions, repetitive sequences (e.g., short tandem repeats), differential methylation sites, differential methylation forms, etc., and combinations thereof. Insertions, repetitive sequences, deletions, repetitions, mutations, or polymorphisms can be of any length, and in some embodiments, the length is from about 1 base or base pair to about 250 megabases (Mb). In some embodiments, the insertion, repetitive sequence, deletion, duplication, mutation, or polymorphism is about 1 base or base pair to about 1,000 kilobases (kb) in length (e.g., about 10 bp, 50 bp, 100 bp, 500 bp, 1 kb, 5 kb, 10 kb, 50 kb, 100 kb, 500 kb, or 1000 kb in length).

[0058] Genetic variation is sometimes a deletion. In certain embodiments, a deletion is a mutation (e.g., a genetic aberration) in which a portion of a chromosome or a DNA sequence is lost. Deletion is generally a loss of genetic material. Any number of nucleotides may be deleted. Deletion may include deletion of one or more whole chromosomes, chromosome fragments, alleles, genes, introns, exons, any noncoding region, any coding region, their fragments or their combinations. Deletion may include microdeletion. Deletion may include deletion of a single base.

[0059] Genetic variation is gene duplication sometimes.In certain embodiments, repetition is the mutation (for example, genetic aberration) that part of chromosome or DNA sequence is copied and inserted back into genome.In certain embodiments, gene duplication (that is, repetition) is any repetition of DNA region.In some embodiments, repetition is the nucleic acid sequence repeated (usually in series) in genome or chromosome.In some embodiments, repetition may include the following copies: one or more full chromosomes, chromosome fragments, alleles, genes, introns, exons, any non-coding region, any coding region, their fragments or their combinations.Repetition may include micro-repetition.Repetition sometimes includes one or more copies of replicated nucleic acid.Repetition is sometimes characterized as a gene region repeated once or multiple times (for example, repeated 1, 2, 3, 4, 5, 6, 7, 8, 9 or 10 times).In some cases, the scope of repetition can be a small region (several thousand base pairs) to a full chromosome.Repetition is often caused by the error of homologous recombination or by retrotransposon events.Repetition is associated with certain types of proliferative diseases.Repetition can be characterized using genomic microarray or comparative genomic hybridization (CGH).

[0060] Genetic variation is sometimes insertion. Insertion is sometimes adding one or more nucleotide base pairs to a nucleic acid sequence. Insertion is sometimes micro-insertion. In certain embodiments, insertion includes adding a chromosome fragment to a genome, a chromosome, or a fragment thereof. In certain embodiments, insertion includes adding an allele, a gene, an intron, an exon, any non-coding region, any coding region, a fragment thereof, or a combination thereof to a genome or a fragment thereof. In certain embodiments, insertion includes adding (i.e., inserting) a nucleic acid of unknown origin to a genome, a chromosome, or a fragment thereof. In certain embodiments, insertion includes adding (i.e., inserting) a single base.

[0061] Genetic variation sometimes includes copy number variation (CNV), that is, the copy number variation of the nucleic acid sequence present in the experimental sample compared with the copy number of the nucleic acid sequence present in the reference sample. In certain embodiments, the nucleic acid sequence is 1kb or larger. In some cases, the nucleic acid sequence is a full chromosome or a significant part thereof." copy number variant" can refer to the nucleic acid sequence found to have a copy number difference by comparing the expected level of the nucleic acid sequence concerned with the nucleic acid sequence concerned in the experimental sample. For example, the level of the nucleic acid sequence concerned in the test sample is compared with the nucleic acid sequence level present in the qualified sample. Copy number variant / variation can include deletion (including microdeletion), insertion (including microinsertion), repetition, multiplication and translocation. CNV covers chromosome aneuploidy and partial aneuploidy.

[0062] As used herein, the term "short CNV" refers to a CNV that is less than ten thousand base pairs, ie, <10 kbp in length.

[0063] As used herein, the term "array" may refer to a sequence of a given size in a genome.

[0064] As used herein, the term "copy number" refers to the number of times a repeat unit is repeated (e.g., 0, 1, 1.5, 2, 3.5, 5, etc.) A change in copy number can be expressed as a difference in copy number relative to a reference (e.g., -1, 0, +1, +2, etc.).

[0065] As used herein, the term "fragment size" refers to the length of the original nucleic acid sequence used to generate paired-end reads, calculated based on the positions to which these reads are mapped.

[0066] As used herein, the term "indel" refers to a small insertion or deletion in a nucleic acid sequence that is less than 50 base pairs in length.

[0067] As used herein, the term "paired-end reads" or "paired end reads" refers to paired reads generated from sequencing the forward and reverse ends of a larger nucleic acid fragment. In some examples, the forward and reverse ends of the larger nucleic acid fragment can share the same name. Paired end reads can be generated by paired end sequencing in which one read is obtained from each end of the nucleic acid fragment.

[0068] As used herein, the term "pattern" refers to the sequence of repeating units of a tandem repeat sequence.

[0069] As used herein, the term "mate" or "mate of a read" refers to the read pair in question; that is, another read generated from the same nucleic acid fragment.

[0070] As used herein, the term "repeat sequence unit" refers to a single copy sequence that is repeated multiple times.

[0071] As used herein, the term "single nucleotide variant" or "SNV" refers to a single base substitution in a nucleic acid sequence.

[0072] As used herein, the term "small variant event" refers to a collection of adjacent SNVs or indels that occur within a maximum distance from each other (eg, a maximum distance of 10 base pairs) in the same haplotype array.

[0073] As used herein, the term "structural variation" or "SV" refers to a nucleic acid variant of greater than 50 base pairs corresponding to, for example, a duplication, deletion, insertion, inversion, or translocation.

[0074] Figure 1Depicted are exemplary structural variant types. The events labeled 102A to 102H depict the following SV types: deletion, new insertion, inversion, tandem duplication, interspersed duplication, inversion duplication, translocation, and unbalanced translocation, respectively. The stippled sequence in each example 102A-102G is a sequence of a deletion, insertion, duplication, translocation, or inversion. In examples 102A to 102G, a comparison between a reference sequence (above) and a sample sequence (below the reference sequence) is shown. In example 102H, a compound event that causes an unbalanced translocation is shown.

[0075] CNVs are duplication or deletion events. Figure 2 Exemplary CNV duplication and deletion events are depicted. In a duplication event (202), a sequence 206 of a reference genome 204 is repeated in a sample sequence 208. In a deletion scenario (210), a sequence 214 of a reference genome 212 is missing (does not appear) in a sample 216. A terminal deletion is a deletion of a sequence 214 at the terminal portion of a reference genome, while an interstitial deletion is a deletion of a sequence 214 from an internal portion of a reference genome.

[0076] CNV calling typically uses a depth-based approach to segment the genome into regions of continuous germline copy number. Under this approach, the genome is stratified into windows ("bins"), and the read depth is measured in 'bins'. The window size is customizable. In the example, the window size is about 1,000 bp long.

[0077] The window or box size corresponds to the concept of breakpoint resolution in CNV calling. Breakpoint (also referred to as "break end" or BND in this article) is a specific base position where an event (such as a variant) occurs in a genome. Breakpoint can be used to indicate a specific base pair position where a specified event begins, and sometimes indicates the position where an event ends. BND is a command of the known variant call format (VCF) specification, to specify the format of a text file for storing sequence variations. Although the BND symbol is robust for specifying more complex variants such as inversions and translocations, deletion events (DELs) and duplication events (DUPs) can be annotated by BND, such as the BND of the start and end positions of an event.

[0078] Historically, breakpoint position identification is not particularly important; it is sufficient to know that a CNV event exists on a specific gene (which can span hundreds of thousands of bases) without knowing the specific start and end positions of the event. This is still the case in some current applications. However, in other applications, it is more important to know the exact position of the CNV event. The resolution of the breakpoint under the binning method is a function of the window size. At 1 kbp intervals, a specific position is identified by determining the window where the position exists, even if it is not known to be exact. The beginning (or end, or some other single bp position) of the window can be used as the start or end point (break end) of the event, and therefore the exact position of the start or end of the event can deviate from about the window size, such as 1 kbp. As noted, due to issues surrounding the confidence and accuracy of CNV calls, some CNV callers filter out events whose length is less than a certain defined threshold, such as 10 kbp.

[0079] Figure 3 An exemplary CNV calling workflow is depicted. A workflow is a pipeline that can be executed by a genome sequencing analysis platform, such as the one available from Illumina Inc, San Diego, California, USA. Platform (DRAGEN is a registered trademark). Figure 3 , the workflow 300 begins with inputting case samples (e.g., in BAM / CRAM format) 302 into a target count processing module 304, which performs binning of read counts and other signals from alignments indicated by the case samples. The workflow 300 proceeds to a bias correction processing module 306 that provides correction for inherent systematic biases, and then to a normalization processing module 308 for detection of normal ploidy levels and normalization of case samples. The normalization module 308 can optionally employ a set of normals (PoN 310) that can be used when group or population samples are readily available. The workflow 300 continues with a segmentation processing module 312 that performs breakpoint detection by segmentation of the normalized signal, followed by calling / genotyping of a processing module 314 for thresholding, scoring, characterizing, and filtering putative events as copy number variants. The workflow then outputs the results (eg, records of CNV calls) as files 316 of a given format, such as known as VCF (ie, as *.vcf files).

[0080] The CNV call of some CNV callers is by deconstructing the event into component BND states, and then distinguishing CNV and SV to carry out.In this regard, the structural variant call of SV callers is also usually identified using BND format.Different from the read depth and binning method adopted by CNV call, wherein the read depth is used to detect the change of coverage level, SV call can utilize split read and incorrect read, and the reassembly of candidate contig (DNA fragment or sequence set overlapping in a manner providing a continuous representation of genomic region).Exemplary SV caller attempts to detect when there is shearing in comparison.'Soft shearing' in the comparison indicates that some fractions or parts of the read do not belong to a given locus, but belong to another part of a chromosome or may belong to another chromosome completely.Split read aspect provides the ability to determine that a given read splits across two different districts in the genome to give the indication of a certain structural variation occurring.When compared with a reference sequence, incorrect read aspect (because using paired end reads with known fragment length) identifies abnormal events, wherein the reassembly of candidate contig integrates the read in a given locus to produce the final indication of an SV event.

[0081] Unlike CNV calling, SV calling has base pair-level breakpoint resolution because soft-clip identification and checking are performed at the base pair level. Figure 4 An exemplary structural variant calling workflow is depicted. The workflow 400 proceeds through a discovery phase 402 that scans the genome for SV evidence, builds a graph of the involved junctions, and infers the approximate SV at each junction; an assembly / alignment phase 404 that performs a De-Bruijn graph reassembly of SVs, aligns the assembled haplotypes, and refines large SVs and finds small indels; and a scoring phase 406 that performs scoring for germline and somatic variants.

[0082] To illustrate an example of the difference in CNV and SV calling accuracy, Figure 5-Figure 6 Depicted are exemplary accuracies of CNV and SV deletion calls for a benchmark dataset. Figure 5 and Figure 6 Each figure in presents a table with columns for event length, recall, precision, f-score, bases (in kilobase pairs), and number of events. Each table has rows for different ranges of event lengths in base pairs, i.e., (i) 1000 to 5000, (ii) 5000 to 10,000, (iii) 10,000 to 20,000, (iv) 20,000 to 50,000, and (v) 50,000 and above. The benchmark markers are for high confidence regions in the GRCh37 human genome assembly benchmark dataset published by the National Institute of Science and Technology (NIST). Reference Figure 5Of particular note are the recall and precision values ​​for relatively short (i.e., less than 10 kpb) CNV calls, specifically compared to Figure 6 The recall and precision values ​​for SV calls of the same length are shown in Figure 2. The recall and precision values ​​for CNV events with lengths of 1000 to 5000 are .3700 and .6077, respectively, and the recall and precision values ​​for events with lengths of 5000 to 10000 are .4463 and .7985, respectively. In contrast, the recall and precision values ​​for SV events with lengths of 1000 to 5000 are .8985 and .9796, respectively, and the recall and precision values ​​for events with lengths of 5000 to 10000 are .9084 and .9982, respectively.

[0083] As described above, conventional CNV calling may filter out events smaller than a certain length (such as 10 kbp) due to relatively high CNV breakpoint resolution (e.g., about 1 kbp) and / or other reasons. Figure 5 However, aspects described herein present joint CNV-SV calling - SV-informed CNV calling - to improve CNV detection and calling, which provides significant improvements in recall and precision of short CNVs (<10 kbp). Figure 7 Depicted are exemplary accuracies in CNV deletion calling based on SV-informed CNV calling according to various aspects described herein. While improvements were shown for all CNV length ranges, of particular note were CNV events <10 kbp in length, where Figure 5 Compared to the accuracy shown in , recall and precision are significantly increased.

[0084] Figure 8 Depicted is a comparison graph of structural variants, copy number variants, and copy number variant calls informed by structural variants according to various aspects described herein. Specifically, the graph compares the number of copies of the structural variants from each of the given five event length ranges. Figure 5 , 6 and 7, and reflects a significant improvement in recall over conventional CV calling.

[0085] According to the aspects of SV-informed CNV calling described herein, the breakpoints of one or more identified CNVs (including those CNVs that may have been initially marked for filtering out) are adjusted to align with the breakpoints of the matching SV calls. Rather than identifying CNV breakpoints based on coverage bin boundaries, the breakpoint information from the SV calls is used to more accurately identify the position and length of the called CNVs, which has base pair level resolution. This produces CNVs with base pair level accuracy from the support of the SV caller information with base pair level resolution. The quality / confidence of SV-informed CNV events is higher because the breakpoint signal is utilized from the SV caller, and therefore some CNV calls that would otherwise be filtered out due to low confidence, i.e., if coverage bin boundaries were used for breakpoint identification, can be 'rescued' and provided in the output CNV VCF.

[0086] Fig. 9 Depicted is a conceptual representation of unaligned breakpoints for SV calls and CNV calls corresponding to the same event (DEL). SV breakpoints are represented in the SV calling data with associated confidence intervals that represent the range of positions of the breakpoints (left to right; low to high) to account for the SV caller's uncertainty about the exact location of these boundaries. Fig. 9 In the SV call, the breakpoints are indicated at positions A and B. These positions are expected to be different (not exactly aligned) from the positions indicated in the CNV call (indicated by A', B'), which are determined based on the variation in read depth under the windowing / binning approach discussed above.

[0087] Fig.10 An exemplary interface 1000 is presented that illustrates a comparison between SV-informed CNV calls according to aspects described herein and associated CNV-only and SV-only calls from conventional CNV and SV calling processing. The upper portion of the interface 1000 presents tracks 1002, 1004, 1006, 1008, and 1010 that visually represent variant call data (e.g., from a VCF file). Figure 10-12 Different parts of the track in question may be presented in different colors (or other visual characteristics) to distinguish between them.The lower portion 1012 of the interface 1000 presents a binary alignment map (BAM file) stacked representation of the read evidence (coverage and its fluctuations).

[0088] Track 1002, which may have a label such as "HG002.cnv.gff3", is a feature track. Track 1002 has a gap 1020 between portion 1022 and portion 1024 of the track, indicating that the CNV call indicated by track 1004 was indicated as failed (filtered out) by the CNV caller software. In this case, the CNV indicated by track 1004 will not be called as a CNV.

[0089] The other tracks 1004, 1006, 1008, and 1010 indicate the location of the corresponding event for each VCF file with the data for each track. Track 1004, which may have a label such as "CNV (initial)", is a CNV-only track, i.e., a track that a CNV caller (e.g., a conventional CNV caller) would call alone. Here, portion 1026 of track 1004, which is offset from portions 1025, 1027 of track 1004, indicates a CNV call that starts just after the 207,840 kbp position 1050 and ends just before the 207,846 kbp position 1052. Track 1006, which may have a label such as "SV (initial)", is a SV-only track, i.e., a track that a SV caller (e.g., a conventional SV caller) would call alone. Here, portion 1028 indicates an SV call starting just after position 1054 at 207,841 kbp and extending to just before the end of the initial CNV call (or track 1004), i.e., just before position 1052 at 207,846 kbp. The SV call of track 1006 is significantly shorter than the CNV call of track 1004. Track 1008, which may have a label such as "CNV (SV adjusted)", presents SV-informed CNV calls (CNV+SV calls) determined according to various aspects described herein. Portion 1030 of track 1008, which is offset from portions 1032 and 1034 of track 1008, indicates SV-informed CNV calls starting and ending at the locations where the SV calls of track 1006 begin and end. Track 1010 indicates, through portion 1040, the locations of specific variants as indicated by the truth set provided by NIST, i.e., high confidence calls curated by the NIST consortium. It can be seen that the overlap between the CNV+SV call 1026 and the NIST true value 1040 is much better than the overlap between the initial CNV call 1030 and the NIST true value 1040.

[0090] exist Fig.10 In the example of , the CNV caller identified a DEL but over-called it because the start position was before the actual start position of the event and the end position was before the actual end position of the event. At the same time, the SV events called by the SV caller aligned well with the BAM stack (as indicated by the vertical dashed line), and the CNV+SV adjusted calls of track 1008 reflect what the SV calls and true values ​​indicate.

[0091] In this example, the initial CNV call and the initial SV call can be matched and the breakpoints of the CNV are aligned with the breakpoints of the SV call observed by the SV caller. In this regard, the CNV+SV call is a SV-informed CNV call. Additionally, considering the capabilities of the CNV caller and its isolated output, the initial CNF call is filtered out, as indicated by trace 1002. However, the CNV+SV call can be made with a higher confidence, such that the CNV call is made and the initial CNV (as modified) is rescued / recovered (i.e., modified and reported rather than filtered out as it was originally).

[0092] In conventional practice, SV callers and CNV callers each generate their own data files indicating SV and CNV call data, respectively. Typically, these follow the VCF specification with separate fields for tags. Some fields are standard, although some are not in order to provide software tools with the flexibility to introduce caller-specific annotations and other information.

[0093] To illustrate an example of SV-informed CNV calling, consider the following exemplary SV and CNV data / records, and the resulting SV-informed CNV calls made based on them. The exemplary records are taken from Fig. 9 Scenario where copy number loss and broken end indications support a single DEL event. The calling data / records for SV calls generated by the SV caller are as follows:

[0094] chr1 105095607MantaDEL:61583:0:1:0:0:0 G <del>

[0095] 34 PASS END=105167400;SVTYPE=DEL;SVLEN=-71793;IMPRECISE;CIPOS=-416,417;CIEND=-232,233GT:FT:GQ:PL:PR

[0096] 0 / 1:PASS:34:84,0,564:37,7

[0097] The SV call data includes fields for presenting different information. chr1 indicates chromosome 1 as an identifier for the chromosome where the event occurs. 105095607 indicates the start position of the event, i.e., where the variant is located. MantaDEL:61583:0:1:0:0:0 is caller specific information and is not enforced by the VCF specification. Typically, this includes debugging information for developers and is not used by end users. G is the reference allele, meaning that a G base should be found on chromosome 1 at the start position 105095607. <del>It is an alternative allele or variant suggested by the record. The special symbol of the VCF specification gives the caller the ability to provide symbolic alleles-rather than listing all bases, variants can be provided as symbolic alleles in brackets. 34 is a quality score indicator represented by a phred scale, indicating the confidence level in the call. Usually, a threshold is defined and the quality score must be higher than the threshold number (in terms of confidence) passed by the call. The alternative scheme is a failure as a way to filter out low-confidence calls. PASS is provided in the filter field and indicates that the SV call is passed. If the record does not pass any filter (defined in the header of the VCF), the filter field can indicate such failure. Otherwise, as here, it indicates PASS.

[0098] The data following the PASS indication is an information annotation that can be defined in the header of the VCF file. END=105167400 indicates the end position of the event in question. SVTYPE=DEL is an information field, and the field indicates missing (here "DEL"), duplication ("DUP"), etc. SVLEN=-71793 indicates the length of the structural variant in question. Missing events are indicated by negative numbers and duplicate events are indicated by positive numbers. IMPRECISE is indicated in the flag field to indicate whether the SV caller can confidently assemble the indicated missing event. The IMPRECISE value here indicates that the call is imprecise. CIPOS=-416,417 and CIEND=-232,233 are the caller confidence intervals around the start position (CIPOS) and end position (CIEND) of the event.

[0099] GT:FT:GQ:PL:PR 0 / 1:PASS:34:84,0,564:37,7 presents two columns of information - the first column (GT:FT:GQ:PL:PR) provides colon-separated abbreviations for the values ​​in the corresponding positions of the second column (0 / 1:PASS:34:84,0,564:37,7). Thus, the GT abbreviation for genotype corresponds to the allele value 0 / 1, the FT abbreviation for the sample filter applied at the sample level corresponds to PASS, the GQ abbreviation for genotype quality corresponds to the phred-scaled value 34, the PL abbreviation is associated with the value 84,0,564, which is the normalized phred-scaled probability of the genotype considered in the variant record of the sample, and the PR abbreviation corresponds to the incorrect pair read count value 37,7.

[0100] Next, consider the Fig. 9 An example of a CNV caller providing the following CNV calling data / records of CNV calls:

[0101] chr1 105095597DRAGEN:LOSS:chr1:105095598-105167360N

[0102] <del>53PASS SVLEN=-

[0103] 71763;SVTYPE=CNV;END=105167360;REFLEN=71763

[0104] GT:SM:CN:BC:PE 0 / 1:0.47692:1:66:16,27

[0105] The exemplary CNV call data includes some of the same fields as the SV call fields discussed above, such as fields for chromosome identifier, start position of the event, caller specific information, reference allele, variant indicator, quality score, and filter fields indicating pass / fail status, as well as SVLEN and SVTYPE fields. It also includes indicators END= and REFLEN= for the end position and length of the CNV event.

[0106] The colon-separated abbreviations (GT:SM:CN:BC:PE) again correspond to the values ​​following the abbreviations (0 / 1:0.47692:1:66:16,27). The SM abbreviation for the fragment mean corresponds to 0.47692, the CN abbreviation for the rounded copy number corresponds to the value 1, and the BC and PE abbreviations correspond to the values ​​66 and 12,27, respectively, which are algorithmic indicators that support CNVs.

[0107] The SV and CNV data records from the SV caller and CNV caller, respectively, above may be correlated / matched according to various aspects described herein to form a SV-informed CNV call. The correlation / matching may be based on parsing the SV and CNV VCF data generated by the respective callers, examining breakpoints indicated for the SV call and CNV call, and attempting to correlate / match the SV call with the CNV call. According to various aspects described herein, the SV call that matches the CNV call may inform a modification to the CNV call to generate the SV-informed CNV call.

[0108] Based on correlating / matching the SV calls with the CNV calls, the process can determine the CNV call of the SV notification and provide corresponding VCF data to indicate the call. In an example, this can be performed entirely by software, such as software incorporated into the SV caller and / or CNV caller, such as the DRAGEN software provided by Illumina, Inc. In an example, the VCF data of the CNV call of the SV notification is generated based on modifying the data (or a copy thereof) of the CNV call.

[0109] Presented below are exemplary VCF data that may be output for SV-informed CNV calls determined / synthesized from correlating SV calls (e.g., "initial SV calls" - reflected by the SV calling data above) with CNV calls (e.g., "initial SCNV calls" - reflected by the CNV calling data above):

[0110] chr1 105095607DRAGEN:LOSS:chr1:105095607-105167400G

[0111] <del>53PASS SVLEN=-

[0112] 71793;SVTYPE=DEL;END=105167400;REFLEN=71793;SVCLAIM=DJ;

[0113] IMPRECISE; CIPOS=-416,417; CIEND=-232,233

[0114] GT:SM:CN:BC:FT:GQ:PL:PR

[0115] 0 / 1:0.47692:1:66:PASS:34:84,0,564:37,7

[0116] The CNV call record of the exemplary SV notification above includes many of the same fields as the SV and CNV calls discussed above, with a mixture of annotations from each field. This information includes fields for chromosome identifiers, the start position of the event, caller-specific information, reference alleles, variant indicators, quality scores, and filter fields indicating pass / fail status, as well as SVLEN and SVTYPE fields and fields for position (END=) and event length (REFLEN=). In this example, the start and end positions of the CNV have been modified to the start position (105095607) and end position (105167400) of the SV event. Other information that depends on these modifications, such as event length, can also be updated. For example, an SVLEN of -71793 is used instead of the SVLEN-71763 of the initial CNV record. Additionally, the quality score 53 means that the filtering result (PASS) remains the same as the result of the CNV record, but it is possible that if the filtering result of the initial CNV record is FAIL, then based on the CNV call of the SV notification that determines this to be more accurate, this can be updated to PASS in the CNV call record of the SV notification. In some examples, the CNV call of the SV notification must be updated to indicate a PASS status (if the CNV call information does not already indicate PASS) and no change is made to the quality score. In other examples, the quality score can be modified to indicate a higher quality, i.e., at least to a minimum level that results in a PASS. In yet another example, the quality score is set to a maximum confidence level to ensure a PASS result.

[0117] The call also includes a field to indicate the source of the call (eg, SVCLAIM=DJ field here), such as a (SV+CNV) CNV call to distinguish between CNV-only, SV-only, and SV notifications. In this example, the "DJ" attribute indicates the use of depth (D) and connection (J) signals.

[0118] Therefore, when determining the CNV call for the SV notification, it is desirable to update / adjust one or both endpoints of the call relative to the initial position indicated by the initial CNV. Additionally, the quality score and value in the filter field may also be updated.

[0119] The call data for SV-informed CNV calls can be output, just as the call data for SV and CNV calls can be output, for example, in a VCF file. The VCF can be an existing VCF file generated (e.g., a VCF file in which SV and / or CNV records are output), or a different VCF file. In some examples, the initial CNV record will no longer be included in the final output VCF. This may be desirable so that downstream analysis does not consider that the initial CNV record itself indicates a CNV other than the SV-informed CNV. However, in some embodiments, the initial SV VCF and CNV VCF are still made available (output), for example to provide backward compatibility for tertiary analysis software.

[0120] Fig.11 Another exemplary interface 1100 is presented, which shows the comparison between the copy number variant call and the associated only copy number variant and only structural variant call from conventional copy number variant and structural variant call processing according to the structural variant notification of various aspects described herein.Another example of adjusting the boundary of initial CNV call is illustrated.Track 1102,1104,1106,1108 and 1110 are visually represented again as variant call data, and the lower part 1112 of interface 1100 presents the BAM accumulation representation of read evidence.Track 1102 is a feature track with part 1120 between part 1122 and 1124, which indicates that the CNV call indicated by track 1104 is indicated as passing by CNV caller software.Track 1104 is the "CNV (initial)" track of initial CNV call, wherein part 1126 (from the offset of part 1125,1127 of track 1104) indicates CNV call and start / end position. Track 1106 is a "CNV (initial)" track of initial SV calls. Portion 1128 indicates SV calls that start at an apparent position after the start position of the CNV (indicated by 1126) and end at a position after the end position of the CNV. Track 1108 is a "CNV (SV adjusted)" track that presents SV-informed CNV calls determined according to various aspects described herein. Portion 1130 of track 1108 is offset from portions 1132 and 1134 of the track to indicate CNV_SV calls that start and end at the positions where the SV calls of track 1106 start and end. The ends of the SV-informed CNV calls indicated by 1130 are moved inward on the front / beginning and out ends compared to the ends of the initial CNV (indicated by 1126) to match the SV calls (indicated by 1128). Track 1110 indicates the location of a specific variant through portion 1140, as indicated at 1140 by the truth set provided by NIST. In this case, there is a discrepancy between the endpoint of the SV-notified CNV call and the true value because the SV-notified CNV appears to be shifted to a later starting position, yet the final (SV-notified CNV) call is still better aligned with the true value than the initial CNV call, which overflowed significantly on the front end but passed the filtering and would be reported by the CNV caller as a less accurate CNV than the SV-notified CNV.

[0121] Fig.12 An additional exemplary interface 1200 is presented that illustrates a comparison between copy number variant calls informed by structural variants according to aspects described herein and associated copy number variant-only and structural variant-only calls from conventional copy number variant and structural variant calling processes. Tracks 1202, 1204, 1206, 1208, and 1210 again represent feature tracks, "CNV (initial)" tracks, "SV (initial)" tracks, "CNV (SV adjusted)" tracks, and NIST provided truth set tracks, respectively. The lower portion 1212 of the interface 1200 presents a BAM stacked representation of the read evidence.

[0122] Portion 1220 of trace 1202 may be rendered in a color (such as gray) indicating that the called initial CNV record (indicated by 1226) is filtered out and will not be reported. However, the breakpoints of the initial CNV call (indicated by 1226) are adjusted based on the breakpoints of the initial SV call (indicated by 1228) as described herein to form an SV-informed CNV call (indicated by 1230) in which both breakpoints are moved inward (the start breakpoint of the CNV is moved to a larger base position and the end breakpoint is moved to a smaller base position) to match the SV. This results in an updated quality score and filter state to render the SV-informed CNV call as a passing record, useful in downstream (e.g., tertiary) analysis of the event.

[0123] Reference now Fig.13 Discussing additional details of merging calls and handling conflicting breakpoints, the figure depicts an exemplary conceptual diagram of CNV and SV calls along a segment of a genome. Three adjacent CNV calls CNV1, CNV2, and CNV3 are shown, as well as two SV calls SV1 and SV2. The vertical dashed lines leading from the ends of the calls to the position indicators / values ​​(POS) below indicate the breakpoints associated with each call in the call.

[0124] Typically, a process can correlate CNV and SV calls through its records, thereby determining which (if any) SV calls match any given CNV call based on defined rules. Fig.13 As an example, first consider Fig.13 The following are example raw records of CNVs and SVs:

[0125] -[CV1:]chr21 14086984DRAGEN:LOSS:chr21:14086985-14088368

[0126] N <del>17PASS SVLEN=-1384;SVTYPE=CNV;

[0127] END=14088368;REFLEN=1384GT:SM:CN:BC:PE

[0128] 0 / 1:0.429575:1:2:11,83

[0129] -[CNV2:]chr21 14088368DRAGEN:LOSS:chr21:14088369-14089074

[0130] N <del>36PASS SVLEN=-706;SVTYPE=CNV;

[0131] END=14089074;REFLEN=706GT:SM:CN:BC:PE

[0132] 1 / 1:1.00055e-09:0:1:83,67

[0133] -[CNV3:]chr21 14089075DRAGEN:REF:chr21:14089075-15216030

[0134] N.54PASS END=15216030;REFLEN=1126956

[0135] GT:SM:CN:BC:PE. / .:1.04001:2:2031:67,52

[0136] -[SV1:]chr21 14088114

[0137] MantaDEL:8384:19:20:0:0:0AATTATATATA...A 999PASS

[0138] END=14088335;SVTYPE=DEL;SVLEN=-221;CIGAR=1M221D;

[0139] CIPOS=0,1;HOMLEN=1;HOMSEQ=A GT:FT:GQ:PL:PR:SR

[0140] 1 / 1:PASS:95:999,98,0:0,0:0,32

[0141] -[SV2:]chr21 14088467MantaDEL:8384:19:20:0:0:1T <del>

[0142] 999PASS END = 14089536; SVTYPE = DEL; SVLEN = -

[0143] 1069; CIPOS = 0,1; CIEND = 0,1; HOMLEN = 1; HOMSEQ = C

[0144] GT:FT:GQ:PL:PR:SR 1 / 1:PASS:132:999,135,0:0,8:0,41

[0145] Exemplary related processes are performed for each pair of CNV and SV and then for each breakpoint. Hereinafter, the bracket notation indicates the start or end position of a given CNV event, followed by the start or end of a given SV event, i.e., "(Start,End)" means the start of the CNV, i.e., the coordinate (cnvCoord) where the CNV starts, and the end of the SV, i.e., the coordinate (svCoord) where the SV ends. The comparison of (X,Y) evaluates whether the breakpoint of the CNV should potentially be modified to the breakpoint of the SV and checks the orientation related to the change in depth status to ensure it is consistent (i.e., REF->DUP transition or REF->DEL transition, DEL->REF, DUP->REF). The term 'orientation' in this context refers to the depth status transition, and compatibility is important. For example, if the SV breakpoint indicates a change from REF->DUP but the CNV breakpoint indicates a REF->DEL change, these are incompatible and do not match. The term "otherEndCoord" refers to the relative end currently being evaluated. Thus, if the start position is being evaluated, "otherEndCoord" refers to the stop position.

[0146] The examination of the exemplary process of modifying the potential SV notification of CNV2 and CNV3 to form the CNV call of the SV notification is carried out as follows:

[0147] For CNV2:

[0148] ● Compare with SV1:

[0149] ○ (Start,Start) / / Compare the start of CNV2 with the start of SV1

[0150] ■ This fails because svCoord < svOtherEndCoord && svOtherEndCoord <= cnvCoord (the start of SV1 is before the end of SV1 in position, and the end of SV1 is at or before the start of CNV2). This enforces the rule of requiring at least some overlap between the SV and the CNV, as proposed for modification.

[0151] ○(Start,End) / / Compare CNV2 start and SV1 end

[0152] ■ This fails when haveCompatibleOrientations (i.e., CNV2 and SV1 will have incompatible orientations). In other words, the CNV2 start is incompatible with the SV1 end and cannot be updated as such, because the CNV2 start is the start of a DEL, and the SV1 end is the end of a DEL. This implements a rule that checks compatibility of orientations (of the proposed modified CNV and SV).

[0153] ○(End,Start) / / Compare the end of CNV2 and the start of SV1

[0154] ■ Failure is because cnvOtherEndCoord>=svCoord (CNV2 start is positionally located at or after SV1 start). In other words, CNV2 end cannot be updated to SV1 start because CNV2 start (which is positionally located before CNV end) is at / after SV1 start, which would produce a non-positive length event / variant.

[0155] ○(End,End) / / Compare the end of CNV2 and the end of SV1

[0156] ■ Failure because cnvOtherEndCoord>=svCoord (CNV2 starts at or after the end of SV1), which would generate a non-positive length event

[0157] / variants.

[0158] ●Comparison with SV2:

[0159] ○(Start,Start) / / Compare CNV2 start and SV2 start

[0160] ■ Pass (two positions are within some threshold distance, e.g. 1,000 bp) and are unique (checks to ensure that a single breakpoint matches only one other breakpoint, i.e. is unambiguous). This enforces the rule that related breakpoints (e.g. CNV_start and SV_start here) are within some threshold distance.

[0161] ○(Start,End) / / Compare CNV2 start and SV2 end

[0162] ■Failed when positionsAreCloseEnough (1168<=1000)

[0163] ○(End,Start) / / Compare CNV2 end and SV2 start

[0164] ■ Failed in haveCompatibleOrientations (i.e., CNV2 and SV will have incompatible orientations because the end of CNV2 is the end of DEL, while the start of SV1 is the start of DEL).

[0165] ○(End,End) / / Compare the end of CNV2 with the end of SV2

[0166] ■ Passed (both positions are within a certain threshold distance) and is unique for CNV3:

[0167] ● Compare with SV1:

[0168] ○(Start,Start) / / Compare the start of CNV3 with the start of SV1

[0169] ■ Failed because svCoord < svOtherEndCoord && svOtherEndCoord <= cnvCoord (the start of SV1 is before the end of SV1 in position, and the end of SV1 is at or before the start of CNV3).

[0170] ○(Start,End) / / Compare the start of CNV3 with the end of SV1

[0171] ■ Passed and is the first hit, so it is marked as unique

[0172] ○(End,Start) / / Compare the end of CNV3 with the start of SV1

[0173] ■ Failed in positionsAreCloseEnough (1127916 <= 1000) - the difference between the start of CNV3 and the end of SV1 is 1127916, which is not less than or equal to the threshold 1000

[0174] ○(End,End) / / Compare the end of CNV3 with the end of SV1

[0175] ■ Failed in positionsAreCloseEnough (1127695 <= 1000) - the difference between the end of CNV3 and the end of SV1 is 1127695, which is not less than or equal to the threshold 1000

[0176] ● Compare with SV2:

[0177] ○(Start,Start) / / Compare the start of CNV3 with the start of SV2

[0178] ■ Fail if haveCompatibleOrientations (i.e., CNV2 and SV1 will have incompatible orientations)

[0179] ○(Start,End) / / Compare CNV3 start and SV2 end

[0180] ■ Passed, and now this is no longer marked as unique because the CNV3 start breakpoint also matches the SV1 end breakpoint.

[0181] ○(End,Start) / / Compare CNV3 end and SV2 start

[0182] ■ Failed when positionsAreCloseEnough (1127563 <= 1000) - The difference between the end of CNV3 and the start of SV2 is 1127563, which is not less than or equal to the threshold of 1000

[0183] ○(End,End) / / Compare the end of CNV3 and the end of SV2

[0184] ■ Failed when positionsAreCloseEnough (1126494 <= 1000) - The difference between the end of CNV3 and the end of SV2 is 1126494, which is not less than or equal to the threshold of 1000

[0185] Based on the above, the initial CNV2 matches the initial SV2 due to (i) two passes on (Start, Start) and (End, End) and (ii) the CNV start and end each pass uniquely. Therefore, the CNV call of the SV notification will call the CNV starting at the start of SV2 and ending at the end of SV2. The initial CNV3 does not match the initial SV1 or SV2 and is not modified.

[0186] In this example, the end of CNV2 uniquely matches the end of SV2 (and is therefore updated), but the start of CNV3 does not uniquely match the end of SV2 (it matches the start of SV1). Therefore, CNV3 will not get updated. This results in overlapping fragments of CNV2 and CNV3 because the end position of CNV2 is updated, but the start of CNV3 is not updated. In some examples, if this is undesirable, a potential workaround is to mitigate scenarios where conflicts occur by only allowing SVs > minLength (say 500bp) as candidates for merging. Additionally or alternatively, if the endpoint of a previous CNV is adjusted and it abuts a subsequent CNV, the subsequent CNV can be forced to adjust to match the previous adjustment.

[0187] Fig.14 Describe the concept diagram of the process of copy number variant calling and output for structural variant notification according to various aspects described herein.The process includes step 1402 of building SV and CNV collections, which constitute the initial CNV and SV records with SV / CNV annotations.In an embodiment, each SV and CNV record can be wrapped in a corresponding matchable structure, and such matchable structures for each given chromosome can be provided in a vector sorted by pos.The top-level collection can map contig names to vectors.

[0188] Fig.14 The process also includes a step 1404 of matching SV and CNV breakpoints, for example using the proximity, orientation, and uniqueness rules discussed and exemplified herein to determine compatibility / relevance / match. In the example, the closest match wins. In an exemplary embodiment, the CNV match asks whether the CNV start is matchable to the SV, and if so, the corresponding matchable structure of the CNV records an index into the SV vector of the best matching SV, and in the case of a DEL or TANDUP, whether the match is to the SV end. Similarly, the best match of the CNV end can be recorded into the matchable structure of the CNV, an index into the SV vector of the best matching SV of the CNV end, and whether the match is to the SV end.

[0189] Fig.14 The process continues at step 1406 to modify the call. In the example, this is performed only for the CNV call by adjusting the CNV endpoints, such as by adding "LEFT_BND_OF" and "LEFT_BND" indicators for the initial CNV record (or its copy). The CNV record with SV matches can be modified as follows: For left end SV matches, adjust the CNV start position, add origCnvPos annotation, and add LEFT_BND annotation. For right end SV matches, adjust the CNV end, add origCnvEnd annotation, and add RIGHT_BND annotation.

[0190] continue Fig.14 , the process includes steps 1408 and 1410 to identify calls that can be combined (1408) and combine them (1410). If both ends of the CNV match corresponding ends of a compatible DEL or TANDUP, the SV content can be added to the mergeable CNV. In a specific example, the SV and CNV records are compressed (compressed / zipped) into SvCnvMergedCall records, which merge the SV data into a CNF call when the calls are compatible. In the example, CNV calls are not excluded based on the lack of SV signals, which means that CNV calls made by a CNV caller will not be removed based on the failure of a corresponding SV call / signal to exist for that CNV.

[0191] In some embodiments of the identify / combine calls step (1408, 1410), the process modifies the merged calls wherein, for example, for each SV-notified CNV call (SV+CNV call) maintained in the combined call set, the call adds the SVID to the CNV record INFO and / or adds other SV INFO or FORMAT / sample content to the CNV record.

[0192] Fig.14 Also included is an output step 1412, in which the sorted records are written using a VCF file writer. In an embodiment, SV records that do not match any CNV records are written to the VCF file by rendering the SV records as a VCF string and parsing the string as a VCF record. At the same time, the header lines from the CNV and SV record VCF files can be combined into a single header, where redundant content is deduplicated, and each entry of the "combinedCalls" collection is then output as an entry in the VCF, where entries that are CNV or SV+CNV are written to the file by a CNV caller, such as a tool used by a VCF record writer, and entries that are only SV are rendered by a SV record renderer, the resulting string is converted into a VCF record, and written to the file by a VCF record writer.

[0193] In an example, the matching constraints used in matching (1404) may include a coarse horizontal distance check maxCoordDelta (e.g., set at 2000) to group CNVs and SVs together and a parameter maxCnvGap (e.g., set at 20000) to determine the transition state of a CNV between two CNVs. A distance greater than this value will mark the transition as unknown, as there may be other CNVs between the two CNVs.

[0194] An exemplary case when calling end matches is allowed (i.e., as in step 1404) is as follows: the coordinates must be "close enough" and no other compatible call is closer; close enough can be defined by a parameter indicating a number of base pairs such as 2,000 if there is a large enough gap between the CNV end of interest and the next nearest CNV end, the direction of the copy number change cannot conflict with the SV "open" side - a copy number increase conflicts with the right open side of a right open BND or DEL / TDUP, a copy number decrease conflicts with the right open side of a left open BND or DEL / TDUP, and the direction of the copy number change can be considered "unknown" (allowing any SV to match); and (iii) both the start and end pairs match, i.e., both CNV ends match the same SV DEL or TDUP.

[0195] In the relatively simple case of a 1-1 match between a CNV and a SV DEL or DUP, the record may be mergeable, wherein the SV record information is provided in the CNV record. At the same time, a CNV without a related SV may be retained alone (reported as is), and a short SV call without a compatible CNV may be retained alone. The various aspects presented herein are also applicable to reconstruction of more complex structural variants, such as when a 1-1 match (CNV to SV) is not suitable. In these cases, the CNV and SV records may remain separate but associated with each other. In an example, the broken ends of the CNV record may be refined, and each end of the CNV call may be linked to the broken end (if present). In an example, for large (germline and somatic) SV calls that are not directly equivalent to CNVs, these may be decomposed into broken ends, and these broken ends may be linked to compatible CNV ends.

[0196] The following presents a scenario where the missing event is completely contained within the repeat. Consider Fig.15 The depth and break distribution of this case are shown in Figure 2. The depth-based CNV caller detects this as two elevated duplication events - from left to right (ABCDE): '...REF-DUP-REF-DUP-REF...'. Fig.15 This example scenario of / 16 reports the SV and CNV records separately (ignoring the REF field):

[0197] [SV]:18 2634272MantaDUP:TANDEM:154754:0:1:0:0:0T

[0198] <dup:tandem>826PASS END=2733679;SVTYPE=DUP;

[0199] SVLEN=99407;CIPOS=0,2;CIEND=0,2;HOMLEN=2;HOMSEQ=TT

[0200] GT:FT:GQ:PL:PR:SR 0 / 1:PASS:826:876,0,999:53,18:49,15

[0201] [SV]:18 2643737MantaDEL:154756:0:1:0:0:0A <del>758

[0202] PASS END=2655644;SVTYPE=DEL;SVLEN=-11907;SVINSLEN=3;

[0203] SVINSSEQ=ATC GT:FT:GQ:PL:PR:SR

[0204] 0 / 1:PASS:758:808,0,999:47,16:50,14

[0205] [CNV]:18 2633245DRAGEN:GAIN:18:2633246-2643044N

[0206] <dup>37cnvLength SVLEN=9799;SVTYPE=CNV

[0207] END=2643044;REFLEN=9799GT:SM:CN:BC:PE. / 1:1.5916:3:8:33,24

[0208] [CNV]:18 2655539DRAGEN:GAIN:18:2655540-2733932N

[0209] <dup>58PASSSVLEN=78393;SVTYPE=CNV

[0210] END=2733932; REFLEN=78393GT:SM:CN:BC:PE

[0211] . / 1:1.59787:3:71:23,27

[0212] This has the potentially oversimplified interpretation that there are only two CNV repeats within the locus. This interpretation does not indicate what the true sequence of events that explains the construction of the locus is more likely to be - specifically, there is a duplication across BCD, and then there is a deletion within C. Given the SV BND signal, the start of B (or the end of A) is tied to the end of D (or the start of E), and the start of C (or the end of B) is tied to the end of C (or the start of D).

[0213] According to the above, Fig.16 Some possible reconstructions of the events are presented. It can be easily observed that for the copy changes, they all share an extra copy of B and an extra copy of D, reflected as the following records respectively:

[0214] 18 2634272DRAGEN:GAIN:18:2634272-2643737N <dup>37cnvLength

[0215] SVLEN=xxxx;SVTYPE=CNV;END=2643737;REFLEN=xxxx

[0216] GT:SM:CN:BC:PE. / 1:1.5916:3:8:33,24

[0217] 18 2655539DRAGEN:GAIN:18:2655539-2733679N <dup>58PASS

[0218] SVLEN=xxxx; SVTYPE=CNV; END=2733679; REFLEN=xxxxx

[0219] GT:SM:CN:BC:PE. / 1:1.59787:3:71:23,27

[0220] Regarding new adjacencies, Fig.16 The reconstruction shown in renders the following:

[0221] -End (D) connected to beg (B) -->

[0222] -beg(B) is preceded by end(D)

[0223] - The end (D) is followed by beg (B)

[0224] -End (B) connected to beg (D) -->

[0225] - The end (B) is followed by the beg (D)

[0226] -beg(D) is preceded by end(B)

[0227] Notice, Fig.16 The final (third) scenario involves "double minutes" - small fragments of extrachromosomal DNA, which could explain the elevated depths within B and D.

[0228] The new adjacency may be reflected by the following record (where the initial SV call is broken down into staggered ends):

[0229] -[beg(B) is preceded by end(D)]:

[0230] 18 2634272MantaBND:1754:0:1:0:0:0T]18:2733679]T 826PASS SVTYPE=BND; MATEID=MantaBND:1754:0:1:0:0:1; CIPOS=0,2;

[0231] CIEND=0,2;HOMLEN=2;HOMSEQ=TT GT:FT:GQ:PL:PR:SR

[0232] 0 / 1:PASS:826:876,0,999:53,18:49,15

[0233] -[end (D) followed by beg (B)]:

[0234] 18 2733679BlackBND : 1754 : 0 : 1 : 0 : 0 : 1C C [ 18 : 2634272 [ 826

[0235] PASS SVTYPE?BND:MATEID:BlanketBND:1754:0:1:0:0:0:CIPOS:0,2;

[0236] CIEND00.2HOMLEN02HOMSEQTT GT:FT:GQ:PL:PR:SR

[0237] 0 / 1 : PASS : 826 : 876 , 0 , 999 : 53 , 18 : 49 , 15

[0238] -[Special (B) based beg(D)]:

[0239] 18 2643737BlackBND : 154756 : 0 : 1 : 0 : 0 : 0 A A [ 18 : 2655539 [ 758

[0240] PASS SVTYPE:BND:MATEID:MantaBND:1756:0:1:0:0:1;

[0241] SWINSLEENN3;SWINSSEQ:ATC GT:FT:GQ:PL:PR:SR

[0242] 0 / 1:PASS:758:808.0.999:47.16:50.14

[0243] -[beg(D) beg(B)]:

[0244] 18 2655539BlanketBND:154756:0:1:0:0:1G]18:2643737]G758

[0245] PASS SVTYPE:BND:MATEID:MantaBND:1756:0:1:0:0:0;

[0246] SWINSLEENN3;SWINSSEQ:ATC GT:FT:GQ:PL:PR:SR

[0247] 0 / 1:PASS:758:808.0.999:47.16:50.14

[0248] At this point, the process can match the CNV start / end positions to the corresponding BND by updating the CNV record to reflect the "link" to the SV BND record. At the same time, the SV record, which has been broken down into its constituent BND format, can also be updated. The following presents the updated CNV and SV records resulting from an additional copy of B, which causes something other than A to exist before the copy of B, and something other than C to exist after the copy of B (italics emphasize significant properties for linking purposes):

[0249] -18 2634272DRAGEN:GAIN:18:2634272-2643737N <dup>37

[0250] cnvLength SVLEN=xxxx;SVTYPE=CNV;END=2643737;REFLEN=xxxx;

[0251] LEFT_BND=MantaBND:1754:0:1:0:0:0;

[0252] RIGHT_BND=MantaBND:1756:0:1:0:0:0

[0253] GT:SM:CN:BC:PE. / 1:1.5916:3:8:33,24

[0254] -18 2634272MantaBND:1754:0:1:0:0:0T]18:2733679]T 826PASS

[0255] SVTYPE=BND;MATEID=MantaBND:1754:0:1:0:0:1;CIPOS=0,2;CIEND=0,

[0256] 2;HOMLEN=2;HOMSEQ=TT;

[0257] LEFT_BND_OF=DRAGEN:GAIN:18:2634272-2643737

[0258] GT:FT:GQ:PL:PR:SR 0 / 1:PASS:826:876,0,999:53,18:49,15

[0259] -18 2643737MantaBND:1756:0:1:0:0:0A A[18:2655539[758

[0260] PASS SVTYPE=BND;MATEID=MantaBND:1756:0:1:0:0:1;

[0261] SVINSLEN=3;SVINSSEQ=ATC;

[0262] RIGHT_BND_OF=DRAGEN:GAIN:18:2634272-2643737

[0263] GT:FT:GQ:PL:PR:SR 0 / 1:PASS:758:808,0,999:47,16:50,14

[0264] In the above, LEFT_BND=MantaBND:1754:0:1:0:0:0 and RIGHT_BND=MantaBND:1756:0:1:0:0:0 have been added to the first record to reflect the links to the second and third records. The second record has been modified to include MantaBND:1754:0:1:0:0:0 and LEFT_BND_OF=DRAGEN:GAIN:18:2634272-2643737, which indicates the link to the first record as the left end. The third record has been modified to include MantaBND:1756:0:1:0:0:0 and RIGHT_BND_OF=DRAGEN:GAIN:18:2634272-2643737, which indicates the link to the first record as the right end.

[0265] The following presents the updated CNV and SV records resulting from an additional copy of D, which causes something other than C to exist before the copy of D, and something other than A to exist after the copy of D (italics emphasize significant properties for linking purposes):

[0266] -18 2655539DRAGEN:GAIN:18:2655539-2733679N <dup>58

[0267] PASS SVLEN=xxxx;SVTYPE=CNV;END=2733679;REFLEN=xxxxx;

[0268] LEFT_BND=MantaBND:1756:0:1:0:0:1;RIGHT_BND=

[0269] MantaBND:1754:0:1:0:0:1GT:SM:CN:BC:PE. / 1:1.59787:3:71:23,27

[0270] -18 2733679MantaBND:1754:0:1:0:0:1C C[18:2634272[826

[0271] PASS SVTYPE=BND;MATEID=MantaBND:1754:0:1:0:0:0;CIPOS=0,2;

[0272] CIEND=0,2;HOMLEN=2;HOMSEQ=TT;RIGHT_BND_OF=

[0273] DRAGEN:GAIN:18:2655539-2733679GT:FT:GQ:PL:PR:SR

[0274] 0 / 1:PASS:826:876,0,999:53,18:49,15

[0275] -18 2655539MantaBND:1756:0:1:0:0:1G]18:2643737]G 758

[0276] PASS SVTYPE=BND;MATEID=MantaBND:1756:0:1:0:0:0;

[0277] SVINSLEN=3;SVINSSEQ=ATC;

[0278] LEFT_BND_OF=DRAGEN:GAIN:18:2655539-2733679

[0279] GT:FT:GQ:PL:PR:SR 0 / 1:PASS:758:808,0,999:47,16:50,14

[0280] In the above, LEFT_BND=MantaBND:1756:0:1:0:0:1 and RIGHT_BND=MantaBND:1754:0:1:0:0:1 have been added to the first record to reflect the links to the second and third records. The second record has been modified to include MantaBND:1754:0:1:0:0:1 and RIGHT_BND_OF=DRAGEN:GAIN:18:2655539-2733679, which indicates the link to the first record as the right end. The third record has been modified to include MantaBND:1756:0:1:0:0:1 and LEFT_BND_OF=DRAGEN:GAIN:18:2655539-2733679, which indicates the link to the first record as the left end.

[0281] The final calls that can be made based on the above output are presented below, with CNV calls with adjusted positions and links to BND calls, and SVs are represented as BNDs with links to the appropriate CNV calls (italics emphasize significant properties for linking purposes):

[0282] -18 2634272DRAGEN:GAIN:18:2634272-2643737N <dup>37

[0283] cnvLength SVLEN=xxxx;SVTYPE=CNV;END=2643737;REFLEN=xxxx;

[0284] LEFT_BND=MantaBND:1754:0:1:0:0:0;RIGHT_BND=

[0285] MantaBND:1756:0:1:0:0:0GT:SM:CN:BC:PE. / 1:1.5916:3:8:33,24

[0286] -18 2655539DRAGEN:GAIN:18:2655539-2733679N <dup>58

[0287] PASS SVLEN=xxxx;SVTYPE=CNV;END=2733679;REFLEN=xxxxx;

[0288] LEFT_BND=MantaBND:1756:0:1:0:0:1;RIGHT_BND=

[0289] MantaBND:1754:0:1:0:0:1GT:SM:CN:BC:PE. / 1:1.59787:3:71:23,27

[0290] -18 2634272MantaBND:1754:0:1:0:0:0T]18:2733679]T 826

[0291] PASS SVTYPE=BND;MATEID=MantaBND:1754:0:1:0:0:1;CIPOS=0,2;

[0292] CIEND=0,2;HOMLEN=2;HOMSEQ=TT;LEFT_BND_OF=

[0293] DRAGEN:GAIN:18:2634272-2643737GT:FT:GQ:PL:PR:SR

[0294] 0 / 1:PASS:826:876,0,999:53,18:49,15

[0295] -18 2733679MantaBND:1754:0:1:0:0:1C C[18:2634272[826

[0296] PASS SVTYPE=BND;MATEID=MantaBND:1754:0:1:0:0:0;CIPOS=0,2;

[0297] CIEND=0,2;HOMLEN=2;HOMSEQ=TT;

[0298] RIGHT_BND_OF=DRAGEN:GAIN:18:2655539-2733679

[0299] GT:FT:GQ:PL:PR:SR 0 / 1:PASS:826:876,0,999:53,18:49,15

[0300] -18 2643737MantaBND:1756:0:1:0:0:0A A[18:2655539[758

[0301] PASS SVTYPE=BND; MATEID=MantaBND:1756:0:1:0:0:1;

[0302] SVINSLEN=3; SVINSSEQ=ATC;

[0303] RIGHT_BND_OF=DRAGEN:GAIN:18:2634272-2643737

[0304] GT:FT:GQ:PL:PR:SR 0 / 1:PASS:758:808,0,999:47,16:50,14

[0305] -18 2655539MantaBND:1756:0:1:0:0:1G]18:2643737]G 758

[0306] PASS SVTYPE=BND; MATEID=MantaBND:1756:0:1:0:0:0;

[0307] SVINSLEN=3; SVINSSEQ=ATC; LEFT_BND_OF=

[0308] DRAGEN:GAIN:18:2655539-2733679GT:FT:GQ:PL:PR:SR

[0309] 0 / 1:PASS:758:808,0,999:47,16:50,14

[0310] With indication <dup:tandem>and <del>Compared to the initial two SV records of , the updated records (four in total) are presented as BND records in VCF format, which may be the preferred format for specifying complex rearrangements with broken ends.

[0311] Based on the above, the CNV will have more accurate updated breakpoints due to the finer resolution obtained from utilizing the SV record information. It should be noted that this record set may not represent the entire event - for example, REF records may also be output when appropriate. In this example, the following REF record would be appropriate:

[0312] -18 2643737.DRAGEN:REF:18:2643737-2655539N.10PASS

[0313] END=2655539; REFLEN=xxxx GT:SM:CN:BC:PE. / .:1.15766:2:11:24,23

[0314] It should be noted that the exemplary output above is only one example. Ultimately, how events are reported can be determined based on the specific downstream interpretation tools to be used and how they expect events to be presented.

[0315] Another complex scenario involving a double inversion deletion-duplication event is presented below. Consider Fig.17 The depth and stump distribution for this case are shown below. The initial SV record reported is presented below:

[0316] -16 34392108MantaBND:151955:0:1:0:0:0:0C

[0317] C]16:34757737]526PASS SVTYPE=BND;

[0318] MATEID=MantaBND:151955:0:1:0:0:0:1; CIPOS=0,3; HOMLEN=3;

[0319] HOMSEQ=TGG;BND_DEPTH=25;MATE_BND_DEPTH=39

[0320] GT:FT:GQ:PL:PR:SR 0 / 1:PASS:526:576,0,659:31,12:34,9

[0321] -16 34757734MantaBND:151955:0:1:0:0:0:1T

[0322] T]16:34392111]526PASS SVTYPE=BND;

[0323] MATEID=MantaBND:151955:0:1:0:0:0:0; CIPOS=0,3; HOMLEN=3;

[0324] HOMSEQ=CCA;BND_DEPTH=39;MATE_BND_DEPTH=25

[0325] GT:FT:GQ:PL:PR:SR 0 / 1:PASS:526:576,0,659:31,12:34,9

[0326] -16 34396020MantaBND:151962:0:1:0:0:0:1A

[0327] [16:34464610[A..SVTYPE=BND;

[0328] MATEID=MantaBND:151962:0:1:0:0:0:0;IMPRECISE;CIPOS=-257,258;

[0329] BND_PAIR_COUNT=4;PAIR_COUNT=4

[0330] -16 34464610MantaBND:151962:0:1:0:0:0:0G

[0331] [16:34396020[G..SVTYPE=BND;

[0332] MATEID=MantaBND:151962:0:1:0:0:0:1;IMPRECISE;CIPOS=-250,250;

[0333] BND_PAIR_COUNT=6;PAIR_COUNT=4

[0334] In this example, only one of the two inversions is actually in the SV record call set (the other is only a candidate).

[0335] The following presents the initial CNV records reported:

[0336] -16 34173661DRAGEN:REF:16:34173661-34458728N.59

[0337] PASS END=34458728;REFLEN=285068GT:SM:CN:BC:PE

[0338] . / .:0.941707:2:226:20,1

[0339] -16 34466335DRAGEN:GAIN:16:34466336-34757885N

[0340] <dup>55PASS SVLEN=291550; SVTYPE=CNV; END=34757885;

[0341] REFLEN=291550GT:SM:CN:BC:PE. / 1:1.43528:3:259:2,18

[0342] -16 34757886DRAGEN:REF:16:34757886-35017793N.58

[0343] PASS END=35017793;REFLEN=259908GT:SM:CN:BC:PE

[0344] . / .:0.931997:2:218:18,19

[0345] In this example, there is no Fig.17 The 'B' area in the corresponding 'DEL' call.

[0346] The final calls that can be made based on the above output are presented below, with CNV calls with adjusted positions and links to BND calls, and SVs are represented as BNDs with links to the appropriate CNV calls (italics emphasize significant properties for linking purposes):

[0347] -16 34173661DRAGEN:REF:16:34173661-34458728N.59

[0348] PASS END=34458728;REFLEN=285068GT:SM:CN:BC:PE

[0349] . / .:0.941707:2:226:20,1

[0350] -16 34466335DRAGEN:GAIN:16:34466336-34757885N

[0351] <dup>55PASS SVLEN=291550;SVTYPE=CNV;END=34757885;REFLEN=291550;RIGHT_BND=MantaBND:151955:0:1:0:0:0:1

[0352] GT:SM:CN:BC:PE. / 1:1.43528:3:259:2,18

[0353] -16 34757886DRAGEN:REF:16:34757886-35017793N.58

[0354] PASS END=35017793;REFLEN=259908GT:SM:CN:BC:PE

[0355] . / .:0.931997:2:218:18,19

[0356] -16 34392108MantaBND:151955:0:1:0:0:0:0C

[0357] C]16:34757737]526PASS SVTYPE=BND;

[0358] MATEID=MantaBND:151955:0:1:0:0:0:1;CIPOS=0,3;HOMLEN=3;

[0359] HOMSEQ=TGG;BND_DEPTH=25;MATE_BND_DEPTH=39

[0360] GT:FT:GQ:PL:PR:SR 0 / 1:PASS:526:576,0,659:31,12:34,9

[0361] -16 34757734MantaBND:151955:0:1:0:0:0:1T

[0362] T]16:34392111]526PASS SVTYPE=BND;

[0363] MATEID=MantaBND:151955:0:1:0:0:0:0;CIPOS=0,3;HOMLEN=3;

[0364] HOMSEQ=CCA;BND_DEPTH=39;MATE_BND_DEPTH=25;

[0365] RIGHT_BND_OF=DRAGEN:GAIN:16:34466336-34757885

[0366] GT:FT:GQ:PL:PR:SR 0 / 1:PASS:526:576,0,659:31,12:34,9

[0367] It should be noted that in the above example, there is no BND (_OF) for the candidate boundary; only one end of the GAIN (the second record above) has a BND. There is also no (short) CNV for one of the changes expected based on the broken ends; only one end of the BND has a BND_OF (the fifth record above). When there is a copy number change between x][x+1, if there is a broken end corresponding to one side of the change point, this can be annotated on both CNV fragments (i.e., the RIGHT_BND for the fragment ending at x and the LEFT_BND for the fragment starting at x+1). In other words, if an event is adjusted at one end, say position x], the adjacent event at [x+1 may also be adjusted and annotated, for example by performing a pass of all records in a later step to ensure consistency.

[0368] Figures 18A-18C and their corresponding descriptions provide further examples in which CNV calls for SV notifications are provided according to various aspects described herein.

[0369] Fig.18A A deletion-based example is presented where copy number loss and SV breaks do not support DEL events. The initial CNV record is as follows:

[0370] -chr1 105095597DRAGEN:LOSS:chr5:105095598-105167360N <del>53

[0371] PASS SVLEN=-71763; SVTYPE=CNV; END=105167360; REFLEN=71763

[0372] GT:SM:CN:BC:PE 0 / 1:0.47692:1:66:16,27

[0373] The initial SV records are as follows:

[0374] -chr1 105095607MantaBND:57476:0:2:0:0:0:0G G]chr2:105167960]17

[0375] MinQUAL SVTYPE=BND; MATEID=MantaBND:57476:0:2:0:0:0:1;

[0376] CIPOS=0,2; HOMLEN=2; HOMSEQ=GT; BND_DEPTH=43;

[0377] MATE_BND_DEPTH=31GT:FT:GQ:PL:PR:SR

[0378] 0 / 1:PASS:17:67,0,999:49,4:29,5

[0379] -chr2 105167960MantaBND:57476:0:2:0:0:0:1A A]chr1:110417996]17

[0380] MinQUAL SVTYPE=BND; MATEID=MantaBND:57476:0:2:0:0:0:0;

[0381] CIPOS=0,2; HOMLEN=2; HOMSEQ=TG; BND_DEPTH=31;

[0382] MATE_BND_DEPTH=43GT:FT:GQ:PL:PR:SR

[0383] 0 / 1:PASS:17:67,0,999:49,4:29,5

[0384] -chr1 105167460MantaBND:1234:0:2:0:0:0:0T[chr2:105130000[T 17

[0385] MinQUAL SVTYPE=BND;MATEID=MantaBND:1234:0:2:0:0:0:1;

[0386] CIPOS=0,2;HOMLEN=2;HOMSEQ=GT;BND_DEPTH=43;

[0387] MATE_BND_DEPTH=31GT:FT:GQ:PL:PR:SR

[0388] 0 / 1:PASS:17:67,0,999:49,4:29,5

[0389] -chr2 105130000MantaBND:1234:0:2:0:0:0:1C[chr1:105167460[C 17

[0390] MinQUAL SVTYPE=BND;MATEID=MantaBND:1234:0:2:0:0:0:0;

[0391] CIPOS=0,2;HOMLEN=2;HOMSEQ=TG;BND_DEPTH=31;

[0392] MATE_BND_DEPTH=43GT:FT:GQ:PL:PR:SR

[0393] 0 / 1:PASS:17:67,0,999:49,4:29,5

[0394] An exemplary record (indicating a CNV call for SV notification) that may be generated and output based on the above and in accordance with various aspects described herein is presented below:

[0395] -chr1 105095607DRAGEN:LOSS:chr5:105095608-105167460N <del>53

[0396] PASS SVLEN=-71763;SVTYPE=CNV;END=105167460;REFLEN=71763;

[0397] SVCLAIM=DJ;LEFT_BND=MantaBND:57476:0:2:0:0:0;

[0398] RIGHT_BND=MantaBND:1234:0:2:0:0:0:0GT:SM:CN:BC:PE

[0399] 0 / 1:0.47692:1:66:16,27

[0400] -chr1 105095607MantaBND:57476:0:2:0:0:0:0G G]chr2:105167960]17

[0401] MinQUAL SVTYPE=BND;MATEID=MantaBND:57476:0:2:0:0:0:1;

[0402] CIPOS=0,2;HOMLEN=2;HOMSEQ=GT;BND_DEPTH=43;

[0403] MATE_BND_DEPTH=31;LEFT_BND_OF=DRAGEN:LOSS:chr5:105095608-

[0404] 105167460GT:FT:GQ:PL:PR:SR 0 / 1:PASS:17:67,0,999:49,4:29,5

[0405] -chr2 105167960MantaBND:57476:0:2:0:0:0:1A A]chr1:110417996]17

[0406] MinQUAL SVTYPE=BND;MATEID=MantaBND:57476:0:2:0:0:0:0;

[0407] CIPOS=0,2;HOMLEN=2;HOMSEQ=TG;BND_DEPTH=31;

[0408] MATE_BND_DEPTH=43GT:FT:GQ:PL:PR:SR

[0409] 0 / 1:PASS:17:67,0,999:49,4:29,5

[0410] -chr1 105167460MantaBND:1234:0:2:0:0:0:0T[chr2:105130000[T 17

[0411] MinQUAL SVTYPE=BND;MATEID=MantaBND:1234:0:2:0:0:0:1;

[0412] CIPOS=0,2;HOMLEN=2;HOMSEQ=GT;BND_DEPTH=43;

[0413] MATE_BND_DEPTH = 31;

[0414] RIGHT_BND_OF=DRAGEN:LOSS:chr5:105095608-105167460

[0415] GT:FT:GQ:PL:PR:SR 0 / 1:PASS:17:67,0,999:49,49,5

[0416] -chr2 105130000MantaBND:1234:0:2:0:0:0:1C[chr1:105167460[C 17

[0417] MinQUAL SVTYPE=BND; MATEID=MantaBND:1234:0:2:0:0:0:0;

[0418] CIPOS=0,2;HOMLEN=2;HOMSEQ=TG;BND_DEPTH=31;

[0419] MATE_BND_DEPTH=43GT:FT:GQ:PL:PR:SR

[0420] 0 / 1:PASS:17:67,0,999:49,4:29,5

[0421] In the above example, "LEFT_BND" and "RIGHT_BND" link records from CNV to BND, and "LEFT_BND_OF" and "RIGHT_BND_OF" link records from BND to CNV.

[0422] Fig.18B An example based on a repeat is presented, where the repeat is supported by both CNV and tandup ends. The initial SV record is as follows:

[0423] -chr8 46613324MantaDUP:TANDEM:125619:0:1:0:0:0G

[0424] <dup:tandem>407PASS END=46633279;SVTYPE=DUP;

[0425] SVLEN=19955; CIPOS=0,9; CIEND=0,9; HOMLEN=9;

[0426] HOMSEQ=ATGAGATAC GT:FT:GQ:PL:PR:SR

[0427] 0 / 1:PASS:407:457,0,999:42,11:39,7

[0428] The initial CNV record is as follows:

[0429] -chr8 46495807DRAGEN:REF:chr8:46495807-46612106N.48PASS

[0430] END=46612106; REFLEN=116300GT:SM:CN:BC:PE. / .:0.9589:2:98:15,3

[0431] -chr8 46614258DRAGEN:GAIN:chr8:46614259-46629419N <dup>30

[0432] PASS SVLEN=15161; SVTYPE=CNV; END=46629419; REFLEN=15161

[0433] GT:SM:CN:BC:PE. / 1:1.45628:3:14:1,2

[0434] -chr8 46634456DRAGEN:REF:chr8:46634456-60677768N.103PASS

[0435] END=60677768; REFLEN=14043313GT:SM:CN:BC:PE

[0436] . / .:0.995336:2:12220:0,1

[0437] Note that there is a gap between the flanking REF region and the DUP. When a CNV boundary is next to a gap in (good) bin coverage, it may be necessary to relax the matching criteria (e.g., proximity of the endpoints) in this case.

[0438] An exemplary record (indicating a CNV call for SV notification) that may be generated and output based on the above and in accordance with various aspects described herein is presented below:

[0439] -chr8 46613324MantaDUP:TANDEM:125619:0:1:0:0:0G

[0440] <dup:tandem>407PASS END=46633279;SVTYPE=DUP;

[0441] SVLEN=19955; CIPOS=0,9; CIEND=0,9; HOMLEN=9;

[0442] HOMSEQ=ATGAGATAC GT:FT:GQ:PL:PR:SR:SM:CN:BC:PE

[0443] 0 / 1:PASS:407:457,0,999:42,11:39,7:1.45628:3:14:1,2

[0444] Fig.18C An example of a dispersed duplication (a second non-tandem copy in the genome) is depicted. The initial SV record is as follows:

[0445] -chr3 91357394MantaBND:30982:0:1:0:0:0:0T[chr8:123907[746PASS

[0446] SVTYPE=BND; MATEID=MantaBND:30982:0:1:0:0:0:1; CIPOS=0,2;

[0447] HOMLEN=2; HOMSEQ=GT; BND_DEPTH=53; MATE_BND_DEPTH=21

[0448] GT:FT:GQ:PL:PR:SR 0 / 1:PASS:746:796,0,830:37,4:31,23

[0449] -chr8 123907MantaBND:30982:0:1:0:0:0:1A]chr3:51009231]A 746PASS

[0450] SVTYPE=BND; MATEID=MantaBND:30982:0:1:0:0:0:0; CIPOS=0,2;

[0451] HOMLEN=2; HOMSEQ=GT; BND_DEPTH=21; MATE_BND_DEPTH=53

[0452] GT:FT:GQ:PL:PR:SR 0 / 1:PASS:746:796,0,830:37,4:31,23

[0453] -chr3 91357396MantaBND:43623:0:1:0:0:0:0A]chr8:189442[GA 103PASS

[0454] SVTYPE = BND; MATEID = MantaBND:43623:0:1:0:0:0:1; SVINSLEN = 1;

[0455] SVINSSEQ = G; BND_DEPTH = 42; MATE_BND_DEPTH = 33

[0456] GT:FT:GQ:PL:PR:SR 0 / 1:PASS:103:153,0,936:36,0:5,7

[0457] -chr8 189442MantaBND:43623:0:1:0:0:0:1C CG[chr3:91357396[103PASS

[0458] SVTYPE = BND; MATEID = MantaBND:43623:0:1:0:0:0:0; SVINSLEN = 1;

[0459] SVINSSEQ = G; BND_DEPTH = 33; MATE_BND_DEPTH = 42

[0460] GT:FT:GQ:PL:PR:SR 0 / 1:PASS:103:153,0,936:36,0:35,7

[0461] The initial CNV records are as follows:

[0462] -chr8 124109DRAGEN:GAIN:chr8:124110 - 189632N <dup>1000PASS

[0463] SVLEN=65533; SVTYPE=CNV; END=189632; REFLEN=65533

[0464] GT:SM:CN:BC:PE. / 1:1.45628:3:57:39,41

[0465] An exemplary record (indicating a CNV call for SV notification) that may be generated and output based on the above and in accordance with various aspects described herein is presented below:

[0466] -chr8 123907DRAGEN:GAIN:chr8:123907-189442N <dup>1000PASS

[0467] SVLEN65535SVTYPECNVEND189442REFLEN65535.

[0468] LEFT_BND_MantaBND:30982:0:1:0:0:0:1;

[0469] RIGHT_BND_BlanketBND:43623:0:1:0:0:0:1GT:SM:CN:BC:PE

[0470] . / 1:1.45628:3:57:39.41

[0471] -chr3 91357394BlanketBND:30982:0:1:0:0:0:0T T[chr8:123907[746PASS

[0472] SVTYPE:BND:MATEID:BlanketBND:30982:0:1:0:0:0:1:CIPOS:0,2;

[0473] HOMLEN02HOMSEQGT:BND_DEPTH153MATE_BND_DEPTH21;

[0474] LEFT_BND_OFDRAGON:GAIN:chr8:123907-

[0475] 189442GT:FT:GQ:PL:PR:SR 0 / 1:PASS:746:796.0.830:37.4:31.23

[0476] -chr8 123907BlanketBND:30982:0:1:0:0:0:1A]chr3:51009231]A 746PASS

[0477] SVTYPE:BND:MATEID:BlanketBND:30982:0:1:0:0:0:0:CIPOS:0,2;

[0478] HOMLEN02HOMSEQGT:BND_DEPTH21:MATE_BND_DEPTH53R

[0479] LEFT_BAND_OFF_DRAGON:GAIN:chr8:123907-189442

[0480] GT:FT:GQ:PL:PR:SR 0 / 1:PASS:746:796,0,830:37,4:31,23

[0481] -mchr3 91357396MantaBND:43623:0:1:0:0:0:0A]chr8:189442[GA 103

[0482] PASS SVTYPE=BND;MATEID=MantaBND:43623:0:1:0:0:0:1;

[0483] SVINSLEN=1;SVINSSEQ=G;BND_DEPTH=42;

[0484] MATE_BND_DEPTH=33;

[0485] RIGHT_BND_OF=DRAGEN:GAIN:chr8:123907-189442

[0486] GT:FT:GQ:PL:PR:SR 0 / 1:PASS:103:153,0,936:36,0:35,7

[0487] -chr8 189442MantaBND:43623:0:1:0:0:0:1C CG[chr3:91357396[103PASS

[0488] SVTYPE=BND;MATEID=MantaBND:43623:0:1:0:0:0:0;SVINSLEN=1;

[0489] SVINSSEQ=G;BND_DEPTH=33;M ATE_BND_DEPTH=42;

[0490] RIGHT_BND_OF=DRAGEN:GAIN:chr8:123907-189442

[0491] GT:FT:GQ:PL:PR:SR 0 / 1:PASS:103:153,0,936:36,0:35,7

[0492] Figure 19A-19B Described is an exemplary process for improved calling of copy number variants in genomic sequences according to various aspects described herein. In one or more examples, the process can be performed by a processor or processing circuit system of one or more computers / computer systems such as those described herein, which can include, for example, one or more computer systems that provide / execute genome analysis software.

[0493] Initial reference Fig.19A , the process obtains (1902) genetic sequence variant data including records indicating SVs in a genomic sequence and records indicating CNVs. The method also determines (1904) SV-notified CNV calls as updated versions of the initial CNVs based on the initial CNVs indicated in the genetic sequence variant data and at least one initial SV indicated in the genetic sequence variant data. The determination uses information from the at least one initial SV call to determine the starting breakpoint position and the ending breakpoint position of the SV-notified CNV call. At least one of the starting breakpoint position and the ending breakpoint position notified by the at least one initial SV is updated compared to the corresponding starting breakpoint position and / or ending breakpoint position of the initial CNV.

[0494] In an example, the initial CNV and the remaining CNVs indicated by the record are provided by a CNV calling component of the genome analysis software. The genome analysis software may have a filtering component configured to filter out CNVs with a confidence level less than a threshold confidence level, and the CNV calling component may provide a confidence level for the initial CNV that is less than the threshold confidence level (i.e., the software will typically filter out this confidence level). However, the CNV call of the SV notification may be provided with a confidence level higher than the threshold confidence level, so that the filtering component does not filter out the CNV call of the SV notification.

[0495] In the example, the breakpoint resolution of the breakpoint of the initial CNV is equal to the window size of n base pairs, where 2000>n>200, such that the position of the breakpoint of the initial CNV is an approximate position identified based on the window of length n, where the breakpoint of the initial CNV is determined to be within the window. In the example, the breakpoint resolution of the CNV call of the SV notification is 1 base pair.

[0496] The determination (1904) may be performed as part of a process for determining CNV calls for one or more SV notifications based on the records obtained at 1902. An exemplary such process is performed by Fig.19B express. Fig.19B The process runs through one or more CNV sets and one or more SV sets, performs pairwise comparisons of each CNV of the set with each SV of the set and applies rules for determining whether to modify the breakpoint of the CNV based on the SV data. Fig.19B The process begins by entering a first loop that loops through each CNV in the CNV set. Entry into the loop begins by obtaining (1910) the next CNV in the set to be processed. The process then enters a second loop that loops through each SV in the SV set by obtaining (1912) the next SV. The process then performs (1914) a pairwise comparison of the CNV with the SV. The pairwise comparison of the CNV with the SV includes a breakpoint comparison that each compares a corresponding first breakpoint position of the CNV with a corresponding second breakpoint position of the SV, and checks / evaluates a pass / fail rule based on the corresponding first breakpoint position proposed to be modified to the corresponding second breakpoint position to provide a proposed modified CNV (a modified version of the CNV being processed). The breakpoint comparison may include: (i) comparing the starting breakpoint position of the CNV with the starting and / or ending breakpoint position of the SV; and / or (ii) comparing the ending breakpoint position of the CNV with the starting and / or ending breakpoint position of the SV. The rules may include any desired rules for indicating situations when it may be appropriate to modify the breakpoint position of a CNV to that of an SV. Exemplary such rules may include, but are not limited to, rules requiring at least some positional overlap between the SV and the proposed modified CNV, rules requiring compatibility of the orientation of the SV and the proposed modified CNV, and / or rules requiring that the associated breakpoints of the SV and the proposed modified CNV be within a threshold distance. The pass at this point is a provisional pass, as one or more additional rules may be checked during downstream processing (described below with respect to Fig.19B aspects discussed in 1920).

[0497] After performing the pairwise comparison at 1914, the process continues by determining (1916) whether there is any next SV in the set to be compared with the CNV, i.e., whether there is any SV in the set that has not undergone comparison with the CNV. If so (1916, Y), the process iterates in a second loop by returning to 1912 to obtain the next SV and continuing to perform (1914) pairwise comparisons for the CNV and the next SV. The loop (1912, 1914, 1916) repeats until all SVs have been processed for the CNV. At this point, there is no next SV to be compared (1916, N), and the process continues by determining (1918) whether there is any next CNV in the CNV set to be processed, i.e., whether there is any CNV in the set that has not undergone comparison processing with an SV in the SV set. If so (1918, Y), the process iterates in the first loop by returning to 1910 to obtain the next CNV, and then enters the second loop again by obtaining (1912) the next SV to be processed.

[0498] As can be seen, the first loop iterates over the CNV set. Once all CNVs have been processed in this manner, there is no next CNV to process (1918, N). At this point, there may be one or more passed comparison results. Each pass result suggests that the corresponding breakpoint position of the CNV be modified to the corresponding breakpoint position of the SV. At this point, the process continues by checking the pass result for any applicable additional rules (1920). As an example, an additional rule may be a check for uniqueness, which requires that any breakpoint of the CNV suggested for modification matches at most one SV breakpoint of the SV of the set in order to pass. Violation of this rule or any other additional rule checked at 1920 may cause the initial pass result to fail instead. Otherwise, the pass result will notify the breakpoint modification to modify the initial CNV call data of the obtained record in order to process the CNV call of one or more SV notifications.

[0499] In some examples, determining the CNV call of the SV notification as an updated version of the initial CNV includes modifying a record of the initial CNV to produce a record of the CNV call of the SV notification, wherein the modification changes the starting and / or ending breakpoint positions of the initial CNV as indicated in the record of the initial CNV to the updated breakpoint positions determined by the SV notification of the set compared to the initial CNV (in Fig.19B As part of this, the process may also appropriately update the length of the CNV (indicated in the record of the initial CNV) and the quality score in the record of the initial CNV to generate data for the CNV call of the SV notification. In the example, the record of the initial CNV (the record that is modified to match the SV data) is a copy of the original record of the initial CNV. In the example, the genetic sequence variant data file obtained at 1902 is part of one or more genetic sequence variant data files, and the original record of the initial CNV is retained and output in at least one of those genetic sequence variant data files.

[0500] In some examples, the length of the SV-notified CNV call is less than or equal to 20,000 base pairs. In some examples, the length of the SV-notified CNV call is less than or equal to 10,000 base pairs. In some examples, the length of the SV-notified CNV call is less than the length of the initial CNV. In some examples, the length of the initial CNV is less than or equal to 20,000 base pairs.

[0501] Back to Fig.19A , where SV-informed CNV calls are determined (1904), the process continues by writing (1906) the determined SV-informed CNV calls as one or more records in the genetic sequence variant data file. It should be noted that Fig.18A The procedure focuses on the CNV call for one SV notification, but in the example, it can be performed for CNV calls for multiple SV notifications. Fig.18A of determining and writing.

[0502] The processes described herein may be performed by one or more computer systems, individually or collectively, such as one or more computer systems executing genome analysis software to perform various aspects described herein. Fig. 20 Depicted are examples of computer systems and associated devices that incorporate and / or use the various aspects described herein. Computer systems may also be referred to herein as data processing devices / systems, computing devices / systems / nodes, or simply computers. Computer systems may be based on one or more of a variety of system architectures and / or instruction set architectures, such as those provided by Intel Corporation (Santa Clara, California, USA) as examples. Fig. 20 A computer system 2000 communicating with an external device 2012 is shown. The computer system 2000 includes one or more processors 2002, such as a central processing unit (CPU). The processor may include functional components used in the execution of instructions, such as obtaining program instructions from a location such as a cache or main memory, decoding program instructions and executing program instructions, accessing a memory for instruction execution, and writing the result of the instruction executed. The processor 2002 may also include registers used by one or more functional components in the functional components. The computer system 2000 also includes a memory 2004, an input / output (I / O) device 2008, and an I / O interface 2010, which may be coupled to the processor 2002 and to each other via one or more buses and / or other connections. The bus connection represents any one or more bus structures of several types of bus structures, including a memory bus or a memory controller, a peripheral bus, an accelerated graphics port, and a processor or local bus using any bus architecture in a variety of bus architectures. By way of example and not limitation, such architectures include Industry Standard Architecture (ISA), Micro Channel Architecture (MCA), Enhanced ISA (EISA), Video Electronics Standards Association (VESA) local bus, and Peripheral Component Interconnect (PCI).

[0503] The memory 2004 may be or include a main or system memory (e.g., random access memory) used in the execution of program instructions, a storage device such as a hard drive, a flash medium, or an optical medium as examples, and / or a cache memory as examples. The memory 2004 may include, for example, a cache, such as a shared cache, which may be coupled to a local cache of the processor 2002 (examples include an L1 cache, an L2 cache, etc.). Additionally, the memory 2004 may be or include at least one computer program product having a set (e.g., at least one) of program modules, instructions, codes, etc., which are configured to perform the functions of the embodiments described herein when executed by one or more processors.

[0504] The memory 2004 may store an operating system 2005 and other computer programs 2006, such as one or more computer programs / programs executed to perform the various aspects described herein. Specifically, the program / application may include computer-readable program instructions that may be configured to perform the functions of the embodiments of the various aspects described herein.

[0505] Examples of I / O devices 2008 include, but are not limited to, microphones, speakers, global positioning system (GPS) devices, cameras, lights, accelerometers, gyroscopes, magnetometers, sensor devices configured to sense light, proximity, heart rate, body temperature and / or ambient temperature, blood pressure and / or skin resistance, and activity monitors. I / O devices can be incorporated into the computer system as shown, although in some embodiments, I / O devices can be viewed as external devices (2012) coupled to the computer system via one or more I / O interfaces 2010.

[0506] The computer system 2000 can communicate with one or more external devices 2012 through one or more I / O interfaces 2010. Exemplary external devices include keyboards, pointing devices, displays, and / or any other device that enables a user to interact with the computer system 2000. Other exemplary external devices include any device that enables the computer system 2000 to communicate with one or more other computing systems or peripherals such as a printer. A network interface / adapter is an exemplary I / O interface that enables the computer system 2000 to communicate with one or more networks such as a local area network (LAN), a general wide area network (WAN), and / or a public network (e.g., the Internet), thereby providing communication with other computing devices or systems, storage devices, etc. Ethernet-based interfaces (such as Wi-Fi) and The adapter is merely an example of a currently available type of network adapter used in computer systems (BLUETOOTH is a registered trademark of Bluetooth SIG, Inc., Kirkland, Washington, USA).

[0507] Communication between the I / O interface 2010 and the external device 2012 may occur across a wired and / or wireless communication link 2011, such as an Ethernet-based wired or wireless connection. Exemplary wireless connections include cellular, Wi-Fi, Near field or other types of proximity based wireless connections. More generally, the communication link 2011 may be any suitable wireless and / or wired communication link for transmitting data.

[0508] Specific external devices 2012 may include one or more data storage devices that may store one or more programs, one or more computer-readable program instructions and / or data, etc. Computer system 2000 may include and / or be coupled to and communicate with removable / non-removable, volatile / non-volatile computer system storage media (e.g., as an external device to the computer system). For example, the computer system may include and / or be coupled to a non-removable, non-volatile magnetic medium (commonly referred to as a "hard drive"), a disk drive for reading from and writing to a removable, non-volatile disk (e.g., a "floppy disk"), and / or an optical drive for reading from or writing to a removable, non-volatile optical disk such as a CD-ROM, DVD-ROM, or other optical media.

[0509] The computer system 2000 can operate with numerous other general or special computing system environments or configurations. The computer system 2000 can take any of a variety of forms, well-known examples of which include, but are not limited to, personal computer (PC) systems, server computer systems such as message servers, thin clients, fat clients, workstations, laptop computers, handheld devices, mobile devices / computers such as smart phones, tablet computers and wearable devices, multiprocessor systems, microprocessor-based systems, telephony devices, network devices (such as edge devices), virtualization devices, storage controllers, set-top boxes, programmable consumer electronics, network PCs, small computer systems, large computer systems, and distributed cloud computing environments including any of the above systems or devices, etc.

[0510] Aspects of the present invention may be systems, methods, and / or computer program products, any of which may be configured to perform or facilitate the aspects described herein.

[0511] In some embodiments, various aspects of the present invention can take the form of a computer program product, which can be embodied as a computer-readable medium. A computer-readable medium can be a tangible storage device / medium on which a computer-readable program code / instruction is stored. Exemplary computer-readable media include, but are not limited to, electronic, magnetic, optical or semiconductor storage devices or systems or any combination of the foregoing. Exemplary embodiments of computer-readable media include hard disk drives or other mass storage devices, electrical connections with wires, random access memories (RAMs), read-only memories (ROMs), erasable programmable read-only memories such as EPROMs or flash memories, optical fibers, portable computer disks / floppy disks such as compact disk read-only memories (CD-ROMs) or digital versatile disks (DVDs), optical storage devices, magnetic storage devices or any combination of the foregoing. Computer-readable media can be read by a processor, a processing unit, etc. to obtain data (e.g., instructions) from the medium for execution. In a specific example, a computer program product is or includes one or more computer-readable media, which include / store computer-readable program codes to provide and facilitate one or more aspects described herein.

[0512] As noted, the program instructions included or stored in / on a computer readable medium can be obtained and executed by any of the various suitable components such as a processor of a computer system, so that the computer system performs and operates in a particular manner. Such program instructions for performing operations to perform, realize or promote various aspects described herein can be written in any desired programming language, or compiled from the code written in any desired programming language. In some embodiments, such programming languages ​​include object-oriented and / or procedural programming languages ​​such as C, C++, C#, Java, etc.

[0513] Program code may include obtaining one or more program instructions for execution by one or more processors. Computer program instructions may be provided to one or more processors of, for example, one or more computer systems to produce a machine so that the program instructions perform, implement or facilitate various aspects of the present invention when executed by one or more processors, such as the actions or functions described in the flowcharts and / or block diagrams described herein. Therefore, in some embodiments, each frame or combination of frames of the flowchart illustrations and / or block diagrams depicted and described herein may be implemented by computer program instructions.

[0514] While various implementations are described above, these are merely examples.

[0515] The terms used herein are for the purpose of describing specific embodiments only and are not intended to be limiting. As used herein, unless the context clearly indicates otherwise, the singular forms "a", "an", and "the" are intended to include the plural forms as well. It should also be understood that when used in this specification, the terms "include" and / or "comprise" specify the presence of the features, integers, steps, operations, elements, and / or parts, but do not exclude the presence or addition of one or more other features, integers, steps, operations, elements, parts, and / or groups thereof.

[0516] The corresponding structures, materials, actions, and equivalents of all means or steps plus functional elements in the following claims, if any, are intended to include any structure, material, or action for performing the function in combination with other claimed elements specifically claimed. The description of one or more embodiments has been presented for the purposes of illustration and description, but is not intended to be exhaustive or limited to the disclosed forms. Many modifications and variations will be apparent to those of ordinary skill in the art. The embodiments are selected and described in order to best explain the various aspects and practical applications, and to enable others of ordinary skill in the art to understand the various embodiments with various modifications suitable for the specific purposes contemplated.< / dup> < / dup> < / dup:tandem> < / dup> < / dup:tandem> < / del> < / del> < / dup> < / dup> < / del> < / dup:tandem> < / dup> < / dup> < / dup> < / dup> < / dup> < / dup> < / dup> < / dup> < / del> < / dup:tandem> < / del> < / del> < / del> < / del> < / del> < / del> < / del>

Claims

1. A computer-implemented method for improved calling of copy number variants in a genomic sequence, the method comprising: obtaining gene sequence variant data, the gene sequence variant data comprising a record indicating at least one structural variant (SV) in the genomic sequence and a record indicating at least one copy number variant (CNV); determining, based on an initial CNV indicated in the genetic sequence variant data and at least one initial SV indicated in the genetic sequence variant data, an SV-informed CNV call to be an updated version of the initial CNV, wherein the determining uses information from the at least one initial SV to determine a start breakpoint position and an end breakpoint position of the SV-informed CNV call, at least one of the start breakpoint position and the end breakpoint position being updated compared to a corresponding start breakpoint position and / or end breakpoint position of the initial CNV, as informed by the at least one initial SV; as well as The CNV calls informed by the determined SVs are written as one or more records in a genetic sequence variant data file.

2. The method according to claim 1, wherein the initial CNV is provided by a CNV calling component of a genomic analysis software, wherein the genomic analysis software has a filtering component, the filtering component is configured to filter out CNVs with a confidence level less than a threshold confidence level, wherein the CNV calling component provides a confidence level of the initial CNV less than the threshold confidence level, and wherein the CNV calls of the SV notification are provided with a confidence level higher than the threshold confidence level, so that the filtering component does not filter out the CNV calls of the SV notification.

3. The method of claim 1 , wherein the breakpoint resolution of the breakpoint of the initial CNV is equal to a window size of n base pairs, wherein 2000>n>200, such that the position of the breakpoint of the initial CNV is an approximate position identified based on a window of length n, wherein the breakpoint of the initial CNV is determined to be within the window, and wherein the breakpoint resolution of the CNV call of the SV notification is 1 base pair.

4. The method of claim 1, wherein the determining the CNV call of the SV notification as an updated version of the initial CNV comprises: modifying the record of the initial CNV to produce a record of the CNV call of the SV notification, the modification changing the start and / or end breakpoint positions of the initial CNV as indicated in the record of the initial CNV to updated breakpoint positions determined by the at least one initial SV notification; and further updating the length of the CNV indicated in the record of the initial CNV and the quality score in the record of the initial CNV to provide the record of the SV-informed CNV call.

5. A method according to claim 4, wherein the record of the initial CNV is a copy of the original record of the initial CNV, wherein the gene sequence variant data file is part of one or more gene sequence variant data files, and wherein the original record of the initial CNV is retained and output in at least one of the one or more gene sequence variant data files.

6. The method of claim 1, 2, 3, 4 or 5, wherein said determining said SV-informed CNV call comprises, for each of said at least one initial SV, performing a pairwise comparison of said initial CNV with said initial SV.

7. The method of claim 6, wherein the pairwise comparisons of the initial CNV to the initial SV comprise one or more breakpoint comparisons, each of the one or more breakpoint comparisons comparing the corresponding first breakpoint position to the corresponding second breakpoint position to provide a proposed modified CNV by evaluating one or more pass / fail rules based on the corresponding first breakpoint position of the initial CNV proposed to be modified to the corresponding second breakpoint position of the initial SV.

8. The method of claim 7, wherein the one or more breakpoint comparisons include at least one of: comparing the starting breakpoint position of the initial CNV to at least one of the starting breakpoint position or the ending breakpoint position of the initial SV; or The ending breakpoint position of the initial CNV is compared to at least one of the starting breakpoint position or the ending breakpoint position of the initial SV.

9. The method of claim 7, wherein the one or more rules include at least one of the following: a rule requiring overlap of at least some positions between the initial SV and the proposed modified CNV; compatibility rules for the orientations of the initial SV and the proposed modified CNV; A rule that the associated breakpoints of the initial SV and the proposed modified CNV are within a threshold distance; or A uniqueness rule requiring that the breakpoint of the initial CNV proposed for modification matches at most one SV breakpoint of the at least one initial SV.

10. The method of claim 1, 2, 3, 4 or 5, wherein the SV-informed CNV call is less than or equal to 20,000 base pairs in length.

11. The method of claim 1, 2, 3, 4 or 5, wherein the SV-informed CNV call is less than or equal to 10,000 base pairs in length.

12. The method of claim 1, 2, 3, 4 or 5, wherein the length of the CNV call of the SV notification is less than the length of the initial CNV.

13. The method of claim 12, wherein the initial CNV is less than or equal to 20,000 base pairs in length.

14. A computer system, comprising: Memory; and a processor in communication with the memory, wherein the computer system is configured to perform a method for improved calling of copy number variants in a genomic sequence, the method comprising: obtaining gene sequence variant data, the gene sequence variant data comprising a record indicating at least one structural variant (SV) in the genomic sequence and a record indicating at least one copy number variant (CNV); determining, based on an initial CNV indicated in the genetic sequence variant data and at least one initial SV indicated in the genetic sequence variant data, an SV-informed CNV call to be an updated version of the initial CNV, wherein the determining uses information from the at least one initial SV to determine a start breakpoint position and an end breakpoint position of the SV-informed CNV call, at least one of the start breakpoint position and the end breakpoint position being updated compared to a corresponding start breakpoint position and / or end breakpoint position of the initial CNV, informed by the at least one initial SV; and The CNV calls informed by the determined SVs are written as one or more records in a genetic sequence variant data file.

15. A computer system according to claim 14, wherein the initial CNV is provided by a CNV calling component of a genome analysis software, wherein the genome analysis software has a filtering component, the filtering component is configured to filter out CNVs with a confidence level less than a threshold confidence level, wherein the CNV calling component provides a confidence level of the initial CNV less than the threshold confidence level, and wherein the CNV call of the SV notification is provided with a confidence level higher than the threshold confidence level, so that the filtering component does not filter out the CNV call of the SV notification.

16. The computer system of claim 14, wherein the breakpoint resolution of the breakpoint of the initial CNV is equal to a window size of n base pairs, wherein 2000>n>200, such that the position of the breakpoint of the initial CNV is an approximate position identified based on a window of length n, wherein the breakpoint of the initial CNV is determined to be within the window, and wherein the breakpoint resolution of the CNV call of the SV notification is 1 base pair.

17. The computer system of claim 14, wherein the determining the CNV call of the SV notification as an updated version of the initial CNV comprises: modifying the record of the initial CNV to produce a record of the CNV call of the SV notification, the modification changing the start and / or end breakpoint positions of the initial CNV as indicated in the record of the initial CNV to updated breakpoint positions determined by the at least one initial SV notification; and further updating the length of the CNV indicated in the record of the initial CNV and the quality score in the record of the initial CNV to provide the record of the SV-informed CNV call.

18. A computer system according to claim 17, wherein the record of the initial CNV is a copy of the original record of the initial CNV, wherein the gene sequence variant data file is part of one or more gene sequence variant data files, and wherein the original record of the initial CNV is retained and output in at least one of the one or more gene sequence variant data files.

19. The computer system of claim 14, 15, 15, 17 or 18, wherein said determining said SV-informed CNV call comprises, for each of said at least one initial SV, performing a pairwise comparison of said initial CNV with said initial SV.

20. The computer system of claim 19, wherein the pairwise comparisons of the initial CNV to the initial SV include one or more breakpoint comparisons that each compare the corresponding first breakpoint position to the corresponding second breakpoint position to provide a proposed modified CNV by evaluating one or more pass / fail rules based on the corresponding first breakpoint position of the initial CNV proposed to be modified to the corresponding second breakpoint position of the initial SV.

21. The computer system of claim 20, wherein the one or more breakpoint comparisons include at least one of: comparing the starting breakpoint position of the initial CNV to at least one of the starting breakpoint position or the ending breakpoint position of the initial SV; or The ending breakpoint position of the initial CNV is compared to at least one of the starting breakpoint position or the ending breakpoint position of the initial SV.

22. The computer system of claim 20, wherein the one or more rules include at least one of the following: a rule requiring overlap of at least some positions between the initial SV and the proposed modified CNV; compatibility rules for the orientations of the initial SV and the proposed modified CNV; A rule that the associated breakpoints of the initial SV and the proposed modified CNV are within a threshold distance; or A uniqueness rule requiring that the breakpoint of the initial CNV proposed for modification matches at most one SV breakpoint of the at least one initial SV.

23. The computer system of claim 14, 15, 16, 17 or 18, wherein the SV-informed CNV calls are less than or equal to 20,000 base pairs in length.

24. The computer system of claim 14, 15, 16, 17 or 18, wherein the SV-informed CNV calls are less than or equal to 10,000 base pairs in length.

25. The computer system of claim 14, 15, 16, 17 or 18, wherein the length of the CNV call of the SV notification is less than the length of the initial CNV.

26. The computer system of claim 25, wherein the initial CNV is less than or equal to 20,000 base pairs in length.

27. A computer program product, the computer program product comprising: A computer readable storage medium capable of being read by a processing circuit and storing instructions, the instructions being executed by the processing circuit for performing a method for improved calling of copy number variants in a genomic sequence, the method comprising: obtaining gene sequence variant data, the gene sequence variant data comprising a record indicating at least one structural variant (SV) in the genomic sequence and a record indicating at least one copy number variant (CNV); determining, based on an initial CNV indicated in the genetic sequence variant data and at least one initial SV indicated in the genetic sequence variant data, an SV-informed CNV call to be an updated version of the initial CNV, wherein the determining uses information from the at least one initial SV to determine a start breakpoint position and an end breakpoint position of the SV-informed CNV call, at least one of the start breakpoint position and the end breakpoint position being updated compared to a corresponding start breakpoint position and / or end breakpoint position of the initial CNV, informed by the at least one initial SV; and The CNV calls informed by the determined SVs are written as one or more records in a genetic sequence variant data file.

28. A computer program product according to claim 27, wherein the initial CNV is provided by a CNV calling component of a genomic analysis software, wherein the genomic analysis software has a filtering component, the filtering component is configured to filter out CNVs with a confidence level less than a threshold confidence level, wherein the CNV calling component provides a confidence level of the initial CNV less than the threshold confidence level, and wherein the CNV call of the SV notification is provided with a confidence level higher than the threshold confidence level, so that the filtering component does not filter out the CNV call of the SV notification.

29. The computer program product of claim 27, wherein the breakpoint resolution of the breakpoint of the initial CNV is equal to a window size of n base pairs, wherein 2000>n>200, such that the position of the breakpoint of the initial CNV is an approximate position identified based on a window of length n, wherein the breakpoint of the initial CNV is determined to be within the window, and wherein the breakpoint resolution of the CNV call of the SV notification is 1 base pair.

30. The computer program product of claim 27, wherein the determining the CNV call of the SV notification as an updated version of the initial CNV comprises: Modify the initial CNV to produce a record of CNV calls of said SV notifications, said modification changing said starting and / or ending breakpoint positions of said initial CNV as indicated in said record of said initial CNV to updated breakpoint positions determined by said at least one initial SV notification; and further updating the initial CNV indicated in the record The length of the CNV and the quality score in the record of the initial CNV to provide the record of the SV-informed CNV calls.

31. A computer program product according to claim 30, wherein the record of the initial CNV is a copy of the original record of the initial CNV, wherein the gene sequence variant data file is part of one or more gene sequence variant data files, and wherein the original record of the initial CNV is retained and output in at least one of the one or more gene sequence variant data files.

32. The computer program product of claim 1, 2, 3, 4, or 5, wherein said determining said SV-informed CNV call comprises, for each of said at least one initial SV, performing a pairwise comparison of said initial CNV with said initial SV.

33. The computer program product of claim 32, wherein the pairwise comparisons of the initial CNV to the initial SV comprise one or more breakpoint comparisons, each of the one or more breakpoint comparisons comparing the respective first breakpoint position to the respective second breakpoint position to provide a proposed modified CNV by evaluating one or more pass / fail rules based on the respective first breakpoint position of the initial CNV proposed to be modified to the respective second breakpoint position of the initial SV.

34. The computer program product of claim 33, wherein the one or more breakpoint comparisons comprise at least one of: comparing the starting breakpoint position of the initial CNV to at least one of the starting breakpoint position or the ending breakpoint position of the initial SV; or The ending breakpoint position of the initial CNV is compared to at least one of the starting breakpoint position or the ending breakpoint position of the initial SV.

35. The computer program product of claim 33, wherein the one or more rules include at least one of: a rule requiring overlap of at least some positions between the initial SV and the proposed modified CNV; compatibility rules for the orientations of the initial SV and the proposed modified CNV; A rule that the associated breakpoints of the initial SV and the proposed modified CNV are within a threshold distance; or A uniqueness rule requiring that the breakpoint of the initial CNV proposed for modification matches at most one SV breakpoint of the at least one initial SV.

36. The computer program product of claim 27, 28, 29, 30, or 31, wherein the SV-informed CNV call is less than or equal to 20,000 base pairs in length.

37. The computer program product of claim 27, 28, 29, 30, or 31, wherein the SV-informed CNV call is less than or equal to 10,000 base pairs in length.

38. The computer program product of claim 27, 28, 29, 30, or 31, wherein the length of the CNV call of the SV notification is less than the length of the initial CNV.

39. The computer program product of claim 38, wherein the initial CNV is less than or equal to 20,000 base pairs in length.