Ključne besede: perfect phylogeny, NP-hard problem, graph coloring, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristicObjavljeno v RUP: 17.09.2018; Ogledov: 1932; Prenosov: 20 Povezava na celotno besedilo