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: 1662; Downloads: 71 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: 1958; Downloads: 112 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: 2255; Downloads: 154 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: 2555; Downloads: 275 Link to full textThis document has more files! More...
Keywords: perfect phylogeny, conflict-free matrix, conflict-free row split, row-conflict graphPublished in RUP: 08.08.2016; Views: 2995; Downloads: 128 Link to full text