IP Library › Granted Patent US 12,586,663
Granted Patent B2
US 12,586,663 · App. 17/554,721 · Granted Mar 24, 2026

Copy number variant caller

Inventors: Kevin R. Haas (Berkeley, CA); Xin Wang (San Francisco, CA); Peter V. Grauman (San Francisco, CA)
Assignee: Myriad Women's Health, Inc.
G16B40/00G06F18/2415G06F18/295G16B20/10G16B30/00G16B30/10G16B40/30G16B50/00G16H50/20G06F2218/08G06F2218/16G06V2201/04
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,586,663
App. No.
17/554,721
Granted
Mar 24, 2026
Kind
B2
Abstract

Direct targeted sequencing (DTS) methods and a hidden Markov model (HMV) can be used to call the copy number of a segment of interest within a region of interest. Described herein are methods for calling a copy number variant or a copy number variant abnormality using an HMM, and methods for determining a copy number based on a copy number likelihood model, in a test sequencing library that has be sequenced using DTS methods. Also described herein are methods for determining a copy number of a segment, including accounting for spurious capture probes that may arise from the DTS methods.

Claims (28)

1 . A system for determining a copy number of an interrogated segment of nucleic acids within a region of interest of a genome, the system comprising a non-transitory computer-readable storage medium programed to:

(a) obtain a plurality of sequencing reads from a test sequencing library

(b) map the plurality of sequencing reads with the interrogated segment; and

(c) determine the copy number of the interrogated segment,

wherein the copy number is the most probable copy number of the interrogated segment as determined by an optimized parameterized hidden Markov model comprising:

(i) one or more hidden states comprising a copy number corresponding to the interrogated segment or a plurality of sub-segments within the interrogated segment;

(ii) an observation state comprising a number of sequencing reads mapped to the interrogated segment; and

(iii) a copy number likelihood model using one or more likelihood distributions for an expected number of sequencing reads mapped to the interrogated segment,

wherein the hidden Markov model is parameterized by adjusting the copy number likelihood model to fit the determined number of sequencing reads mapped to the interrogated segment by allowing portions of the likelihood distributions to float.

2 . The system of claim 1 , wherein the system is further operable to:

map the plurality of sequencing reads to a plurality of spatially adjacent segments, wherein the plurality of spatially adjacent segments comprises the interrogated segment;

determine a copy number likelihood model for each spatially adjacent segment using a plurality of likelihood distributions associated with an expected number of mapped sequencing reads at the spatially adjacent segment;

build the hidden Markov model, wherein the hidden Markov model comprises comprising:

(i) a plurality of hidden states comprising a copy number for each of the spatially adjacent segments or a plurality of sub-segments within each of the spatially adjacent segments,

(ii) a plurality of observation states comprising the number of sequencing reads mapped to each spatially adjacent segment, and

(iii) the copy number likelihood model for each spatially adjacent segment; and

parameterizing the hidden Markov model comprising adjusting each copy number likelihood model to fit the determined number of sequencing reads mapped to each spatially adjacent segment by allowing portions of the likelihood distributions to float.

3 . The system of claim 1 , wherein the system is further operable to determine a most probable copy number of a section within the region of interest, wherein the section comprises a plurality of spatially adjacent segments comprising the interrogated segment.

4 . The system of claim 1 , wherein the copy number likelihood model comprises a distribution for two or more copy number states or a negative binomial distribution, wherein the negative binomial distribution is not a Poisson distribution.

5 . The system of claim 1 , wherein the expected number of sequencing reads is based on an average number of mapped sequencing reads at a corresponding segment across a plurality of sequencing libraries and an average number of mapped sequencing reads across a plurality of segments of interest within the test sequencing library, wherein the average number of mapped sequencing reads at a corresponding segment across a plurality of sequencing libraries or the average number of sequencing reads across a plurality of segments of interest within the test sequencing library is a normalized average.

6 . The system of claim 1 , wherein the copy number likelihood model is adjusted to account for the presence of GC content bias, and wherein adjustment of the copy number likelihood model depends on the GC content of the capture probe corresponding to the interrogated segment or the GC content of the interrogated segment.

7 . The system of claim 1 , wherein the hidden Markov model comprises a plurality of transition probabilities of the copy number of a sub-segment in the plurality of sub-segments within the interrogated segment for a given copy number of a spatially adjacent sub-segment.

8 . The system of claim 1 , wherein the hidden Markov model comprises a transition probability of the copy number of the interrogated segment for a given copy number of a spatially adjacent segment, wherein the transition probability accounts for an average length of a copy number variant or for a prior probability of a copy number variant at the interrogated segment or a spatially adjacent segment, wherein the average length of a copy number variant or the probability of a copy number variant at the interrogated segment are determined based on observations in a human population.

9 . The system of claim 1 , wherein the system is further operable to parameterize the hidden Markov model by accounting for one or more spurious capture probes, wherein accounting for one or more spurious capture probes comprises weighting the one or more observation states in the plurality of observation states with a spurious capture probe indicator or optimizing the parameterized hidden Markov model using an expectation-maximization step, wherein the spurious capture probe indicator comprises a Bernoulli distribution of a prior observation state in the hidden Markov model, and if a capture probe is determined to be spurious, the likelihood information from that capture probe is disregarded in the copy number likelihood model.

10 . The system of claim 1 , wherein the system is further operable to parameterize the hidden Markov model by accounting for noise in the number of mapped sequencing reads, wherein accounting for noise in the number of mapped sequencing reads comprises adjusting the copy number likelihood model by adjusting a dispersion of a copy number likelihood distribution in the copy number likelihood model, wherein adjusting the copy number likelihood model to account for the noise comprises adjusting the dispersion of the copy number likelihood distribution in the copy number likelihood model via an expectation-maximization step, wherein the expectation-maximization step comprises weighing a level of noise in the number of mapped sequencing reads from the test sequencing library, wherein the expectation-maximization step comprises using a Quasi-Newtonian solver, and wherein the most probable copy number of the interrogated segment is not called if the noise in the number of mapped sequencing reads is above a predetermined threshold.

11 . The system of claim 1 , wherein sequencing reads from overlapping capture probes are merged.

12 . The system of claim 1 , wherein the system is further operable to implement a Viterbi algorithm to determine the most probable copy number of the interrogated segment.

13 . The system of claim 1 , wherein the system is further operable to determine a confidence of the most probable copy number of the segment.

Assignments (5)
SECURITY INTEREST Recorded Aug 1, 2025
From: MYRIAD GENETICS, INC.; MYRIAD GENETIC LABORATORIES, INC.; MYRIAD WOMEN’S HEALTH, INC.; ASSUREX HEALTH, INC.; GATEWAY GENOMICS, LLC
To: ORBIMED ROYALTY & CREDIT OPPORTUNITIES IV, LP, AS ADMINISTRATIVE AGENT FOR SECURED PARTIES
Reel/Frame 072309/0932 →
RELEASE OF SECURITY INTEREST IN PATENTS PREVIOUSLY RECORDED AT REEL/FRAME (064235/0032) Recorded Aug 1, 2025
From: JPMORGAN CHASE BANK, N.A., AS ADMINISTRATIVE AGENT
To: MYRIAD GENETICS, INC.; MYRIAD WOMEN’S HEALTH, INC.; GATEWAY GENOMICS, LLC; ASSUREX HEALTH, INC.
Reel/Frame 072331/0215 →
PATENT SECURITY AGREEMENT Recorded Jul 7, 2023
From: MYRIAD GENETICS, INC.; MYRIAD WOMEN'S HEALTH, INC.; GATEWAY GENOMICS, LLC; ASSUREX HEALTH, INC.
To: JPMORGAN CHASE BANK, N.A.
Reel/Frame 064235/0032 →
CHANGE OF NAME Recorded Jun 29, 2023
From: COUNSYL, INC.
To: MYRIAD WOMEN'S HEALTH, INC.
Reel/Frame 064163/0629 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 29, 2023
From: HAAS, KEVIN R.; WANG, XIN; GRAUMAN, PETER V.
To: COUNSYL, INC.
Reel/Frame 064163/0741 →
Continuity (3)
Continuation 15934839 · Mar 23, 2018
Provisional Application 62476361 · Mar 24, 2017
Related Publication 20220108767A1 · Apr 7, 2022
References Cited (69)
US 5476930A · Letsinger et al. · 1995 [cited by applicant]
US 5780613A · Letsinger et al. · 1998 [cited by applicant]
US 6258540B1 · Lo · 2001 [cited by applicant]
US 7332277B2 · Dhallan · 2008 [cited by applicant]
US 7799531B2 · Mitchell et al. · 2010 [cited by applicant]
US 8383338B2 · Kitzman et al. · 2013 [cited by applicant]
US 9092401B2 · Richards et al. · 2015 [cited by applicant]
US 9309556B2 · Myllykangas et al. · 2016 [cited by applicant]
US 11232850B2 · Haas · 2022 [cited by examiner]
US 20050164241A1 · Hahn et al. · 2005 [cited by applicant]
US 20070134658A1 · Bohmer · 2007 [cited by applicant]
US 20090098547A1 · Ghosh · 2009 [cited by applicant]
US 20110257896A1 · Dowds et al. · 2011 [cited by applicant]
US 20120295819A1 · Leamon et al. · 2012 [cited by applicant]
US 20130171185A1 · Settembre et al. · 2013 [cited by applicant]
US 20130316915A1 · Halpern et al. · 2013 [cited by applicant]
US 20130337447A1 · Porreca et al. · 2013 [cited by applicant]
US 20140024536A1 · Richards et al. · 2014 [cited by applicant]
US 20140024541A1 · Richards et al. · 2014 [cited by applicant]
US 20140141982A1 · Jacobson et al. · 2014 [cited by applicant]
US 20140162278A1 · Richards et al. · 2014 [cited by applicant]
US 20140180594A1 · Kim et al. · 2014 [cited by applicant]
US 20140229117A1 · Halpern et al. · 2014 [cited by applicant]
US 20140274740A1 · Srinivasan et al. · 2014 [cited by applicant]
US 20150044687A1 · Schmitt et al. · 2015 [cited by applicant]
US 20150205914A1 · Richards et al. · 2015 [cited by applicant]
US 20150275289A1 · Otwinowski et al. · 2015 [cited by applicant]
US 20150284712A1 · Kurihara et al. · 2015 [cited by applicant]
US 20160115544A1 · Elzinga · 2016 [cited by applicant]
US 20170321270A1 · Haque et al. · 2017 [cited by applicant]
US 20170355984A1 · Evans et al. · 2017 [cited by applicant]
US 20180089364A1 · Muzzey et al. · 2018 [cited by applicant]
US 20180201994A1 · Beauchamp et al. · 2018 [cited by applicant]
US 20180216103A1 · Lai et al. · 2018 [cited by applicant]
US 20180216176A1 · Chu et al. · 2018 [cited by applicant]
US 20220108767A1 · Haas · 2022 [cited by examiner]
WO WO2010151842A2 · 2010 [cited by applicant]
WO WO2011057094A1 · 2011 [cited by applicant]
WO WO2012003374A2 · 2012 [cited by applicant]
WO WO2012040387A1 · 2012 [cited by applicant]
WO WO2012078792A2 · 2012 [cited by applicant]
WO WO2012088456A2 · 2012 [cited by applicant]
WO WO2013112923A1 · 2013 [cited by applicant]
WO WO2014138153A1 · 2014 [cited by applicant]
WO WO2016010856A1 · 2016 [cited by applicant]
WO WO2016130704A2 · 2016 [cited by applicant]
WO WO2018144216A1 · 2018 [cited by applicant]
WO WO2018144217A1 · 2018 [cited by applicant]
Ahn et al., “Asymmetrical barcode adapter-assisted recovery of duplicate reads and error correction strategy to detect rare mutations in circulating tumor DNA”, Scientific Reports, 2017, vol. 7, No. 46678, pp. 1-9. [cited by applicant]
Amarasinghe et al., “CONVEX: copy number variation estimation in exome sequencing data using HMM”, BMC Bioinformatics, 2013, vol. 14, No. Suppl 2, p. S2. [cited by applicant]
Backenroth et al., CANOES: detecting rare copy number variants from whole exome sequencing data, Nucleic Acids Research, 2014, vol. 42, No. 12, p. e97. [cited by applicant]
Brynildsrud et al., “CNOGpro: detection and quantification of CNVs in prokaryotic whole genome sequencing data”, Bioinformatics, 2015, vol. 31, No. 11, pp. 1708-1715. [cited by applicant]
Colella et al., “Quanti-SN P: an objective Bayes Hidden Markov Model to detect and accurately map copy number variation using SNP genotyping data”, Nucleic Acids Research, 2007, vol. 35, No. 6, pp. 2013-2025. [cited by applicant]
Crisan et al., “Mutation Discovery in Regions of Segmental Cancer Genome Amplifications with CoNAn-SNV: A Mixture Model for Next Generation Sequencing of Tumors”, PLOS One, Aug. 2012, vol. 7, No. 8, p. e41551. [cited by applicant]
Fromer et al., “Discovery and Statistical Genotyping of Copy-Number Variation from Whole-Exome Sequencing Depth”, American Journal of Human Genetics, Oct. 5, 2012, vol. 91, No. 4, pp. 597-607. [cited by applicant]
Fromer et al., “Using XHMM software to detect copy number variation in whole-exome sequencing data”, Current Protocols in Human Genetics, 2014, vol. 81, No. 7, p. 23.1-7.23.21. [cited by applicant]
Hopmans et al., “A programmable method for massively parallel targeted sequencing”, Nucleic Acids Res., 2014, vol. 42, No. 10:e88, pp. 1-16. [cited by applicant]
International Search Report and Written Opinion issued in corresponding International Application No. PCT/US2018/024062, dated Jul. 11, 2018 (12 pages). [cited by applicant]
Kang et al., “Design and validation of a next generation sequencing assay for hereditary BRCA1 and BRCA2 mutation testing”, Peer J., Jun. 2016, No. 4:e2162, pp. 1-14. [cited by applicant]
Love, “Statistical analysis of high-throughput sequencing count data”, Dissertation, University of Berlin, Jun. 2013, 114 pages. [cited by applicant]
Mertes et al., “Targeted enrichment of genomic DNA regions for next-generation sequencing”, Briefings in Functional Genomics, 2011, vol. 10, No. 6, pp. 374-386. [cited by applicant]
Miyatake et al., “Detecting copy-number variations in whole-exome sequencing data using the eXome Hidden Markov Model: an “exome-first” approach”, Journal of Human Genetics, Jan. 2015, vol. 60, pp. 175-182. [cited by applicant]
Myllykangas et al. “Efficient targeted resequencing of human germline and cancer genomes by oligonucleotide-selective sequencing”, Nat Biotechnol., 2011, vol. 29, No. 11, pp. 1024-1027. [cited by applicant]
Ng et al., “Targeted capture and massively parallel sequencing of twelve human exomes”, Nature, 2009, vol. 461, No. 7261, pp. 272-276. [cited by applicant]
Poultney et al., “Identification of Small Exonic CNV from Whole-Exome Sequence Data and Application to Autism Spectrum Disorder”, American Journal of Human Genetics, Oct. 3, 2013, vol. 93, No. 4, pp. 607-619. [cited by applicant]
Seiser et al., “Hidden Markov Model-based CNV Detection Algorithms for Illumina Genotyping Microarrays”, Cancer Informatics, 2014, vol. 13, p. S7. [cited by applicant]
Titsias et al., “Statistical Inference in Hidden Markov Models Using κ-Segment Constraints”, Journal of the American Statistical Association, Mar. 2016, vol. 111, No. 513, pp. 200-215. [cited by applicant]
Vysotskaia et al., “Development and validation of a 36-gene sequencing assay for hereditary cancer risk assessment”, Peer J., 2017, vol. 5, No. e3046, pp. 1-23. [cited by applicant]
Zhong et al., “High-throughput Illumina strand-specific RNA sequencing library preparation”, Cold Spring Harbor Protocols, 2011, vol. 8, pp. 940-949. [cited by applicant]