activity
20102016
most citedEfficient Continuous-Time Markov Chain Estimation

19 citations · 24 across the 7 of their papers we have counts for

collaborators

7 papers

q-bio.QM2016

Non-Identifiable Pedigrees and a Bayesian Solution

B. Kirkpatrick

Some methods aim to correct or test for relationships or to reconstruct the pedigree, or family tree. We show that these methods cannot resolve ties for correct relationships due t…

q-bio.QM2016★ 2 cited

Correcting for Cryptic Relatedness in Genome-Wide Association Studies

Bonnie Kirkpatrick, Alexandre Bouchard-Côté

While the individuals chosen for a genome-wide association study (GWAS) may not be closely related to each other, there can be distant (cryptic) relationships that confound the evi…

cs.DS2016

Fast Computation of the Kinship Coefficients

Bonnie Kirkpatrick

For families, kinship coefficients are quantifications of the amount of genetic sharing between a pair of individuals. These coefficients are critical for understanding the breedin…

cs.DS2016

Haplotype Inference for Pedigrees with Few Recombinations

Bonnie Kirkpatrick

Pedigrees, or family trees, are graphs of family relationships that are used to study inheritance. A fundamental problem in computational biology is to find, for a pedigree with $n…

stat.CO2013★ 19 cited

Efficient Continuous-Time Markov Chain Estimation

Monir Hajiaghayi, Bonnie Kirkpatrick, Liangliang Wang +1

Many problems of practical interest rely on Continuous-time Markov chains~(CTMCs) defined over combinatorial state spaces, rendering the computation of transition probabilities, an…

math.PR2012★ 2 cited

Optimal State-Space Reduction for Pedigree Hidden Markov Models

Bonnie Kirkpatrick, Kay Kirkpatrick

To analyze whole-genome genetic data inherited in families, the likelihood is typically obtained from a Hidden Markov Model (HMM) having a state space of 2^n hidden states where n…