Heu-MCHC is a fast and accurate heuristic algorithm for the Minimum-Change Haplotype Configuration (MCHC) problem, i.e. a combinatorial formulation of the haplotype inference problem on pedigree data where the total number of recombinations and point mutations has to be minimized.
Heu-MCHC has been designed and implemented by Yuri Pirola under the supervision of Tao Jiang.
Please refer to the main project page for download, installation, and usage instructions.
Please cite the following paper when using Heu-MCHC:
Yuri Pirola, Paola Bonizzoni, and Tao Jiang.
An Efficient Algorithm for Haplotype Inference on Pedigrees with Recombinations and Mutations.
IEEE/ACM Transactions on Computational Biology and Bioinformatics, 9(1), pp. 12-25, (2012). doi:10.1109/TCBB.2011.51
A preliminary version of this work entitled Haplotype inference on pedigrees with recombinations and mutations appeared in Proceedings of the 10th International Workshop on Algorithms in Bioinformatics (WABI), LNBI 6293, pp. 148-161. Springer, Heidelberg (2010). doi:10.1007/978-3-642-15294-8_13
(A pre-print version is available upon request to one of the authors.)
Please contact Yuri Pirola for additional information.
1 thought on “Heu-MCHC”
Comments are closed.