21. Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theoremAdemir Hujdurović, Martin Milanič, Edin Husić, Romeo Rizzi, Alexandru I. Tomescu, 2017, published scientific conference contribution abstract Keywords: perfect phylogeny, NP-hard problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristic Published in RUP: 17.09.2018; Views: 1852; Downloads: 119 Link to full text |
22. Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theoremAdemir Hujdurović, Martin Milanič, Edin Husić, Romeo Rizzi, Alexandru I. Tomescu, 2018, published scientific conference contribution abstract Keywords: perfect phylogeny, NP-hard problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristic Published in RUP: 17.09.2018; Views: 1816; Downloads: 77 Full text (1,44 MB) This document has more files! More... |
23. MIPUP : minimum perfect unmixed phylogenies for multi-sampled tumors via branchings and ILPEdin Husić, Xinyue Li, Ademir Hujdurović, Miika Mehine, Romeo Rizzi, Veli Mäkinen, Martin Milanič, Alexandru I. Tomescu, 2018, original scientific article Keywords: perfect phylogeny, minimum conflict-free row split problem, branching, acyclic digraph, integer linear programming Published in RUP: 17.09.2018; Views: 1960; Downloads: 112 Link to full text |
24. Ma, Xuanlong, Fu, Ruiqin, Lu, Xuefei: On the independence number of the power graph of a finite group. (English summary). - Indag. Math. (N.S.) 29 (2018), no. 2, 794-806. (electronic)Ademir Hujdurović, 2018, review, book review, critique Published in RUP: 31.07.2018; Views: 1712; Downloads: 16 Link to full text |
25. |
26. Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theoremAdemir Hujdurović, Edin Husić, Martin Milanič, Romeo Rizzi, Alexandru I. Tomescu, 2018, original scientific article Keywords: perfect phylogeny, minimum conflict-free row split problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, APXhardness Published in RUP: 08.05.2018; Views: 2258; Downloads: 154 Link to full text |
27. |
28. |
29. |
30. |