Reconstructing perfect phylogenies via branchings in acyclic digraphs
ǂa ǂnew lower bound and efficiently solvable cases
Abstract
No abstract data available
Keywords
perfect phylogeny;minimum conflict-free row split problem;minimum uncovering branching problem;branching;acyclic digraph;chain partition;Dilworth's theorem;
Data
| Language: | English |
|---|---|
| Year of publishing: | 2020 |
| Typology: | 2.09 - Master's Thesis |
| Organization: | UP - University of Primorska |
| Publisher: | [N. Baghirova] |
| UDC: | 519.17(043.2) |
| COBISS: |
24424963
|
| Views: | 1600 |
| Downloads: | 71 |
| Average score: | 0 (0 votes) |
| Metadata: |
|
Other data
| Secondary language: | Slovenian |
|---|---|
| Secondary title: | Rekonstrukcija popolnih filogenij prek vejitev v acikličnih digrafih primeri |
| Secondary keywords: | popolna filogenija;problem najmanjšega brezkonfliktnega razcepa vrstic;problem vejitve najmanjšega nepokritja;vejitev;acikličen digraf;particija delno urejene množice na verige;Dilworthov izrek; |
| Type (COBISS): | Master's thesis/paper |
| Thesis comment: | Univ. na Primorskem, Fak. za matematiko, naravoslovje in informacijske tehnologije |
| Pages: | X, 64 str. |
| ID: | 15493625 |
Recommended works:
Reconstructing perfect phylogenies via branchings in acyclic digraphs
2020,
ǂa ǂnew lower bound and efficiently solvable cases
Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theorem
2018,
no subtitle data available
Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theorem
2017,
no subtitle data available
Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theorem
2018,
no subtitle data available
MIPUP
2019,
minimum perfect unmixed phylogenies for multi-sampled tumors via branchings and ILP