ǂa ǂnew lower bound and efficiently solvable cases
Narmina Baghirova (Author), Martin Milanič (Mentor)

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:
Typology: 2.09 - Master's Thesis
Organization: UP - University of Primorska
Publisher: [N. Baghirova]
UDC: 519.17(043.2)
COBISS: 24424963 Link will open in a new window
Views: 1600
Downloads: 71
Average score: 0 (0 votes)
Metadata: JSON JSON-RDF JSON-LD TURTLE N-TRIPLES XML RDFA MICRODATA DC-XML DC-RDF RDF

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