Hidden Markov Modelling Techniques for Haplotype Analysis

Abstract

A hidden Markov model is introduced for descriptive modelling the mosaic–like structures of haplotypes, due to iterated recombinations within a population. Methods using the minimum description length principle are given for fitting such models to training data. Possible applications of the models are delineated, and some preliminary analysis results on real sets of haplotypes are reported, demonstrating the potential of our methods.

Cite

Text

Koivisto et al. "Hidden Markov Modelling Techniques for Haplotype Analysis." International Conference on Algorithmic Learning Theory, 2004. doi:10.1007/978-3-540-30215-5_4

Markdown

[Koivisto et al. "Hidden Markov Modelling Techniques for Haplotype Analysis." International Conference on Algorithmic Learning Theory, 2004.](https://mlanthology.org/alt/2004/koivisto2004alt-hidden/) doi:10.1007/978-3-540-30215-5_4

BibTeX

@inproceedings{koivisto2004alt-hidden,
  title     = {{Hidden Markov Modelling Techniques for Haplotype Analysis}},
  author    = {Koivisto, Mikko and Kivioja, Teemu and Mannila, Heikki and Rastas, Pasi and Ukkonen, Esko},
  booktitle = {International Conference on Algorithmic Learning Theory},
  year      = {2004},
  pages     = {37-52},
  doi       = {10.1007/978-3-540-30215-5_4},
  url       = {https://mlanthology.org/alt/2004/koivisto2004alt-hidden/}
}