Abstract
The inference of evolutionary trees from binary species-character matrices is a fundamental computational problem in classical phylogenetic studies. Several problems arising in this field lead to different variants of the inference problem; some of these concern input data with missing values or incomplete matrices. A model of inference from incomplete data that has recently gained a remarkable interest is the Perfect Phylogeny Haplotype problem (PPH) introduced in [1] and successfully applied to infer haplotypes from genotype data. A stated open issue in this research field is the linear-time solution of this inference problem. In this paper we solve this question and give an O(nm)-time algorithm to complete matrices of n rows and m columns to represent PPH solutions: we show that solving the problem requires recognizing special posets of width 2.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bonizzoni, P. A Linear-Time Algorithm for the Perfect Phylogeny Haplotype Problem. Algorithmica 48, 267–285 (2007). https://doi.org/10.1007/s00453-007-0094-3
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-007-0094-3