Maximum likelihood pedigree reconstruction using integer programming
Keyword(s):
Pedigrees are `family trees' relating groups of individuals which can usefully be seen as Bayesian networks. The problem of finding a maximum likelihood pedigree from genotypic data is encoded as an integer linear programming problem. Two methods of ensuring that pedigrees are acyclic are considered. Results on obtaining maximum likelihood pedigrees relating 20, 46 and 59 individuals are presented. Running times for larger pedigrees depend strongly on the data used but generally compare well with those in the literature. Solving is particularly fast when allele frequency is uniform.
2019 ◽
Vol 75
(1)
◽
pp. 143-161
◽
2013 ◽
Vol 55
(3)
◽
pp. 491-506
◽
1997 ◽
Vol 25
(10)
◽
pp. 63-76
◽
2009 ◽
Vol 37
(2)
◽
pp. 114-116
◽
2019 ◽
Vol 55
(6)
◽
pp. 949-957
◽
2011 ◽
Vol 51
(3)
◽
pp. 463-471
◽
2012 ◽
Vol 8
(1)
◽