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: 2807; Downloads: 81 Link to full text
Keywords: perfect phylogeny, minimum conflict-free row split problem, branching, acyclic digraph, integer linear programmingPublished in RUP: 17.09.2018; Views: 3268; Downloads: 119 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: 3419; Downloads: 160 Link to full text
Keywords: #the #minimum conflict-free row split problem, branching, Dilworth's theorem, min-max theorem, approximation algorithm, APX-hardnessPublished in RUP: 14.11.2017; Views: 4122; Downloads: 283 Link to full textThis document has more files! More...