20.500.12556/RUP-9591
Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theorem
perfect phylogeny
minimum conflict-free row split problem
branching
acyclic digraph
chain partition
Dilworth's theorem
min-max theorem
approximation algorithm
APXhardness
true
true
false
Angleški jezik
Angleški jezik
Neznano
2018-05-08 08:47:28
2018-05-08 08:47:28
2024-03-01 13:49:24
0000-00-00 00:00:00
2018
0
0
Article 20 (26 str.)
#no. #2
#Vol. #14
2018
0000-00-00
NiDoloceno
NiDoloceno
NiDoloceno
0000-00-00
0000-00-00
0000-00-00
519.17
1549-6325
14508889
10.1145/3182178
1540282052
https://doi.org/10.1145/3182178
1
https://repozitorij.upr.si/Dokument.php?lang=slv&id=15285
Inštitut Andrej Marušič
0
0
0