Keywords: perfect phylogeny, NP-hard problem, graph coloring, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristicPublished in RUP: 17.09.2018; Views: 1910; Downloads: 20 Link to full text