Perfect Phylogenies via Branchings in Acyclic Digraphs and a Generalization of Dilworth’s Theorem (Q4554347)
From MaRDI portal
scientific article; zbMATH DE number 6979210
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Perfect Phylogenies via Branchings in Acyclic Digraphs and a Generalization of Dilworth’s Theorem |
scientific article; zbMATH DE number 6979210 |
Statements
Perfect Phylogenies via Branchings in Acyclic Digraphs and a Generalization of Dilworth’s Theorem (English)
0 references
13 November 2018
0 references
APX-hardness
0 references
Dilworth's theorem
0 references
perfect phylogeny
0 references
acyclic digraph
0 references
approximation algorithm
0 references
branching
0 references
chain partition
0 references
min-max theorem
0 references
minimum conflict-free row split problem
0 references
