Bioinformatics Vol. 19 no. 14 2003
Pages 1773-1780
© 2003 Oxford University Press
Haplotype inference by maximum parsimony
1 Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong, People's Republic of China and 2 Department of Computer Science, Peking University, Beijing 100871, People's Republic of China
Received on December 26, 2002
; revised on March 10, 2003
; accepted on March 31, 2003
Motivation: Haplotypes have been attracting increasing attention because of their importance in analysis of many fine-scale molecular-genetics data. Since direct sequencing of haplotype via experimental methods is both time-consuming and expensive, haplotype inference methods that infer haplotypes based on genotype samples become attractive alternatives.
Results: (1) We design and implement an algorithm for an important computational model of haplotype inference that has been suggested before in several places. The model finds a set of minimum number of haplotypes that explains the genotype samples. (2) Strong supports of this computational model are given based on the computational results on both real data and simulation data. (3) We also did some comparative study to show the strength and weakness of this computational model using our program.
Availability: The software HAPAR is free for non-commercial uses. Available upon request (lwang{at}cs.cityu.edu.hk).
Contact: http://lwang{at}cs.citu.edu.hk
* To whom correspondence should be addressed.
![]()
CiteULike
Connotea
Del.icio.us What's this?
This article has been cited by other articles:
![]() |
P. Librado and J. Rozas DnaSP v5: a software for comprehensive analysis of DNA polymorphism data Bioinformatics, June 1, 2009; 25(11): 1451 - 1452. [Abstract] [Full Text] [PDF] |
||||
![]() |
G. Lancia and P. Serafini A Set-Covering Approach with Column Generation for Parsimony Haplotyping INFORMS Journal on Computing, January 1, 2009; 21(1): 151 - 166. [Abstract] [PDF] |
||||
![]() |
S. Climer, G. Jager, A. R. Templeton, and W. Zhang How frugal is mother nature with haplotypes? Bioinformatics, January 1, 2009; 25(1): 68 - 74. [Abstract] [Full Text] [PDF] |
||||
![]() |
Y. Zhao, Y. Xu, Z. Wang, H. Zhang, and G. Chen A better block partition and ligation strategy for individual haplotyping Bioinformatics, December 1, 2008; 24(23): 2720 - 2725. [Abstract] [Full Text] [PDF] |
||||
![]() |
X.-M. Zhao, R.-S. Wang, L. Chen, and K. Aihara Uncovering signal transduction networks from high-throughput data by integer linear programming Nucleic Acids Res., May 1, 2008; 36(9): e48 - e48. [Abstract] [Full Text] [PDF] |
||||
![]() |
S. J. Lindsay, J. K. Bonfield, and M. E. Hurles Shotgun haplotyping: a novel method for surveying allelic sequence variation Nucleic Acids Res., October 12, 2005; 33(18): e152 - e152. [Abstract] [Full Text] [PDF] |
||||
![]() |
Z. Li, W. Zhou, X.-S. Zhang, and L. Chen A parsimonious tree-grow method for haplotype inference Bioinformatics, September 1, 2005; 21(17): 3475 - 3481. [Abstract] [Full Text] [PDF] |
||||
![]() |
R.-S. Wang, L.-Y. Wu, Z.-P. Li, and X.-S. Zhang Haplotype reconstruction from SNP fragments by minimum error correction Bioinformatics, May 15, 2005; 21(10): 2456 - 2462. [Abstract] [Full Text] [PDF] |
||||


