Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theoremMilanič, Martin (Avtor)
perfect phylogenyNP-hard problemgraph coloringbranchingacyclic digraphchain partitionDilworth's theoremmin-max theoremapproximation algorithmheuristic20182018-09-17 14:09:59Neznano9791UDK: 51OceCobissID: 1540556484COBISS.SI-ID: 1540564420sl