Lupa

Show document

A- | A+ | Print
Title:Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theorem
Authors:Hujdurović, Ademir (Author)
Milanič, Martin (Author)
Husić, Edin (Author)
Rizzi, Romeo (Author)
Tomescu, Alexandru I. (Author)
Files:.pdf RAZ_Tomescu_Alexandru_I._i2018.pdf (1,44 MB)
 
URL https://conferences.famnit.upr.si/indico/event/2/material/0/4.pdf
 
Language:English
Work type:Unknown
Tipology: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
UDC:519.17
COBISS_ID:1540527556 Link is opened in a new window
Views:285
Downloads:19
Metadata:XML RDF-CHPDL DC-XML DC-RDF
Categories:Document is not linked to any category.
:
  
Average score:(0 votes)
Your score:Voting is allowed only to 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
Subtitle:Rogla, July 23-29, 2017
Publisher:Univerza na Primorskem, Fakulteta za matematiko, naravoslovje in informacijske tehnologije, Inštitut Andrej Marušič
COBISS.SI-ID:1540438468 This link opens in a new window
Place of publishing:Koper
Year of publishing:2017

Secondary language

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

Comments

Leave comment

You have to log in to leave a comment.

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

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