SDPHapInfer / LongHapInfer

:: DESCRIPTION

The SDPHapInfer formulates the haplotype inference problem as the following integer quadratic programming (IQP) problem. The objective function is to minimize the number of haplotypes, and the constraint functions are to resolve each genotype.

LongHapInfer partitions the genotypes into segments, infers subhaplotypes for each segment, and concatenates subhaplotypes in different segments for the final solution.

::DEVELOPER

Kun-Mao Chao

:: SCREENSHOTS

N/A

:: REQUIREMENTS

• Linux / Windows / MacOsX
• Matlab 

:: DOWNLOAD

 SDPHapInfer / LongHapInfer

:: MORE INFORMATION

Citation

Huang, Y.-T., Chao, K.-M., and Chen, T., 2005,
“An Approximation Algorithm for Haplotype Inference by Maximum Parsimony,”
Journal of Computational Biology, 12: 1261-1274.