Ključne besede: perfect phylogeny, minimum conflict-free row split problem, minimum uncovering branching problem, branching, acyclic digraph, chain partition, Dilworth's theoremObjavljeno v RUP: 07.08.2020; Ogledov: 1759; Prenosov: 71 Povezava na celotno besedilo