Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theoremHujdurović, Ademir (Avtor) Milanič, Martin (Avtor) Husić, Edin (Avtor) Rizzi, Romeo (Avtor) Tomescu, Alexandru I. (Avtor) perfect phylogenyNP-hard problembranchingacyclic digraphchain partitionDilworth's theoremmin-max theoremapproximation algorithmheuristic20172018-09-17 14:13:15Neznano9797UDK: 81OceCobissID: 1540528068COBISS.SI-ID: 1540528836sl