Bioinformatics Advance Access published online on October 9, 2008
Bioinformatics, doi:10.1093/bioinformatics/btn519
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
A better block partition and ligation strategy for individual haplotyping
1Department of Computer Science, University of Science and Technology of China, Hefei, Anhui 230027, P.R. China, 2Anhui Province-MOST Co-Key Laboratory of High Performance Computing and Its Application
*To whom correspondence should be addressed. Yuzhong Zhao, E-mail: zyzh{at}mail.ustc.edu.cn
| Abstract |
|---|
Motivation: Haplotype played an important role in the association studies of disease gene and drug responsivity over the past years, but the low throughput of expensive biological experiments largely limited its application. Alternatively, some efficient statistical methods were developed to deduce haplotypes from genotypes directly. Because these algorithms usually needed to estimate the frequencies of numerous possible haplotypes, the partition and ligation strategy was widely adopted to reduce the time complexity. The haplotypes were usually partitioned uniformly in the past, but recent studies showed that the haplotypes had their own block structure, which may be not uniform. More reasonable block partition and ligation strategy according to the haplotype structure may further improve the accuracy of individual haplotyping.
Results: In this paper, we presented a simple algorithm for block partition and ligation, which provided better accuracy for individual haplotyping. The block partition and ligation could be completed within O(m2 logm + m2n) time complexity, where m represented the length of genotypes and n represented the number of individuals. We tested the performance of our algorithm on both real and simulated data set. The result showed that our algorithm yielded better accuracy with short running time.
Availability: The software is publicly available at http://mail.ustc.edu.cn/~zyzh.
Contact: zyzh{at}mail.ustc.edu.cn
Associate Editor: Dr. Alex Bateman
Received on April 15, 2008; revised on August 10, 2008; accepted on October 4, 2008