Article

An average-case sublinear exact Li and Stephens forward algorithm

2018-05-15

Abstract excerpt

Hidden Markov models of haplotype inheritance such as the Li and Stephens model allow for computationally tractable probability calculations using the forward algorithms as long as the representative reference panel used in the model is sufficiently small. Specifically, the monoploid Li and Stephens model and its variants are linear in reference panel size unless heuristic approximations are used. However, sequenc...

Topics

Open a Topic to create a Post that cites this publication.

Identifiers and source

Literature Corpus work: 8828230c-8ae9-5f8d-9fad-c907c754bdaf
DOI: 10.1101/322396

Open publication

Related research

Semantic proximity does not establish scientific evidence.

Click a neighbor to travelStep 1 · 10 closest

An average-case sublinear exact Li and Stephens forward algorithmDOI 10.1101/322396Read

Minimal positional substring cover is a haplotype threading alternative to Li and Stephens model.Semantic proximity Read

HAPLOFREQ--estimating haplotype frequencies efficiently.Semantic proximity Read

Linear Time Algorithms to Construct Populations Fitting Multiple Constraint Distributions at Genomic Scales.Semantic proximity Read

A model-based approach to selection of tag SNPs.Semantic proximity Read

Accelerated gene counting for haplotype frequency estimation.Semantic proximity Read

Learning-based parallel acceleration for HaplotypeCaller.Semantic proximity Read

Approximation properties of haplotype tagging.Semantic proximity Read

Technical note: determining peeling order using sparse matrix algorithms.Semantic proximity Read

A note on efficient computation of haplotypes via perfect phylogeny.Semantic proximity Read

Toward an algebraic understanding of haplotype inference by pure parsimony.Semantic proximity Read