License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.WABI.2018.9
URN: urn:nbn:de:0030-drops-93116
URL: http://drops.dagstuhl.de/opus/volltexte/2018/9311/
Go to the corresponding LIPIcs Volume Portal


Rosen, Yohei M. ; Paten, Benedict J.

An Average-Case Sublinear Exact Li and Stephens Forward Algorithm

pdf-format:
LIPIcs-WABI-2018-9.pdf (1 MB)


Abstract

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, sequencing projects numbering in the thousands to hundreds of thousands of individuals are underway, and others numbering in the millions are anticipated. To make the Li and Stephens forward algorithm for these datasets computationally tractable, we have created a numerically exact version of the algorithm with observed average case O(nk^{0.35}) runtime in number of genetic sites n and reference panel size k. This avoids any tradeoff between runtime and model complexity. We demonstrate that our approach also provides a succinct data structure for general purpose haplotype data storage. We discuss generalizations of our algorithmic techniques to other hidden Markov models.

BibTeX - Entry

@InProceedings{rosen_et_al:LIPIcs:2018:9311,
  author =	{Yohei M. Rosen and Benedict J. Paten},
  title =	{{An Average-Case Sublinear Exact Li and Stephens Forward Algorithm}},
  booktitle =	{18th International Workshop on Algorithms in  Bioinformatics (WABI 2018)},
  pages =	{9:1--9:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-082-8},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{113},
  editor =	{Laxmi Parida and Esko Ukkonen},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/9311},
  URN =		{urn:nbn:de:0030-drops-93116},
  doi =		{10.4230/LIPIcs.WABI.2018.9},
  annote =	{Keywords: Haplotype, Hidden Markov Model, Forward Algorithm, Lazy Evaluation}
}

Keywords: Haplotype, Hidden Markov Model, Forward Algorithm, Lazy Evaluation
Seminar: 18th International Workshop on Algorithms in Bioinformatics (WABI 2018)
Issue Date: 2018
Date of publication: 26.07.2018


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI