Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theorem
Povzetek
Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theorem
Ključne besede
perfect phylogeny;NP-hard problem;branching;acyclic digraph;chain partition;Dilworth's theorem;min-max theorem;approximation algorithm;heuristic;
Podatki
| Jezik: | Angleški jezik |
|---|---|
| Leto izida: | 2017 |
| Tipologija: | 1.12 - Objavljeni povzetek znanstvenega prispevka na konferenci |
| Organizacija: | UP - Univerza na Primorskem |
| UDK: | 81 |
| COBISS: |
1540528836
|
| Št. ogledov: | 1778 |
| Št. prenosov: | 119 |
| Ocena: | 0 (0 glasov) |
| Metapodatki: |
|
Ostali podatki
| Sekundarni jezik: | Angleški jezik |
|---|---|
| Sekundarne ključne besede: | popolna filogenija;NP-težek problem;vejitev;acikličen digraf;particija na verige;Dilworthov izrek;min-maks izrek;aproksimacijski algoritem;hevristika; |
| Strani: | Str. 1 |
| ID: | 10960975 |
Priporočena dela:
Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theorem
2017,
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
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
Reconstructing perfect phylogenies via branchings in acyclic digraphs
2020,
ǂa ǂnew lower bound and efficiently solvable cases