Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theorem
2018
2018-05-08 08:47:28
1033
perfect phylogeny, minimum conflict-free row split problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, APXhardness
Ademir
Hujdurović
70
Edin
Husić
70
Martin
Milanič
70
Romeo
Rizzi
70
Alexandru I.
Tomescu
70
UDK
4
519.17
ISSN pri članku
9
1549-6325
OceCobissID
13
14508889
DOI
15
10.1145/3182178
COBISS.SI-ID
3
1540282052
0
Predstavitvena datoteka
2018-05-08 08:47:33