| Title: | Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theorem |
|---|
| Authors: | ID Milanič, Martin (Author) |
|---|
| Files: |  https://lipn.univ-paris13.fr/Lagos2017/speakers.html
|
|---|
| Language: | English |
|---|
| Work type: | Unknown |
|---|
| Typology: | 1.10 - Published Scientific Conference Contribution Abstract (invited lecture) |
|---|
| Organization: | IAM - Andrej Marušič Institute
|
|---|
| Keywords: | perfect phylogeny, NP-hard problem, graph coloring, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristic |
|---|
| Year of publishing: | 2018 |
|---|
| Number of pages: | Str. 1 |
|---|
| PID: | 20.500.12556/RUP-9791  |
|---|
| UDC: | 51 |
|---|
| COBISS.SI-ID: | 1540564420 |
|---|
| Publication date in RUP: | 17.09.2018 |
|---|
| Views: | 2285 |
|---|
| Downloads: | 21 |
|---|
| Metadata: |    |
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
