Search the repository

Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theorem
Ademir 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: 2880; Downloads: 123
Link to full text

Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theorem
Martin Milanič, 2018, published scientific conference contribution abstract (invited lecture)

Keywords: perfect phylogeny, NP-hard problem, graph coloring, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristic
Published in RUP: 17.09.2018; Views: 2710; Downloads: 22
Link to full text

The minimum conflict-free row split problem revisited
Ademir Hujdurović, Edin Husić, Martin Milanič, Romeo Rizzi, Alexandru I. Tomescu, 2016, published scientific conference contribution

Keywords: #the #minimum conflict-free row split problem, branching, Dilworth's theorem, min-max theorem, approximation algorithm, APX-hardness
Published in RUP: 14.11.2017; Views: 3895; Downloads: 283
Link to full text
This document has more files! More...