| Title: | Reconstructing perfect phylogenies via branchings in acyclic digraphs : a new lower bound and efficiently solvable cases |
|---|
| Authors: | ID Baghirova, Narmina (Author)
ID Milanič, Martin (Mentor) More about this mentor...  |
|---|
| Files: |  https://www.famnit.upr.si/sl/studij/zakljucna_dela/view/916
|
|---|
| Language: | English |
|---|
| Work type: | Master's thesis/paper |
|---|
| Typology: | 2.09 - Master's Thesis |
|---|
| Organization: | FAMNIT - Faculty of Mathematics, Science and Information Technologies
|
|---|
| Keywords: | perfect phylogeny, minimum conflict-free row split problem, minimum uncovering branching problem, branching, acyclic digraph, chain partition, Dilworth's theorem |
|---|
| Place of publishing: | Koper |
|---|
| Place of performance: | Koper |
|---|
| Publisher: | [N. Baghirova] |
|---|
| Year of publishing: | 2020 |
|---|
| Year of performance: | 2020 |
|---|
| Number of pages: | X, 64 str. |
|---|
| PID: | 20.500.12556/RUP-13944 |
|---|
| UDC: | 519.17(043.2) |
|---|
| COBISS.SI-ID: | 24424963 |
|---|
| Publication date in RUP: | 07.08.2020 |
|---|
| Views: | 1758 |
|---|
| Downloads: | 71 |
|---|
| 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. |
