# US 2020/0286591 A1 · Reducing error in predicted genetic relationships

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

- Number: US 2020/0286591 A1
- Document ID: US20200286591A1
- Status: Published application
- Kind: A1
- Application number: 16/885,200
- Filed: 2020-05-27
- Published: 2020-09-10
- Earliest claimed: 2014-10-14
- Assignees: Ancestry.com DNA, LLC
- Applicants: Ancestry.com DNA, LLC
- Inventors: Mathew J. Barber; Yong Wang; Keith D. Noto; Kenneth G. Chahine; Catherine Ann Ball
- Web page: https://patentgrep.com/patent/US20200286591A1

## CPC

- G16B 20/40: Population genetics; Linkage disequilibrium
- G06N 5/048: Fuzzy inferencing
- G06N 7/01: Probabilistic graphical models, e.g. probabilistic networks
- G16B 10/00: ICT specially adapted for evolutionary bioinformatics, e.g. phylogenetic tree construction or analysis
- G16B 20/00: ICT specially adapted for functional genomics or proteomics, e.g. genotype-phenotype associations
- G16B 20/20: Allele or variant detection, e.g. single nucleotide polymorphism [SNP] detection
- G16B 40/00: ICT specially adapted for biostatistics; ICT specially adapted for bioinformatics-related machine learning or data mining, e.g. knowledge discovery or pattern finding
- C12Q 1/6881: for tissue or cell typing, e.g. human leukocyte antigen [HLA] probes
- G16B: BIOINFORMATICS, i.e. INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR GENETIC OR PROTEIN-RELATED DATA PROCESSING IN COMPUTATIONAL MOLECULAR BIOLOGY
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- C12Q: MEASURING OR TESTING PROCESSES INVOLVING ENZYMES, NUCLEIC ACIDS OR MICROORGANISMS (immunoassay G01N33/53); COMPOSITIONS OR TEST PAPERS THEREFOR; PROCESSES OF PREPARING SUCH COMPOSITIONS; CONDITION-RESPONSIVE CONTROL IN MICROBIOLOGICAL OR ENZYMOLOGICAL PROCESSES

## Abstract

System, computer program products, and methods are disclosed for estimating a degree of ancestral relatedness between two individuals. The haplotype data for a population of individuals is divided into segment windows based on genetic markers, and matched segments for the haplotype data are generated. Each matched segment having a first cM width that exceeds a threshold cM width is included in counting the matched segments in each segment window. A weight associated with each segment window is estimated based on the count of matched segments in the associated segment window. A weighted sum of per-window cM widths for each matched segment is calculated based on the first cM width and the weights associated with the segment windows of the matched segment. The weighted sum of per-window cM widths are used to estimate a degree of ancestral relatedness between two individuals.

## Claims

### Claim 1

A computer implemented method, comprising:
receiving haplotype data for a set of individuals, the haplotype data including a plurality of genetic markers;
dividing the haplotype data into segment windows;
for each of at least two individuals in the set of individuals:
based on the genetic markers, matching segments of the haplotype data between the individual and other individuals in the set, each matched segment having a width,
counting the matched segments in each segment window, and
estimating a weight associated with each segment window based on the count of matched segments in the associated segment window;
calculating a weighted sum between the two individuals based on the width of each matched segment and the weights associated with the segment windows of the matched segment; and
estimating a degree of ancestral relatedness between the two individuals based on the weighted sum between the two individuals.

### Claim 2 (depends on 1)

The computer-implemented method of claim 1, wherein each matched segment has a width exceeding a threshold width, the threshold width is 5 centimorgan (cM), 6 cM, 7 cM, 8 cM, 9 cM, 10 cM, or any real number within a range of 5 cM to 10 cM.

### Claim 3 (depends on 1)

The computer-implemented method of claim 1, wherein the weight associated with a segment window for individual A is approximated as:
w
i
A
=
P

rob

(
ι

RGH
)

Pro


H
)
Prob

=
k
i
)
,
wherein Prob(|RGH), ProH), Prob=c) are estimates of a probability of an RGH segment given the count c of matched segments in the segment window i, a probability of an RGH segment in the segment window i, and the probability of the count c of matched segments in the segment window i, respectively.

### Claim 4 (depends on 3)

The computer-implemented method of claim 3, wherein Prob32 c) is approximated as:
Prob

=
c

c
>
0
)
=
(
n
c
)

B

(
c
+
α
,
n
-
c
+
β
)
B

(
α
,
β
)
,
wherein n is a size of the set of individuals and α, β are parameters of the Beta function B.

### Claim 5 (depends on 4)

The computer-implemented method of claim 4, wherein α and β are estimated by using a maximum likelihood estimation of a joint distribution approximated as:
f

(
{
k
i
}

n
,
α
,
β
,
k
i
>
0
)
=
∏
i
=
1
K

(
n
k
i
-
1
)

B

(
k
i
-
1
+
α
,
n
-
k
i
+
1
+
β
)
B

(
α
,
β
)
.

### Claim 6 (depends on 3)

The computer-implemented method of claim 3, wherein ProH) is approximated by a maximum of:
1
Prob

(

RGH
)
Prob

=
c
)
.

### Claim 7 (depends on 3)

The computer-implemented method of claim 3, wherein the Prob(|RGH) is based on a user specified threshold value V, and Prob|RGH, V) is approximated as:
Prob

(

RGH
,
V
,
c
>
0
)
=
(
n
c
)

B

(
c
+
α
,
n
-
c
+
β
)
B

(
α
,
β
)

/

Prob

(
0

≤
V

α
,
β
)
,
wherein n is a size of the set of individuals and α, β are parameters of the Beta function B.

### Claim 8 (depends on 7)

The computer-implemented method of claim 7, wherein the user specified threshold value V may include two specified quantiles, a first specified quantile equal to 50%, 55%, 60%, 65%, 70%, or 75% and a second specified quantile equal to 75%, 80%, 85%, or 90%, to determine at least two estimates of Prob(|RGH, V).

### Claim 9 (depends on 7)

The computer-implemented method of claim 7, wherein α and β is estimated by using a maximum likelihood estimation of a joint distribution approximated as:
f

(
{
m
i
}

n
,
α
,
β
,
V
,
m
i
>
0
)
=
∏
i
=
1
M

(
n
m
i
-
l
)

B

(
m
i
-
1
+
α
,
n
-
m
i
+
1
+
β
)
B

(
α
,
β
)
Prob

(
0

≤
V

α
,
β
)
.

### Claim 10 (depends on 1)

The computer-implemented method of claim 1, wherein the weighted sum between two individuals A and B is calculated as:
c

M
2
A
,
B
=
∑
i
=
W

I

N
s

t

a

r

t
W

I

N
end
≤
K

w
i
A
·
w
i
B
·
cM
1
,
i
,
wherein cM1,i is the width of a matched segment between individuals A and B for each segment window i that the matched segment spans starting at window WINstart and ending at window WINend with wiA and wiB being the weights associated with the segment window i for individual A and B, respectively.

### Claim 11 (depends on 1)

The computer-implemented method of claim 1, wherein estimating the weight comprises calculating temporary weights {tilde over (w)}c for the count c of matched segments in the associated segment window is approximated as:
w
~
c
=
1
,
if


c
≤
M
,

d
c
=
{
0
,
if


r
c
>
r
c
-
1
r
c
-
r
c
-
1
,
else
,

w
~
c
=
1
+
∑
i
=
M
+
1
c


d
i
,
if


c
>
M
,
wherein rc is the weight based on the count of matched segments c and approximated as:
r
c
=
P

rob

(

RGH
)

Pro


H
)
Prob

=
c
)
.

### Claim 12 (depends on 1)

The computer-implemented method of claim 1, wherein the weights associated with each segment window decrease if the count of matched segments in the associated segment window increases.

### Claim 13 (depends on 1)

The computer-implemented method of claim 1, wherein a size of the segment windows comprises 50, 60, 70, 80, 90, 100, 110, 120, 130, 140, 150 genetic markers or any number that falls within a range of 50 to 500 genetic markers.

### Claim 14 (depends on 1)

The computer-implemented method of claim 1, further comprising:
responsive to matching segments of the haplotype data between the individual and other individuals in the set, removing close relatives from the set of individuals.

### Claim 15 (depends on 14)

The computer-implemented method of claim 14, wherein close relatives comprise two individuals having a matched segment with a width larger than 60 cM.

### Claim 16 (depends on 1)

The computer-implemented method of claim 1, wherein the set of individuals has a population size n and a number of genetic markers per segment window d, and a number of segment windows K is approximated as:
K=n/d.

### Claim 17 (depends on 1)

The computer-implemented method of claim 1, wherein the degree of relatedness between two individuals comprises a probability that the two individuals are ancestrally related.

### Claim 18 (depends on 1)

The computer-implemented method of claim 1, wherein the degree of relatedness between two individuals comprises a binary yes or no answer whether the two individuals are ancestrally related.

### Claim 19

A non-transitory computer readable medium for storing computer code comprising instructions, the instructions, when executed by one or more processors, cause the one or more processors to:
receive haplotype data for a set of individuals, the haplotype data including a plurality of genetic markers;
divide the haplotype data into segment windows;
for each of at least two individuals in the set of individuals:
based on the genetic markers, match segments of the haplotype data between the individual and other individuals in the set, each matched segment having a width,
count the matched segments in each segment window, and
estimate a weight associated with each segment window based on the count of matched segments in the associated segment window;
calculate a weighted sum between the two individuals based on the width of each matched segment and the weights associated with the segment windows of the matched segment; and
estimate a degree of ancestral relatedness between the two individuals based on the weighted sum between the two individuals.

### Claim 20

A system comprising:
one or more processors; and
a memory storing instructions that when executed by the one or more processors cause the one or more processors to perform steps comprising:
receiving haplotype data for a set of individuals, the haplotype data including a plurality of genetic markers;
dividing the haplotype data into segment windows;
for each of at least two individuals in the set of individuals:
based on the genetic markers, matching segments of the haplotype data between the individual and other individuals in the set, each matched segment having a width,
counting the matched segments in each segment window, and
estimating a weight associated with each segment window based on the count of matched segments in the associated segment window;
calculating a weighted sum between the two individuals based on the width of each matched segment and the weights associated with the segment windows of the matched segment; and
estimating a degree of ancestral relatedness between the two individuals based on the weighted sum between the two individuals.
