Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, 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 algorithmheuristic20182018-09-17 14:11:31Neznano9793UDK: 519.17OceCobissID: 1540438468COBISS.SI-ID: 1540527556sl