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. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Bonizzoni, P., Vedova, G. D., Dondi, R., & Mariani, L. (2005). Experimental analysis of a new algorithm for partial haplotype completion. In Lecture Notes in Computer Science (Vol. 3515, pp. 952–959). Springer Verlag. https://doi.org/10.1007/11428848_121
Mendeley helps you to discover research relevant for your work.