Experimental analysis of a new algorithm for partial haplotype completion

Authors:
Paola Bonizzoni;Gianluca Della Vedova;Riccardo Dondi;Lorenzo Mariani
Affiliations:
Dipartimento di Informatica, Sistemistica e Comunicazione;Dipartimento di Statistica;Dipartimento di Informatica, Sistemistica e Comunicazione;Dipartimento di Informatica, Sistemistica e Comunicazione
Venue:
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part II
Year:
2005

Citing 5
Cited 0

Haplotyping as perfect phylogeny: conceptual framework and efficient solutions

Proceedings of the sixth annual international conference on Computational biology
Large scale reconstruction of haplotypes from genotype data

RECOMB '03 Proceedings of the seventh annual international conference on Research in computational molecular biology
The Haplotyping problem: an overview of computational models and solutions

Journal of Computer Science and Technology
Perfect phylogeny and haplotype assignment

RECOMB '04 Proceedings of the eighth annual international conference on Resaerch in computational molecular biology
Incomplete Directed Perfect Phylogeny

SIAM Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.