| Title: | Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theorem |
|---|
| Authors: | ID Hujdurović, Ademir (Author)
ID Milanič, Martin (Author)
ID Husić, Edin (Author)
ID Rizzi, Romeo (Author)
ID Tomescu, Alexandru I. (Author) |
|---|
| Files: |  RAZ_Tomescu_Alexandru_I._i2018.pdf (1,44 MB)
MD5: BF7B3917602F0771445DA5378F4FE8A9
 https://conferences.famnit.upr.si/indico/event/2/material/0/4.pdf
|
|---|
| Language: | English |
|---|
| Work type: | Unknown |
|---|
| Typology: | 1.12 - Published Scientific Conference Contribution Abstract |
|---|
| Organization: | IAM - Andrej Marušič Institute
|
|---|
| Keywords: | perfect phylogeny, NP-hard problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristic |
|---|
| Year of publishing: | 2018 |
|---|
| Number of pages: | Str. 13 |
|---|
| PID: | 20.500.12556/RUP-9793  |
|---|
| UDC: | 519.17 |
|---|
| COBISS.SI-ID: | 1540527556 |
|---|
| Publication date in RUP: | 17.09.2018 |
|---|
| Views: | 2347 |
|---|
| Downloads: | 82 |
|---|
| 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. |
