IP Library › Granted Patent US 12,639,342
Granted Patent B2
US 12,639,342 · App. 18/924,937 · Granted May 26, 2026

Systems and methods for determining data-origin links between named entities

Inventors: Milos Pavlovic (Sandy, UT); Ross Eugene Curtis (Cedar Hills, UT); Yong Wang (Foster City, CA); Luong Ruiz (San Francisco, CA)
Assignee: Ancestry.com DNA, LLC
G06F16/288G06F16/285
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,639,342
App. No.
18/924,937
Granted
May 26, 2026
Kind
B2
Abstract

A system includes a computing device having one or more processors and memory configured to store instructions, wherein the instructions, when executed by the one or more processors, cause the one or more processors to perform steps including receiving a first named entity dataset associated with a first named entity, receiving a second named entity dataset associated with a second named entity who is a potential named entity linked to the first named entity, identifying a plurality of data matches, each data match being a named entity whose data segments match the first named entity dataset, the second named entity dataset, or both, extracting features from the plurality of data matches, and inputting the extracted features into a machine learning model to determine a data-origin link between the first named entity and the second named entity.

Claims (96)

1 . A computer-implemented method, comprising:

receiving a first genetic dataset associated with a target individual;

receiving a second genetic dataset associated with a target relative, wherein the target relative is a potential relative to the target individual;

determining a total length of genetic segments that are matched between the first genetic dataset and the second genetic dataset;

determining that the total length falls within a predetermined range of a degree of separation;

identifying a plurality of genetic matches, each genetic match being an individual having genetic data that matches the first genetic dataset, the second genetic dataset, or both;

extracting features from the genetic data of the plurality of genetic matches; and

inputting the extracted features into a machine learning model to determine a familial relationship between the target individual and the target relative, the machine learning model specifically trained for the predetermined range of the degree of separation.

2 . The computer-implemented method of claim 1 , wherein identifying the plurality of genetic matches comprises:

determining a data classification link between the target individual and the target relative based on a degree of match between the first genetic dataset and the second genetic dataset; and

identifying the plurality of genetic matches based on the determined data classification link.

3 . The computer-implemented method of claim 1 , wherein extracting the features from the plurality of genetic matches comprises:

determining:

a first length of matched-data-string segments shared by the target individual and the each genetic match,

a second length of matched-data-string segments shared by the target relative and the each genetic match, and

a length difference of matched-data-string segments based on the first length of matched-data-string segments and the second length of matched- data-string segments;

determining:

a first number of matched-data-string segments shared by the target individual and the each genetic match,

a second number of matched-data-string segments shared by the target relative and the each genetic match, and

a number difference of matched-data-string segments based on the first number of matched-data-string segments and the second number of matched-data-string segments;

determining:

a first number of shared classification-data segments between the target individual and the each genetic match,

a second number of shared classification-data segments between the target relative and the each genetic match, and

a number difference of shared classification-data segments based on the first number of shared classification-data segments and the second number of shared classification-data segments; and

extracting the features from the length difference of matched-data-string segments, the number difference of matched-data-string segments, or the number difference of shared classification-data segments.

4 . The computer-implemented method of claim 3 , wherein the features comprise:

a mean, a median, a standard deviation, a maximum or a minimum of the length differences of matched-data-string segments;

a mean, a median, a standard deviation, a maximum or a minimum of the number differences of matched-data-string segments; or

a mean, a median, a standard deviation, a maximum or a minimum of the number difference of shared classification-data segments.

5 . The computer-implemented method of claim 1 , wherein the machine learning model comprises a regression model, a random forest classifier, a support vector machine, a neural network, or a model trained by an unsupervised approach.

6 . The computer-implemented method of claim 1 , further comprising connecting the target individual and the target relative in a data tree based on the familial relationship.

7 . The computer-implemented method of claim 1 , wherein the familial relationship between the target individual and the target relative is an M3 relationship.

8 . The computer-implemented method of claim 1 , further comprising connecting the target individual and the target relative in a data tree based on the familial relationship.

9 . A system comprising:

one or more processors; and

memory configured to store instructions, wherein the instructions, when executed by the one or more processors, cause the one or more processors to perform steps comprising:

receiving a first genetic dataset associated with a target individual;

receiving a second genetic dataset associated with a target relative, wherein the target relative is a potential relative to the target individual;

determining a total length of genetic segments that are matched between the first genetic dataset and the second genetic dataset;

determining that the total length falls within a predetermined range of a degree of separation;

identifying a plurality of genetic matches, each genetic match being an individual having genetic data that matches the first genetic dataset, the second genetic dataset, or both;

extracting features from the genetic data of the plurality of genetic matches; and

inputting the extracted features into a machine learning model to determine a familial relationship between the target individual and the target relative, the machine learning model specifically trained for the predetermined range of the degree of separation.

10 . The system of claim 9 , wherein identifying the plurality of genetic matches comprises:

determining a data classification link between the target individual and the target relative based on a degree of match between the first genetic dataset and the second genetic dataset; and

identifying the plurality of genetic matches based on the determined data classification link.

11 . The system of claim 9 , wherein extracting the features from the plurality of genetic matches comprises:

determining:

a first length of matched-data-string segments shared by the target individual and the each genetic match,

a second length of matched-data-string segments shared by the target relative and the each genetic match, and

a length difference of matched-data-string segments based on the first length of matched-data-string segments and the second length of matched- data-string segments;

determining:

a first number of matched-data-string segments shared by the target individual and the each genetic match,

a second number of matched-data-string segments shared by the target relative and the each genetic match, and

a number difference of matched-data-string segments based on the first number of matched-data-string segments and the second number of matched-data-string segments;

determining:

a first number of shared classification-data segments between the target individual and the each genetic match,

a second number of shared classification-data segments between the target relative and the each genetic match, and

a number difference of shared classification-data segments based on the first number of shared classification-data segments and the second number of shared classification-data segments; and

extracting the features from the length difference of matched-data-string segments, the number difference of matched-data-string segments, or the number difference of shared classification-data segments.

12 . The system of claim 11 , wherein the features comprise:

a mean, a median, a standard deviation, a maximum or a minimum of the length differences of matched-data-string segments;

a mean, a median, a standard deviation, a maximum or a minimum of the number differences of matched-data-string segments; or

a mean, a median, a standard deviation, a maximum or a minimum of the number difference of shared classification-data segments.

13 . The system of claim 9 , wherein the machine learning model comprises a regression model, a random forest classifier, a support vector machine, a neural network, or a model trained by an unsupervised approach.

14 . The system of claim 9 , wherein the familial relationship between the target individual and the target relative is an M3 relationship.

15 . A non-transitory computer readable medium for storing computer code comprising instructions, when executed by one or more computer processors, causing one or more computer processors to perform steps comprising:

receiving a first genetic dataset associated with a target individual;

receiving a second genetic dataset associated with a target relative, wherein the target relative is a potential relative to the target individual;

determining a total length of genetic segments that are matched between the first genetic dataset and the second genetic dataset;

determining that the total length falls within a predetermined range of a degree of separation;

identifying a plurality of genetic matches, each genetic match being an individual having genetic data that matches the first genetic dataset, the second genetic dataset, or both;

extracting features from the genetic data of the plurality of genetic matches; and

inputting the extracted features into a machine learning model to determine a familial relationship between the target individual and the target relative, the machine learning model specifically trained for the predetermined range of the degree of separation.

16 . The non-transitory computer readable medium of claim 15 , wherein identifying the plurality of genetic matches comprises:

determining a data classification link between the target individual and the target relative based on a degree of match between the first genetic dataset and the second genetic dataset; and

identifying the plurality of genetic matches based on the determined data classification link.

17 . The non-transitory computer readable medium of claim 15 , wherein extracting the features from the plurality of genetic matches comprises:

determining:

a first length of matched-data-string segments shared by the target individual and the each genetic match,

a second length of matched-data-string segments shared by the target relative and the each genetic match, and

a length difference of matched-data-string segments based on the first length of matched-data-string segments and the second length of matched- data-string segments;

determining:

a first number of matched-data-string segments shared by the target individual and the each genetic match,

a second number of matched-data-string segments shared by the target relative and the each genetic match, and

a number difference of matched-data-string segments based on the first number of matched-data-string segments and the second number of matched-data-string segments;

determining:

a first number of shared classification-data segments between the target individual and the each genetic match,

a second number of shared classification-data segments between the target relative and the each genetic match, and

a number difference of shared classification-data segments based on the first number of shared classification-data segments and the second number of shared classification-data segments; and

extracting the features from the length difference of matched-data-string segments, the number difference of matched-data-string segments, or the number difference of shared classification-data segments.

18 . The non-transitory computer readable medium of claim 17 , wherein the features comprise:

a mean, a median, a standard deviation, a maximum or a minimum of the length differences of matched-data-string segments;

a mean, a median, a standard deviation, a maximum or a minimum of the number differences of matched-data-string segments; or a mean, a median, a standard deviation, a maximum or a minimum of the number difference of shared classification-data segments.

19 . The non-transitory computer readable medium of claim 15 , wherein the machine learning model comprises a regression model, a random forest classifier, a support vector machine, a neural network, or a model trained by an unsupervised approach.

20 . The non-transitory computer readable medium of claim 15 , wherein the familial relationship between the target individual and the target relative is an M3 relationship.

Assignments (3)
PATENT SECURITY AGREEMENT Recorded Aug 3, 2026
From: ANCESTRY.COM OPERATIONS INC.; ANCESTRY.COM DNA, LLC
To: WILMINGTON TRUST, NATIONAL ASSOCIATION, AS NOTES COLLATERAL AGENT
Reel/Frame 076116/0447 →
PATENT SECURITY AGREEMENT Recorded Aug 3, 2026
From: ANCESTRY.COM OPERATIONS INC.; ANCESTRY.COM DNA, LLC
To: WILMINGTON TRUST, NATIONAL ASSOCIATION, AS NOTES COLLATERAL AGENT
Reel/Frame 076144/0726 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 3, 2025
From: PAVLOVIC, MILOS; CURTIS, ROSS EUGENE; WANG, YONG; RUIZ, LUONG
To: ANCESTRY.COM DNA, LLC
Reel/Frame 069731/0787 →
Continuity (2)
Provisional Application 63592726 · Oct 24, 2023
Related Publication 20250131019A1 · Apr 24, 2025
References Cited (142)
US 6570567B1 · Eaton · 2003 [cited by applicant]
US 7062752B2 · Simpson et al. · 2006 [cited by applicant]
US 7249129B2 · Cookson et al. · 2007 [cited by applicant]
US 7818281B2 · Kennedy et al. · 2010 [cited by applicant]
US 8510057B1 · Avey et al. · 2013 [cited by applicant]
US 8769438B2 · Mangum et al. · 2014 [cited by applicant]
US 9116882B1 · Macpherson et al. · 2015 [cited by applicant]
US 9213944B1 · Do et al. · 2015 [cited by applicant]
US 9213947B1 · Do et al. · 2015 [cited by applicant]
US 9336177B2 · Hawthorne et al. · 2016 [cited by applicant]
US 9367800B1 · Do et al. · 2016 [cited by applicant]
US 9836576B1 · Do et al. · 2017 [cited by applicant]
US 9864835B2 · Avey et al. · 2018 [cited by applicant]
US 9977708B1 · Do et al. · 2018 [cited by applicant]
US 10114922B2 · Byrnes et al. · 2018 [cited by applicant]
US 10223498B2 · Han et al. · 2019 [cited by applicant]
US 10347365B2 · Wong et al. · 2019 [cited by applicant]
US 10354745B2 · Wong et al. · 2019 [cited by applicant]
US 10558930B2 · Noto et al. · 2020 [cited by applicant]
US 10679729B2 · Ball et al. · 2020 [cited by applicant]
US 12050629B1 · Noto · 2024 [cited by applicant]
US 20020019746A1 · Rienhoff et al. · 2002 [cited by applicant]
US 20020143578A1 · Cole et al. · 2002 [cited by applicant]
US 20030059808A1 · Liu et al. · 2003 [cited by applicant]
US 20030101000A1 · Bader et al. · 2003 [cited by applicant]
US 20030113727A1 · Girn et al. · 2003 [cited by applicant]
US 20030172065A1 · Sorenson et al. · 2003 [cited by applicant]
US 20040083226A1 · Eaton · 2004 [cited by applicant]
US 20040093334A1 · Scherer · 2004 [cited by applicant]
US 20040126840A1 · Cheng et al. · 2004 [cited by applicant]
US 20050089852A1 · Lee et al. · 2005 [cited by applicant]
US 20050147947A1 · Cookson et al. · 2005 [cited by applicant]
US 20050164704A1 · Winsor · 2005 [cited by applicant]
US 20050164705A1 · Rajkotia et al. · 2005 [cited by applicant]
US 20050192008A1 · Desai et al. · 2005 [cited by applicant]
US 20070050354A1 · Rosenberg · 2007 [cited by applicant]
US 20070260599A1 · McGuire et al. · 2007 [cited by applicant]
US 20080027656A1 · Parida · 2008 [cited by applicant]
US 20080040046A1 · Chakraborty et al. · 2008 [cited by applicant]
US 20080081331A1 · Myres et al. · 2008 [cited by applicant]
US 20080082955A1 · Andreessen et al. · 2008 [cited by applicant]
US 20080113727A1 · Vallejo et al. · 2008 [cited by applicant]
US 20080154566A1 · Myres et al. · 2008 [cited by applicant]
US 20080162510A1 · Baio et al. · 2008 [cited by applicant]
US 20080255768A1 · Martin et al. · 2008 [cited by applicant]
US 20090030985A1 · Yuan · 2009 [cited by applicant]
US 20110038512A1 · Petrou · 2011 [cited by examiner]
US 20120054190A1 · Peters · 2012 [cited by applicant]
US 20120191903A1 · Araki et al. · 2012 [cited by applicant]
US 20120283108A1 · Sampas · 2012 [cited by applicant]
US 20130085728A1 · Tang et al. · 2013 [cited by applicant]
US 20130149707A1 · Sorenson et al. · 2013 [cited by applicant]
US 20130297221A1 · Johnson et al. · 2013 [cited by applicant]
US 20140045705A1 · Bustamante et al. · 2014 [cited by applicant]
US 20140067355A1 · Noto et al. · 2014 [cited by applicant]
US 20140082568A1 · Hulet et al. · 2014 [cited by applicant]
US 20140108527A1 · Aravanis et al. · 2014 [cited by applicant]
US 20140278138A1 · Barber et al. · 2014 [cited by applicant]
US 20150019912A1 · Darling · 2015 [cited by examiner]
US 20160026755A1 · Byrnes et al. · 2016 [cited by applicant]
US 20170213127A1 · Duncan · 2017 [cited by applicant]
US 20170220738A1 · Barber et al. · 2017 [cited by applicant]
US 20170262577A1 · Ball et al. · 2017 [cited by applicant]
US 20170277827A1 · Granka et al. · 2017 [cited by applicant]
US 20190139623A1 · Bryc et al. · 2019 [cited by applicant]
US 20210034647A1 · Nguyen et al. · 2021 [cited by applicant]
US 20220300711A1 · Elisco · 2022 [cited by examiner]
US 20230019141A1 · Garrigan et al. · 2023 [cited by applicant]
US 20240411781A1 · Noto · 2024 [cited by applicant]
WO WO0217190A1 · 2002 [cited by applicant]
WO WO2012099890A1 · 2012 [cited by applicant]
WO WO2014145280A1 · 2014 [cited by applicant]
WO WO2016061260A1 · 2016 [cited by applicant]
WO WO2016061568A1 · 2016 [cited by applicant]
Allende, C. et al. “Treelink: Data Integration, Clustering and Visualization of Phylogenetic Trees.” BMC Bioinformatics, vol. 16, Dec. 2015, pp. 3-6. [cited by applicant]
Bettinger, B., “Clustering Shared Matches,” The Genetic Genealogist, Jan. 3, 2017, 16 pages, [online] [Retrieved on Sep. 2, 2020] Retrieved from the Internet <URL: https://thegeneticgenealogist.com/2017/01/03/clustering… [cited by applicant]
Browning, B. L. et al. “Fast Two-Stage Phasing of Large-Scale Sequence Data.” The American Journal of Human Genetics, vol. 108, Oct. 7, 2021, pp. 1880-1890. [cited by applicant]
Browning, B. L. et al., “Improving the Accuracy and Efficiency of Identity by Descent Detection in Population Data,” Genetics, Jun. 2013, pp. 459-471, vol. 194. [cited by applicant]
Browning, B. L. et al., “A Unified Approach to Genotype Imputation and Haplotype Phase Inference for Large Data sets of Trios and Unrelated Individuals,” The American Journal of Human Genetics, Feb. 13, 2009, pp. 210-22… [cited by applicant]
Browning, B.L et al., “Efficient Multilocus Association Testing for Whole Genome Association Studies Using Localized Haplotype Clustering,” Genetic Epidemiology, vol. 31, Feb. 26, 2007, pp. 365-375. [cited by applicant]
Browning, B.L. et al., “A Fast, Powerful Method for Detecting Identity by Descent,” The American Journal of Human Genetics, Feb. 11, 2011, vol. 88, No. 2, pp. 173-182. [cited by applicant]
Browning, S.R. et al., “Haplotype Phasing: Existing Models and New Developments,” Nature Reviews Genetics, Oct. 2011, pp. 703-714, vol. 12. [cited by applicant]
Browning, S.R. et al., “Rapid and Accurate Haplotype Phasing and Missing-Data Inference for Whole-Genome Association Studies by Use of Localized Haplotype Clustering,” American Journal of Human Genetics, vol. 81, Nov. 2… [cited by applicant]
Browning, S.R., “Multilocus Association Mapping Using Variable-Length Markov Chains,” American Journal of Human Genetics, Apr. 7, 2006, pp. 903-913, vol. 78, No. 6. [cited by applicant]
Cooper, K., “More Automated DNA Match Clustering!,” Kitty Cooper's Blog, Dec. 30, 2018, 13 pages, [Online] [Retrieved on Nov. 16, 2023] Retrieved from the Internet <URL:https://blog.kittycooper.com/2018/12/more-automate… [cited by applicant]
Delaneau, O. et al. Accurate, Scalable and Integrative Haplotype Estimation, Nature Communications, vol. 10, No. 1, Nov. 28, 2019, pp. 1-10. [cited by applicant]
Delaneau, O. et al. “Integrating Sequence and Array Data to Create an Improved 1000 Genomes Project Haplotype Reference Panel.” Nature Communications, vol. 5, Jun. 13, 2014, pp. 1-9. [cited by applicant]
DNA Painter, “Convert Autocluster Table to Spreadsheet Format,” Dec. 5, 2018, one pages, [Online] [Retrieved on Sep. 2, 2020] Retrieved from the Internet <URL:https://dnapainter.com/tools/convertac>. [cited by applicant]
Druet, T., et al., “A Hidden Markov Model Combining Linkage and Linkage Disequilibrium Information for Haplotype Reconstruction and Quantitative Trait Locus Fine Mapping,” Genetics, Mar. 2010, pp. 789-798, vol. 184, No.… [cited by applicant]
Dudoit, S. et al., “A score test for the linkage analysis of qualitative and quantitative traits based on identity by descent data from sib-pairs,” Biostatistics, vol. 1, Iss. 1, Mar. 2000, pp. 1-26. [cited by applicant]
Durand, E.Y. et al., “Reducing Pervasive False-Positive Identical-by-Descent Segments Detected by Large-Scale Pedigree Analysis,” Molecular Biology and Evolution, Apr. 30, 2014, pp. 2212-2222, vol. 31, No. 8. [cited by applicant]
Durbin, R. M. et al., “A Map of Human Genome Variation from Population-Scale Sequencing,” Nature, Oct. 28, 2010, pp. 1061-1073, vol. 467. [cited by applicant]
Elston, R.C. et al., “A General Model for the Genetic Analysis of Pedigree Data,” Human Heredity, 1971, pp. 523-542, vol. 21, No. 6. [cited by applicant]
European Patent Office, Extended European Search Report, European Patent Application No. 24175027.2, Jun. 27, 2024, six pages. [cited by applicant]
Falush, D. et al., “Inference of Population Structure Using Multilocus Genotype Data: Linked Loci and Correlated Allele Frequencies,” Genetics, vol. 164, Aug. 2003, pp. 1567-1587. [cited by applicant]
Genetic Affairs, “AutoCluster for Marcos Bradford—DNA account: Weimer Berkeley,” Genetic Affairs, Nov. 30, 2018, 4 pages, [Online] [Retrieved on Nov. 16, 2023] Retrieved from the Internet <URL:http://geneticaffairs.com/… [cited by applicant]
Griffiths, B., “Shared matches—matches who match both my paternal and maternal lines,” Not Just the PARRYs, Aug. 9, 2017, 5 pages, [Online] [Retrieved on Nov. 16, 2023] Retrieved from the Internet <URL:http://notjustthe… [cited by applicant]
Gusev, A. et al., “Whole Population, Genome-wide Mapping of Hidden Relatedness,” Genome Research, 2009, pp. 318-326, vol. 19. [cited by applicant]
Henn, B. M. et al. “Cryptic Distant Relatives are Common in Both Isolated and Cosmopolitan Genetic Samples.” PLoS One, vol. 7, No. 4, Apr. 2012, pp. 1-13. [cited by applicant]
Jarvis, J.P. et al., “Patterns of Ancestry of Natural Selection and Genetic Association with Stature in Western African Pygmies,” PLoS Genetics, vol. 8, Iss. 4, Apr. 26, 2012, pp. 1-15. [cited by applicant]
Kenny, E.E. et al., “Increased Power of Mixed Models Facilitates Association Mapping of 10 Loci for Metabolic Traits in an Isolated Population,” Human Molecular Genetics, Feb. 15, 2011, pp. 827-839, vol. 20, No. 4. [cited by applicant]
Kong, A. et al. “Detection of Sharing by Descent, Long-Range Phasing and Haplotype Imputation,” Nature Genetics, Author Manuscript, Sep. 2008, vol. 40, No. 9, pp. 1-22. [cited by applicant]
Lander, E.S. et al., “Construction of Multilocus Genetic Linkage Maps in Humans,” Proc. Nat. Acad. Sci., Apr. 1987, pp. 2363-2367, vol. 84. [cited by applicant]
Li, H. et al., “Relationship Estimation from Whole-Genome Sequence Data,” PLOS Genetics, Jan. 30, 2014, e1004144, pp. 1-12, vol. 10, No. 1. [cited by applicant]
Li, Y. et al., “Haplotype Reconstruction in Large Pedigrees with Untyped Individuals through IBD reference,” Journal of Computational Biology, Nov. 2011, vol. 18, No. 11, pp. 1411-1421. [cited by applicant]
Li, Y. et al., “MaCH: Using Sequence and Genotype Data to Estimate Haplotypes and Unobserved Genotype,” Genetic Epidemiology, Nov. 5, 2010, pp. 816-834, vol. 34, No. 8. [cited by applicant]
Livne, O.E. et al., “PRIMAL: Fast and Accurate Pedigree-based Imputation from sequence data in a Founder Population,” PLOS Computational Biology, Mar. 3, 2015, vol. 11, No. 3, pp. 1-14. [cited by applicant]
Loh, P-R. et al. “Reference-Based Phasing Using the Haplotype Reference Consortium Panel.” Nature Genetics, Author Manuscript, vol. 48, No. 11, Nov. 2016, pp. 1-20. [cited by applicant]
Meuwissen, T. et al., “The Use of Family Relationships and Linkage Disequilibrium to Impute Phase and Missing Genotypes in Up to Whole Genome Sequence Density Genotypic Data,” Genetics, Aug. 2010, pp. 1441-1449, vol. 18… [cited by applicant]
Morrison, A.C. et al., “Prediction of Coronary Heart Disease Risk using a Genetic Risk Score: The Atherosclerosis Risk in Communities Study,” American Journal of Epidemiology, vol. 166, No. 1, Apr. 18, 2007, pp. 28-35. [cited by applicant]
Naseri, A. et al. “RaPID: Ultra-Fast, Powerful, and Accurate Detection of Segments Identical by Descent (IBD) in Biobank-Scale Cohorts.” Genome Biology, vol. 20, Jul. 25, 2019, pp. 1-15. [cited by applicant]
Noto, K. et al. “Accurate Genome-Wide Phasing from IBD Data.” BMC Bioinformatics, vol. 23, Nov. 23, 2022, pp. 1-16. [cited by applicant]
Ott, J., “Estimation of the Recombination Fraction in Human Pedigrees: Efficient Computation of the Likelihood for Human Linkage Studies,” American Journal of Human Genetics, 1974, pp. 588-597, vol. 26, No. 5. [cited by applicant]
Palin, K. et al., “Identity-by-Descent-Based Phasing and Imputation in Founder Populations Using Graphical Models,” Genetic Epidemiology, vol. 35, Oct. 17, 2011, pp. 853-860. [cited by applicant]
PCT International Search Report and Written Opinion, PCT Application No. PCT/US2024/042974, Dec. 6, 2024, 16 pages. [cited by applicant]
Pedregosa, F. et al. “Scikit-learn: Machine Learning in Python.” Journal of Machine Learning Research, vol. 12, Oct. 2011, pp. 2825-2830. [cited by applicant]
Platt, J.C., “Probabilistic Outputs for Support Vector Machines and Comparisons to Regularized Likelihood Methods,” Mar. 26, 1999, pp. 1-11. [cited by applicant]
Price, A.L. et al., “Sensitive Detection of Chromosomal Segments of Distinct Ancestry in Admixed Populations,” PLoS Genetics, vol. 5, Iss. 6, Jun. 2009, pp. 1-18. [cited by applicant]
Purcell, S. et al., “PLINK: A tool set for whole-genome association and population-based linkage analyses,” The American Journal of Human Genetics, vol. 81, Sep. 2007, pp. 559-575. [cited by applicant]
Qian, Y. et al., “Efficient clustering of identity-by-descent between multiple individuals,” Bioinformatics, vol. 30, No. 7, Dec. 19, 2013, pp. 915-922. [cited by applicant]
Rabiner, L.R., “A Tutorial on Hidden Markov Models and Selected Applications in Speech Recognition,” Proceedings of the IEEE, vol. 77, No. 2, Feb. 1989, pp. 257-286. [cited by applicant]
Ramstetter, M. D. et al., “Inferring Identical-by-Descent Sharing of Sample Ancestors Promotes High-Resolution Relative Detection,” The American Journal of Human Genetics, vol. 103, Jul. 5, 2018, pp. 30-44. [cited by applicant]
Rocchi, M., et al., “Ancestral genomes reconstruction: An integrated, multi-disciplinary approach is needed,” Genome Research, Oct. 2006, pp. 1441-1444, vol. 16, No. 12. [cited by applicant]
Ron, D. et al., “On the Learnability and Usage of Acyclic Probabilistic Finite Automata,” Journal of Computer and System Sciences, vol. 56, 1998, pp. 133-152. [cited by applicant]
Scheet, P. et al., “A Fast and Flexible Statistical Model for Large-Scale Population Genotype Data: Applications to Inferring Missing Genotypes and Haplotypic Phase,” The American Journal of Human Genetics, vol. 78, Feb… [cited by applicant]
Seligsohn, U. et al., “Genetic Susceptibility to Venous Thrombosis,” The New England Journal of Medicine, vol. 344, No. 16, Apr. 19, 2001, pp. 1222-1231. [cited by applicant]
Speed, D. et al., “Relatedness in the post-genomic era: is it still useful?” Nature Reviews Genetics, Jan. 2015, vol. 16, No. 1, pp. 33-45. [cited by applicant]
Staples, J. et al., “PRIMUS: Rapid Reconstruction of Pedigrees from Genome-wide Estimates of Identity by Descent,” The American Journal of Human Genetics, vol. 95, Nov. 6, 2014, pp. 553-564. [cited by applicant]
Sticca, E. L. et al. “Current Developments in Detection of Identity-by-Descent Methods and Applications.” Frontiers in Genetics, vol. 12, Sep. 2021, pp. 1-6. [cited by applicant]
Sundquist, A. et al., “Effect of Genetic Divergence in Identifying Ancestral Origin using HAPAA,” Genome Res., vol. 18, Mar. 18, 2008, pp. 676-682. [cited by applicant]
Tewhey, R. et al. “The Importance of Phase Information for Human Genomics.” Nature Reviews Genetics, vol. 12, Mar. 2011, pp. 215-223. [cited by applicant]
The International Hapmap 3 Consortium, “Integrating common and rare genetic variation in diverse human populations,” Nature, vol. 467, Sep. 2, 2010, pp. 52-58. [cited by applicant]
Thompson, E. A. “Statistical Inference from Genetic Data on Pedigrees,” NSF-CBMS Regional Conference Series in Probability and Statistics, 2000, 186 pages, vol. 6. [cited by applicant]
Thompson, E.A., “Identity by Descent: Variation in Meiosis, Across Genomes, and in Populations,” Genetics, Jun. 2013, pp. 301-326, vol. 194. [cited by applicant]
Tipping, M.E., “Sparse Bayesian Learning and the Relevance Vector Machine,” Journal of Machine Learning Research, Jun. 2001, pp. 211-244. [cited by applicant]
Visscher, P.M et al., “Heritability in the genomics era-concepts and misconceptions,” Nature Reviews Genetics, Mar. 4, 2008, pp. 255-266. [cited by applicant]
Weedon, M.N. et al., “Combining Information from Common Type 2 Diabetes Risk Polymorphisms Improves Disease Prediction,” PLoS Med., vol. 3, Iss. 10, Oct. 2006, pp. 1877-1882. [cited by applicant]
Welch, B. L., “The Generalization of “Student's” Problem When Several Different Population Variances are Involved,” Biometrika, Jan. 1947, pp. 28-35, vol. 34, Issue 1-2. [cited by applicant]
Williams, A.L. et al., “Phasing of Many Thousands of Genotyped Samples,” American Journal of Human Genetics, Aug. 10, 2012, pp. 238-251, vol. 91, No. 2. [cited by applicant]
Yang, Q. et al., “Improving the Prediction of Complex Diseases by Testing for Multiple Disease-Susceptibility Genes,” American Journal of Human Genetics, vol. 72, Feb. 14, 2003, pp. 636-649. [cited by applicant]
Yoon, B-J., “Hidden Markov Models and their Applications in Biological Sequence Analysis,” Current Genomics, vol. 10, Sep. 2009, pp. 402-415. [cited by applicant]
youtube.com, “Merry DNA Christmas—Family History Fanatics Live,” Family History Fanatics, Dec. 14, 2018, one page, [Online] [Retrieved on Nov. 16, 2023] Retrieved from the Internet <URL: https://www.youtube.com/watch?v … [cited by applicant]