Skip Navigation


Bioinformatics Advance Access originally published online on February 23, 2008
Bioinformatics 2008 24(7):972-978; doi:10.1093/bioinformatics/btn071
This Article
Right arrow Full Text Freely available
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow Supplementary Data
Right arrow All Versions of this Article:
24/7/972    most recent
btn071v1
Right arrow Comments: Submit a response
Right arrow Alert me when this article is cited
Right arrow Alert me when Comments are posted
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 ISI Web of Science
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 Su, S.-Y.
Right arrow Articles by Coin, L. J.M.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Su, S.-Y.
Right arrow Articles by Coin, L. J.M.
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

Disease association tests by inferring ancestral haplotypes using a hidden markov model

Shu-Yi Su , David J. Balding and Lachlan J.M. Coin *

Department of Epidemiology and Public Health, Imperial College, London W2 1PG, UK

*To whom correspondence should be addressed.


   Abstract

Motivation: Most genome-wide association studies rely on single nucleotide polymorphism (SNP) analyses to identify causal loci. The increased stringency required for genome-wide analyses (with per-SNP significance threshold typically {approx} 10–7) means that many real signals will be missed. Thus it is still highly relevant to develop methods with improved power at low type I error. Haplotype-based methods provide a promising approach; however, they suffer from statistical problems such as abundance of rare haplotypes and ambiguity in defining haplotype block boundaries.

Results: We have developed an ancestral haplotype clustering (AncesHC) association method which addresses many of these problems. It can be applied to biallelic or multiallelic markers typed in haploid, diploid or multiploid organisms, and also handles missing genotypes. Our model is free from the assumption of a rigid block structure but recognizes a block-like structure if it exists in the data. We employ a Hidden Markov Model (HMM) to cluster the haplotypes into groups of predicted common ancestral origin. We then test each cluster for association with disease by comparing the numbers of cases and controls with 0, 1 and 2 chromosomes in the cluster. We demonstrate the power of this approach by simulation of case-control status under a range of disease models for 1500 outcrossed mice originating from eight inbred lines. Our results suggest that AncesHC has substantially more power than single-SNP analyses to detect disease association, and is also more powerful than the cladistic haplotype clustering method CLADHC.

Availability: The software can be downloaded from http://www.imperial.ac.uk/medicine/people/l.coin

Contact: I.coin{at}imperial.ac.uk

Supplementary Information: Supplementary data are available at Bioinformatics online.

Associate Editor: Martin Bishop


Received on January 9, 2008; revised on February 5, 2008; accepted on February 11, 2008

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


This article has been cited by other articles:


Home page
BioinformaticsHome page
M. Li, K. Wang, S. F. A. Grant, H. Hakonarson, and C. Li
ATOM: a powerful gene-based association test by combining optimally weighted markers
Bioinformatics, February 15, 2009; 25(4): 497 - 503.
[Abstract] [Full Text] [PDF]



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.