Skip Navigation


Bioinformatics Advance Access originally published online on May 16, 2008
Bioinformatics 2008 24(14):1596-1602; doi:10.1093/bioinformatics/btn236
This Article
Right arrow Full Text
Right arrow Full Text (Print PDF)
Right arrow All Versions of this Article:
24/14/1596    most recent
btn236v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Ayers, K. L.
Right arrow Articles by Lange, K.
PubMed
Right arrow PubMed Citation
Right arrow Articles by Ayers, K. L.
Right arrow Articles by Lange, K.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2008. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Penalized estimation of haplotype frequencies

Kristin L. Ayers 1,* and Kenneth Lange 1,2,3,*

1Department of Biomathematics, 2Department of Human Genetics and 3Department of Statistics, University of California, Los Angeles, CA 90095, USA

*To whom correspondence should be addressed.


  Abstract

Motivation: Low haplotype diversity and linkage disequilibrium are the rule in short genomic segments. This fact suggests that parsimony should be enforced in estimation of haplotype frequencies. The current article introduces a diversity penalty that automatically discards potential haplotypes with low explanatory power. The standard EM algorithm for haplotype frequency estimation can accommodate the penalty if one passes over to a more general minorize–maximize (MM) scheme for estimation.

Results: Our new MM algorithm converges in fewer iterations, eliminates marginal haplotypes from further consideration and reduces the computational complexity of each iteration. Estimation by the MM algorithm also improves haplotyping and genotype imputation compared to naive application of the EM algorithm. Thus, the MM algorithm is a useful substitute for the EM algorithm. Compared to the most sophisticated current methods of haplotyping and genotype imputation, the MM algorithm is slightly less accurate but at least an order of magnitude faster.

Availability: Our software will be made available in the next release the program Mendel at http://www.genetics.ucla.edu/software/.

Contact: kayers{at}ucla.edu

Associate Editor: Martin Bishop

Received on March 29, 2008; revised on May 13, 2008; accepted on May 14, 2008

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.