Timezone: »
Pedigrees, or family trees, are directed graphs used to identify sites of the genome that are correlated with the presence or absence of a disease. With the advent of genotyping and sequencing technologies, there has been an explosion in the amount of data available, both in the number of individuals and in the number of sites. Some pedigrees number in the thousands of individuals. Meanwhile, analysis methods have remained limited to pedigrees of <100 individuals which limits analyses to many small independent pedigrees. Disease models, such those used for the linkage analysis log-odds (LOD) estimator, have similarly been limited. This is because linkage anlysis was originally designed with a different task in mind, that of ordering the sites in the genome, before there were technologies that could reveal the order. LODs are difficult to interpret and nontrivial to extend to consider interactions among sites. These developments and difficulties call for the creation of modern methods of pedigree analysis. Drawing from recent advances in graphical model inference and transducer theory, we introduce a simple yet powerful formalism for expressing genetic disease models. We show that these disease models can be turned into accurate and efficient estimators. The technique we use for constructing the variational approximation has potential applications to inference in other large-scale graphical models. This method allows inference on larger pedigrees than previously analyzed in the literature, which improves disease site prediction.
Author Information
Bonnie Kirkpatrick (University of British Columbia)
Alexandre Bouchard-Côté (UBC)
More from the Same Authors
-
2022 Poster: Parallel Tempering With a Variational Reference »
Nikola Surjanovic · Saifuddin Syed · Alexandre Bouchard-Côté · Trevor Campbell -
2012 Poster: Entangled Monte Carlo »
Seong-Hwan Jun · Liangliang Wang · Alexandre Bouchard-Côté -
2012 Spotlight: Entangled Monte Carlo »
Seong-Hwan Jun · Liangliang Wang · Alexandre Bouchard-Côté -
2011 Poster: Priors over Recurrent Continuous Time Processes »
Ardavan Saeedi · Alexandre Bouchard-Côté -
2011 Oral: Priors over Recurrent Continuous Time Processes »
Ardavan Saeedi · Alexandre Bouchard-Côté -
2010 Spotlight: Variational Inference over Combinatorial Spaces »
Alexandre Bouchard-Côté · Michael Jordan -
2010 Poster: Variational Inference over Combinatorial Spaces »
Alexandre Bouchard-Côté · Michael Jordan -
2009 Poster: Randomized Pruning: Efficiently Calculating Expectations in Large Dynamic Programs »
Alexandre Bouchard-Côté · Slav Petrov · Dan Klein -
2009 Spotlight: Randomized Pruning: Efficiently Calculating Expectations in Large Dynamic Programs »
Alexandre Bouchard-Côté · Slav Petrov · Dan Klein -
2008 Poster: Efficient Inference in Phylogenetic InDel Trees »
Alexandre Bouchard-Côté · Michael Jordan · Dan Klein -
2008 Spotlight: Efficient Inference in Phylogenetic InDel Trees »
Alexandre Bouchard-Côté · Michael Jordan · Dan Klein -
2007 Poster: A Probabilistic Approach to Language Change »
Alexandre Bouchard-Côté · Percy Liang · Tom Griffiths · Dan Klein