Skip Navigation


Bioinformatics Advance Access originally published online on October 25, 2005
Bioinformatics 2005 21(24):4384-4393; doi:10.1093/bioinformatics/bti732
This Article
Right arrow Full Text Freely available
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow All Versions of this Article:
21/24/4384    most recent
bti732v1
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 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 arrow Search for citing articles in:
ISI Web of Science (7)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Li, J.
Right arrow Articles by Jiang, T.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Li, J.
Right arrow Articles by Jiang, T.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2005. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions{at}oxfordjournals.org

Haplotype-based linkage disequilibrium mapping via direct data mining

Jing Li 1,* and Tao Jiang 2,3,4

1Electrical Engineering and Computer Science Department, Case Western Reserve University Cleveland, OH 44106, USA
2Department of Computer Science and Engineering, University of California Riverside, CA 92521, USA
3Center for Advanced Study, Tsinghua University Beijing, China
4Shanghai Center for Bioinformatics Technology Shanghai, China

*To whom correspondence should be addressed.

Motivation: With the availability of large-scale, high-density single-nucleotide polymorphism markers and information on haplotype structures and frequencies, a great challenge is how to take advantage of haplotype information in the association mapping of complex diseases in case–control studies.

Results: We present a novel approach for association mapping based on directly mining haplotypes (i.e. phased genotype pairs) produced from case–control data or case–parent data via a density-based clustering algorithm, which can be applied to whole-genome screens as well as candidate-gene studies in small genomic regions. The method directly explores the sharing of haplotype segments in affected individuals that are rarely present in normal individuals. The measure of sharing between two haplotypes is defined by a new similarity metric that combines the length of the shared segments and the number of common alleles around any marker position of the haplotypes, which is robust against recent mutations/genotype errors and recombination events. The effectiveness of the approach is demonstrated by using both simulated datasets and real datasets. The results show that the algorithm is accurate for different population models and for different disease models, even for genes with small effects, and it outperforms some recently developed methods.

Availability: The software, HapMiner, and Supplementary materials are available on the authors' website at http://vorlon.case.edu/~jxl175/HapMiner.html

Contact: jingli{at}eecs.case.edu


Received on August 17, 2005; revised on October 4, 2005; accepted on October 19, 2005

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
S.-Y. Su, D. J. Balding, and L. J.M. Coin
Disease association tests by inferring ancestral haplotypes using a hidden markov model
Bioinformatics, April 1, 2008; 24(7): 972 - 978.
[Abstract] [Full Text] [PDF]


Home page
Brief BioinformHome page
G. Montana
Statistical methods in genetics.
Brief Bioinform, September 1, 2006; 7(3): 297 - 308.
[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.