Experimental Analysis of a New Algorithm for Partial Haplotype Completion
This paper deals with the computational problem of inferring complete information on haplotypes from haplotypes with missing data. This problem is one of the main issues in haplotyping, as the current DNA sequencing technology often produces haplotypes with missing bases and thus the complete information on haplotypes has to be inferred through computational methods. In this paper we propose a new algorithmic approach to the problem that assumes both the Coalescent and the Minimum Entropy models and we provide an experimental analysis relating it to the previously investigated approaches. In particular, the reconstruction of a perfect phylogeny from haplotypes with missing data is addressed.
KeywordsGreedy Heuristic Average Error Rate Completion Matrix Coalescent Model Perfect Phylogeny
- 3.Eskin, E., Halperin, E., Karp, R.M.: Large scale reconstruction of haplotypes from genotype data. In: Proceedings of the 7th RECOMB, pp. 104–113 (2003)Google Scholar
- 5.Gusfield, D.: Haplotyping as perfect phylogeny: Conceptual framework and efficient solutions. In: Proceedings of the 6th RECOMB, pp. 166–175 (2002)Google Scholar
- 7.Halperin, E., Karp, R.M.: Perfect phylogeny and haplotype assignment. In: Proceedings of the 8th RECOMB (2004)Google Scholar
- 9.National Institutes of Health. Large-scale genotyping for the haplotype map of the human genome. RFA (Request For Applications) HG-02-005 (2002)Google Scholar