Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theoremHujdurović, Ademir (Avtor) Husić, Edin (Avtor) Milanič, Martin (Avtor) Rizzi, Romeo (Avtor) Tomescu, Alexandru I. (Avtor) perfect phylogenyminimum conflict-free row split problembranchingacyclic digraphchain partitionDilworth's theoremmin-max theoremapproximation algorithmAPXhardness20182018-05-08 08:47:28Neznano9591UDK: 519.17ISSN pri članku: 1549-6325OceCobissID: 14508889DOI: 10.1145/3182178COBISS.SI-ID: 1540282052sl