A Polynomial-Time Algorithm For the Perfect Phylogeny Problem When the Number of Character States is Fixed
From MaRDI portal
Publication:4327418
DOI10.1137/S0097539793244587zbMath0835.68052MaRDI QIDQ4327418
Richa Agarwala, David Fernández Baca
Publication date: 6 April 1995
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Computational methods for problems pertaining to biology (92-08)
Related Items (13)
Parameterized enumeration, transversals, and imperfect phylogeny reconstruction ⋮ Enumeration of binary trees compatible with a perfect phylogeny ⋮ Trees, taxonomy, and strongly compatible multi-state characters ⋮ On the Generalised Character Compatibility Problem for Non-branching Character Trees ⋮ Topology reconstruction using time series data in telecommunication networks ⋮ A simple characterization of the minimal obstruction sets for three-state perfect phylogenies ⋮ PULLPRU: a practical approach to estimate phylogenies from single nucleotide polymorphism haplotypes under the maximum parsimony criterion ⋮ Recovering trees from well-separated multi-state characters. ⋮ Unique Perfect Phylogeny Is NP-Hard ⋮ Tree reconstruction from multi-state characters ⋮ Character-based phylogeny construction and its application to tumor evolution ⋮ Minimizing phylogenetic number to find good evolutionary trees ⋮ The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs
This page was built for publication: A Polynomial-Time Algorithm For the Perfect Phylogeny Problem When the Number of Character States is Fixed
