Maximum likelihood resolution of multi-block genotypes

Gad Kimmel*, Ron Shamir

*Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review

25 Scopus citations

Abstract

We present a new algorithm for the problems of genotype phasing and block partitioning. Our algorithm is based on a new stochastic model, and on the novel concept of probabilistic common haplotypes. We formulate the goals of genotype resolving and block partitioning as a maximum likelihood problem, and solve it by an EM algorithm. When applied to real biological SNP data, our algorithm outperforms two state of the art phasing algorithms. Our algorithm is also considerably more sensitive and accurate than a previous method in predicting and identifying disease association.

Original languageEnglish
Pages2-9
Number of pages8
DOIs
StatePublished - 2004
EventRECOMB 2004 - Proceedings of the Eight Annual International Conference on Research in Computational Molecular Biology - San Diego, CA., United States
Duration: 27 Mar 200431 Mar 2004

Conference

ConferenceRECOMB 2004 - Proceedings of the Eight Annual International Conference on Research in Computational Molecular Biology
Country/TerritoryUnited States
CitySan Diego, CA.
Period27/03/0431/03/04

Keywords

  • Algorithm
  • Disease association
  • Genotype
  • Genotype phasing
  • Haplotype
  • Haplotype block
  • Haplotype resolution
  • Maximum likelihood
  • SNP

Fingerprint

Dive into the research topics of 'Maximum likelihood resolution of multi-block genotypes'. Together they form a unique fingerprint.

Cite this