A Polynomial-Time Algorithm for Near-Perfect Phylogeny

DOI10.1137/S0097539799350839zbMath1026.68064MaRDI QIDQ4429677

Jens Lagergren, David Fernández Baca

Publication date: 28 September 2003

Published in: SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

algorithmsphylogenyparsimonyevolutionary treescomputational biologySteiner treeperfect phylogenycharacter-based methods

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Mathematical biology in general (92B99)

Related Items

Parameterized enumeration, transversals, and imperfect phylogeny reconstruction, Efficient approximation of convex recolorings, Parameterized Complexity for Finding a Perfect Phylogeny from Mixed Tumor Samples, Convex recolorings of strings and trees: Definitions, hardness results and algorithms, A colored graph approach to perfect phylogeny with persistent characters