Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theorem
Abstract
No abstract data available
Keywords
perfect phylogeny;NP-hard problem;graph coloring;branching;acyclic digraph;chain partition;Dilworth's theorem;min-max theorem;approximation algorithm;heuristic;
Data
| Language: | English |
|---|---|
| Year of publishing: | 2018 |
| Typology: | 1.10 - Published Scientific Conference Contribution Abstract (invited lecture) |
| Organization: | UP - University of Primorska |
| UDC: | 51 |
| COBISS: |
1540564420
|
| Views: | 1754 |
| Downloads: | 20 |
| Average score: | 0 (0 votes) |
| Metadata: |
|
Other data
| Secondary language: | English |
|---|---|
| Pages: | Str. 1 |
| ID: | 10960372 |
Recommended works:
Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theorem
2018,
no subtitle data available
Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theorem
2018,
no subtitle data available
Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theorem
2017,
no subtitle data available
Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theorem
2018,
no subtitle data available
ǂThe ǂminimum conflict-free row split problem revisited
2016,
no subtitle data available