Journal Article10.1002/GEPI.21686
Maximum likelihood pedigree reconstruction using integer linear programming.
77
TL;DR: This work proposes to exploit an integer linear programming optimisation approach to pedigree learning, which is adapted to find valid pedigrees by imposing appropriate constraints, and is guaranteed to return a maximum likelihood pedigree.
read more
Abstract: Large population biobanks of unrelated individuals have been highly successful in detecting common genetic variants affecting diseases of public health concern. However, they lack the statistical power to detect more modest gene-gene and gene-environment interaction effects or the effects of rare variants for which related individuals are ideally required. In reality, most large population studies will undoubtedly contain sets of undeclared relatives, or pedigrees. Although a crude measure of relatedness might sometimes suffice, having a good estimate of the true pedigree would be much more informative if this could be obtained efficiently. Relatives are more likely to share longer haplotypes around disease susceptibility loci and are hence biologically more informative for rare variants than unrelated cases and controls. Distant relatives are arguably more useful for detecting variants with small effects because they are less likely to share masking environmental effects. Moreover, the identification of relatives enables appropriate adjustments of statistical analyses that typically assume unrelatedness. We propose to exploit an integer linear programming optimisation approach to pedigree learning, which is adapted to find valid pedigrees by imposing appropriate constraints. Our method is not restricted to small pedigrees and is guaranteed to return a maximum likelihood pedigree. With additional constraints, we can also search for multiple high-probability pedigrees and thus account for the inherent uncertainty in any particular pedigree reconstruction. The true pedigree is found very quickly by comparison with other methods when all individuals are observed. Extensions to more complex problems seem feasible.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
What's Next? [The end of Moore's law]
TL;DR: The end of Moore's law may be the best thing that has happened in computing since the beginning ofMoore's law and should enable a new era of creativity by encouraging computer scientists to invent new biologically inspired paradigms, implemented on emerging architectures.
178
PRIMUS: rapid reconstruction of pedigrees from genome-wide estimates of identity by descent.
Jeffrey Staples,Dandi Qiao,Michael H. Cho,Michael H. Cho,Edwin K. Silverman,Edwin K. Silverman,Deborah A. Nickerson,Jennifer E. Below +7 more
TL;DR: A method that uses genome-wide estimates of pairwise identity by descent to identify families and quickly reconstruct and score all possible pedigrees that fit the genetic data by using up to third-degree relatives is developed and included in the software package PRIMUS (Pedigree Reconstruction and Identification of the Maximally Unrelated Set).
171
•Proceedings Article
Advances in Bayesian network learning using integer programming
Mark Barlett,James Cussens +1 more
- 11 Aug 2013
TL;DR: After relating this BN learning problem to set covering and the multidimensional 0-1 knapsack problem, the various steps taken to allow efficient solving of this IP are described.
•Posted Content
Advances in Bayesian Network Learning using Integer Programming
Mark Bartlett,James Cussens +1 more
TL;DR: In this paper, the problem of learning Bayesian networks (BNs) from complete discrete data is formulated as an integer program, and various steps are taken to allow efficient solving of this IP.
73
Strategies for determining kinship in wild populations using genetic data.
Veronika Städele,Linda Vigilant +1 more
TL;DR: Although analysis of highly variable microsatellite loci is still the dominant approach for studies on wild populations, it is described how the long‐awaited use of large‐scale single‐nucleotide polymorphism and sequencing data derived from noninvasive low‐quality samples may eventually lead to highly accurate assessments of varying degrees of kinship in wild populations.
70
References
Reducibility Among Combinatorial Problems.
Richard M. Karp
- 01 Jan 1972
TL;DR: Throughout the 1960s I worked on combinatorial optimization problems including logic circuit design with Paul Roth and assembly line balancing and the traveling salesman problem with Mike Held, which made me aware of the importance of distinction between polynomial-time and superpolynomial-time solvability.
13.6K
Reducibility Among Combinatorial Problems
TL;DR: The work of Dantzig, Fulkerson, Hoffman, Edmonds, Lawler and other pioneers on network flows, matching and matroids acquainted me with the elegant and efficient algorithms that were sometimes possible.
8.7K
•Book
Integer programming
George L. Nemhauser,Laurence A. Wolsey +1 more
- 01 Jan 1972
TL;DR: The principles of integer programming are directed toward finding solutions to problems from the fields of economic planning, engineering design, and combinatorial optimization as mentioned in this paper, which is a standard of graduate-level courses since 1972.
4.6K
Bayesian Model Averaging: A Tutorial
TL;DR: Bayesian model averaging (BMA) provides a coherent mechanism for ac- counting for this model uncertainty and provides improved out-of- sample predictive performance.
Computing Bayes Factors by Combining Simulation and Asymptotic Approximations
TL;DR: In this article, the authors compare several methods of estimating Bayes factors when it is possible to simulate observations from the posterior distributions, via Markov chain Monte Carlo or other techniques, provided that each posterior distribution is well behaved in the sense of having a single dominant mode.
2.2K