Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theorem
Povzetek
Ni podatka o povzetku
Ključne besede
perfect phylogeny;NP-hard problem;graph coloring;branching;acyclic digraph;chain partition;Dilworth's theorem;min-max theorem;approximation algorithm;heuristic;
Podatki
| Jezik: | Angleški jezik |
|---|---|
| Leto izida: | 2018 |
| Tipologija: | 1.10 - Objavljeni povzetek znanstvenega prispevka na konferenci (vabljeno predavanje) |
| Organizacija: | UP - Univerza na Primorskem |
| UDK: | 51 |
| COBISS: |
1540564420
|
| Št. ogledov: | 1754 |
| Št. prenosov: | 20 |
| Ocena: | 0 (0 glasov) |
| Metapodatki: |
|
Ostali podatki
| Sekundarni jezik: | Angleški jezik |
|---|---|
| Strani: | Str. 1 |
| ID: | 10960372 |
Priporočena dela:
Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theorem
2018,
ni podatka o podnaslovu
Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theorem
2018,
ni podatka o podnaslovu
Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theorem
2017,
ni podatka o podnaslovu
Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theorem
2018,
ni podatka o podnaslovu
ǂThe ǂminimum conflict-free row split problem revisited
2016,
ni podatka o podnaslovu