Ključne besede: perfect phylogeny, minimum conflict-free row split problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, APXhardnessObjavljeno v RUP: 08.05.2018; Ogledov: 2360; Prenosov: 154 Povezava na celotno besedilo