Show document Help

A- | A+ | Print
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:.pdf RAZ_Tomescu_Alexandru_I._i2018.pdf (1,44 MB)
MD5: BF7B3917602F0771445DA5378F4FE8A9
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 This link opens in a new window
COBISS.SI-ID:1540527556 This link opens in a new window
Publication date in RUP:17.09.2018
Copy citation
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share

Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a monograph

Title:7th PhD Summer School in Discrete Mathematics : Rogla, July 23-29, 2017
Place of publishing:Koper
Publisher:Univerza na Primorskem, Fakulteta za matematiko, naravoslovje in informacijske tehnologije, Inštitut Andrej Marušič
Year of publishing:2017
COBISS.SI-ID:1540438468 This link opens in a new window

Secondary language

Keywords:popolna filogenija, NP-težek problem, vejitev, acikličen digraf, particija na verige, Dilworthov izrek, min-maks izrek, aproksimacijski algoritem, hevristika


Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
There are no comments!

Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica