# US 2020/0402610 A1 · Systems and methods for determining genome ploidy

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2020/0402610 A1
- Document ID: US20200402610A1
- Status: Published application
- Kind: A1
- Application number: 16/907,121
- Filed: 2020-06-19
- Published: 2020-12-24
- Earliest claimed: 2019-06-21
- Assignees: CooperSurgical, Inc.
- Applicants: CooperSurgical, Inc.
- Inventors: John BURKE; Brian RHEES; Joshua David BLAZEK; Michael Jon LARGE
- Web page: https://patentgrep.com/patent/US20200402610A1

## CPC

- G16B 20/10: Ploidy or copy number detection
- G16B 20/20: Allele or variant detection, e.g. single nucleotide polymorphism [SNP] detection
- G16B 30/10: Sequence alignment; Homology search
- G16B: BIOINFORMATICS, i.e. INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR GENETIC OR PROTEIN-RELATED DATA PROCESSING IN COMPUTATIONAL MOLECULAR BIOLOGY

## Abstract

A method for detecting ploidy in an embryo is provided, comprising receiving an embryo sequence data; aligning the received sequence data to a reference genome; identifying a region of interest in the aligned embryo sequence data; identifying single nucleotide polymorphisms (SMPs) in the sequence data by comparing the received sequence data to the aligned reference genome; determining a ploidy score comprising counting the number of observed SNPs in the region of interest; comparing the ploidy score to a predetermined threshold; and identifying the embryo as polyploid if the ploidy score is below the predetermined threshold.

## Claims

### Claim 1

A method for detecting ploidy in an embryo, comprising:
receiving an embryo sequence data;
aligning the received sequence data to a reference genome;
identifying a region of interest in the aligned embryo sequence data;
identifying single nucleotide polymorphisms (SMPs) in the sequence data by comparing the received sequence data to the aligned reference genome;
determining a ploidy score comprising counting the number of observed SNPs in the region of interest;
comparing the ploidy score to a predetermined threshold; and
identifying the embryo as polyploid if the ploidy score is below the predetermined threshold.

### Claim 2 (depends on 1)

The method of claim 1, further comprising identifying the embryo as euploid if the ploidy score is above the predetermined threshold.

### Claim 3 (depends on 1)

The method of claim 1, wherein the polyploid is a balanced polyploid.

### Claim 4 (depends on 1)

The method of claim 1, wherein the embryo sequence data is acquired by low-coverage sequencing.

### Claim 5 (depends on 4)

The method of claim 4, wherein the low-coverage sequencing is between about 0.001 and 10×.

### Claim 6 (depends on 4)

The method of claim 4, wherein the low-coverage sequencing is between about 0.01 and 0.5×.

### Claim 7 (depends on 4)

The method of claim 4, wherein the low-coverage sequencing is between about 0.25 and 0.2×.

### Claim 8

(canceled)

### Claim 9

(canceled)

### Claim 10

(canceled)

### Claim 11

(canceled)

### Claim 12

A non-transitory computer-readable medium storing computer instructions for detecting ploidy in an embryo, comprising:
receiving an embryo sequence data;
aligning the received sequence data to a reference genome;
identifying a region of interest in the aligned embryo sequence data;
identifying single nucleotide polymorphisms (SMPs) in the sequence data by comparing the received sequence data to the aligned reference genome;
determining a ploidy score comprising counting the number of observed SNPs in the region of interest;
comparing the ploidy score to a predetermined threshold; and
identifying the embryo as polyploid if the ploidy score is below the predetermined threshold.

### Claim 13 (depends on 12)

The method of claim 12, further comprising identifying the embryo as euploid if the ploidy score is above the predetermined threshold.

### Claim 14 (depends on 13)

The method of claim 13, wherein the polyploid is a balanced polyploid.

### Claim 15 (depends on 12)

The method of claim 12, wherein the embryo sequence data is acquired by low-coverage sequencing.

### Claim 16 (depends on 15)

The method of claim 15, wherein the low-coverage sequencing is between about 0.001 and 10×.

### Claim 17 (depends on 15)

The method of claim 15, wherein the low-coverage sequencing is between about 0.01 and 0.5×.

### Claim 18 (depends on 15)

The method of claim 15, wherein the low-coverage sequencing is between about 0.25 and 0.2×.

### Claim 19

(canceled)

### Claim 20

(canceled)

### Claim 21

(canceled)

### Claim 22

(canceled)

### Claim 23

A system for detecting ploidy in an embryo, comprising:
a data store for receiving an embryo sequence data;
a computing device communicatively connected to the data store, the computing device comprising
an ROI engine configured to align the received sequence data to a reference genome, and identify a region of interest in the aligned embryo sequence data;
a SNP identification engine configured to identify single nucleotide polymorphisms (SMPs) in the sequence data by comparing the received sequence data to the aligned reference genome; and
a scoring engine configured to determine a polyploid score comprising counting the number of observed SNPs in the region of interest, compare the polyploid score to a predetermined threshold, and identifying the embryo as polyploid if the polyploid score is below the predetermined threshold;
and
a display communicatively connected to the computing device and configured to display a report containing the polyploid classification of the embryo.

### Claim 24 (depends on 23)

The system of claim 23, wherein the scoring engine is further configured to identify the embryo as euploid if the polyploid score is above the predetermined threshold.

### Claim 25

(canceled)

### Claim 26 (depends on 23)

The system of claim 23, wherein the polyploid is a balanced polyploid.

### Claim 27 (depends on 23)

The system of claim 23, wherein the embryo sequence data is acquired by low-coverage sequencing.

### Claim 28 (depends on 27)

The system of claim 27, wherein the low-coverage sequencing is between about 0.001 and 10×.

### Claim 29 (depends on 27)

The system of claim 27, wherein the low-coverage sequencing is between about 0.01 and 0.5×.

### Claim 30

(canceled)

### Claim 31

(canceled)

### Claim 32

(canceled)

### Claim 33

(canceled)

### Claim 34

(canceled)
