Keywords: perfect phylogeny, minimum conflict-free row split problem, minimum uncovering branching problem, branching, acyclic digraph, chain partition, Dilworth's theoremPublished in RUP: 07.08.2020; Views: 1872; Downloads: 71 Link to full text
Keywords: perfect phylogeny, NP-hard problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristicPublished in RUP: 17.09.2018; Views: 2113; Downloads: 119 Link to full text
Keywords: perfect phylogeny, NP-hard problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristicPublished in RUP: 17.09.2018; Views: 2029; Downloads: 78 Full text (1,44 MB)This document has more files! More...
Keywords: perfect phylogeny, NP-hard problem, graph coloring, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristicPublished in RUP: 17.09.2018; Views: 2012; Downloads: 20 Link to full text
Keywords: perfect phylogeny, minimum conflict-free row split problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, APXhardnessPublished in RUP: 08.05.2018; Views: 2472; Downloads: 155 Link to full text