Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theorem (Q4554347)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6979210
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9337533116340636
0 references
0.8081701993942261
0 references
0.7690322399139404
0 references
0.7503858208656311
0 references
0.7281100749969482
0 references
