Improved maximum likelihood reconstruction of complex multi-generational pedigrees

Abstract

The reconstruction of pedigrees from genetic marker data is relevant to a wide range of applications. Likelihood-based approaches aim to find the pedigree structure that gives the highest probability to the observed data. Existing methods either entail an exhaustive search, and are hence restricted to small numbers of individuals, or they take a more heuristic approach and deliver a solution that will probably have high likelihood but is not guaranteed to be optimal. By encoding the pedigree learning problem as an integer linear program we can exploit efficient optimisation algorithms to construct pedigrees guaranteed to have maximal likelihood for the standard situation where we have complete marker data at unlinked loci and segregation of genes from parents to offspring is Mendelian. Previous work demonstrated efficient reconstruction of pedigrees of up to about 100 individuals. The modified method that we present here is not so restricted: we demonstrate its applicability with simulated data on a real human pedigree structure of over 1600 individuals. It also compares well with a very competitive approximate approach in terms of solving time and accuracy. In addition to identifying a maximum likelihood pedigree, we can obtain any number of pedigrees in decreasing order of likelihood. This is useful for assessing the uncertainty of a maximum likelihood solution and permits model averaging over high likelihood pedigrees when this would be appropriate. More importantly, when the solution is not unique, as will often be the case for large pedigrees, it enables investigation into the properties of maximum likelihood pedigree estimates * Corresponding author: Department of Health Sciences, University of Leicester, 2nd Floor Adrian Building, University Road, Leicester LE1 7RH, UK Email address: nas11@le.ac.uk (Nuala A Sheehan)Preprint submitted to Theoretical Population Biology July 21, 2014 which has not been possible up to now. Crucially, we also have a means of assessing the behaviour of other approximate approaches which all aim to find a maximum likelihood solution. Our approach hence allows us to properly address the question of whether a reasonably high likelihood solution that is easy to obtain is practically as useful as a guaranteed maximum likelihood solution. The efficiency of our method on such large problems bodes well for extensions beyond the standard setting where some pedigree members may be latent, genotypes may be measured with error and markers may be linked.

On the use of dense SNP marker data for the identification of distant relative pairs

“…name/) for a related problem of maximising likelihood ratios for forensic identification cases and is restricted in practice to small numbers (about 12) of individuals [18]. A dynamic programming approach can yield a maximum likelihood solution for pedigrees of up to 30 individuals [13] while recent work exploiting efficient integer linear programming optimisation algorithms to perform a complete search can deliver a guaranteed maximum likelihood pedigree for over a thousand individuals [15,46]. Both the above make simplifying assumptions about the genetic model and, crucially, require complete data, by which we mean that all pedigree members are present in the genotyped sample.…”

Toward a Multisubject Analysis of Neural Connectivity

“…Our ongoing research focuses on reducing this computational burden so that exact estimation becomes feasible for much larger datasets that include hundreds of neural regions. Recent advances in estimation of single DAGs involving thousands of nodes suggests that much progress can be made in this direction (Bartlett and Cussens, 2013; Sheehan et al , 2014). …”

Integer Linear Programming for the Bayesian network structure learning problem

“…These scores have the property of local decomposability, meaning that the global score can be found as a simple function of the score associated with each node. In the current paper, we restrict ourselves to consideration of the BDeu score, though we note that the software presented has been used to learn networks based on other scores [8][9][10].…”