20.500.12556/RUP-9793 Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theorem perfect phylogeny NP-hard problem branching acyclic digraph chain partition Dilworth's theorem min-max theorem approximation algorithm heuristic popolna filogenija NP-težek problem vejitev acikličen digraf particija na verige Dilworthov izrek min-maks izrek aproksimacijski algoritem hevristika true true false Angleški jezik Angleški jezik Neznano 2018-09-17 14:11:31 2018-09-17 14:11:31 2024-03-01 13:50:00 0000-00-00 00:00:00 2018 0 0 Str. 13 0000-00-00 NiDoloceno NiDoloceno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 519.17 1540438468 1540527556 RAZ_Tomescu_Alexandru_I._i2018.pdf RAZ_Tomescu_Alexandru_I._i2018.pdf 1 BF7B3917602F0771445DA5378F4FE8A9 63dc6f9942a98c8532a78cf8b4819d8f26986446b7740881b5b1ad1f539c26e2 ae351042-c3d4-11ed-b5df-005056bf369b https://repozitorij.upr.si/Dokument.php?lang=slv&id=15532 https://conferences.famnit.upr.si/indico/event/2/material/0/4.pdf 1 https://repozitorij.upr.si/Dokument.php?lang=slv&id=15533 Inštitut Andrej Marušič 0 0 0