Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theorem

SLO

First page / Show document

Show document

A- | A+ | Print

Title:	Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theorem
Authors:	ID Milanič, Martin (Author)
Files:	https://lipn.univ-paris13.fr/Lagos2017/speakers.html
Language:	English
Work type:	Unknown
Typology:	1.10 - Published Scientific Conference Contribution Abstract (invited lecture)
Organization:	IAM - Andrej Marušič Institute
Keywords:	perfect phylogeny, NP-hard problem, graph coloring, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristic
Year of publishing:	2018
Number of pages:	Str. 1
PID:	20.500.12556/RUP-9791
UDC:	51
COBISS.SI-ID:	1540564420
Publication date in RUP:	17.09.2018
Views:	2635
Downloads:	22
Metadata:
:	MILANIČ, Martin, 2018, Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth’s theorem. In : IX Latin and American Algorithms, Graphs and Optimization Symposium, September 11-15, 2017, Marseille, France [online]. Published Scientific Conference Contribution Abstract (invited lecture). S. l. 2018. [Accessed 5 April 2025]. Retrieved from: https://lipn.univ-paris13.fr/Lagos2017/speakers.html Copy citation

Average score:	0.5 1 1.5 2 2.5 3 3.5 4 4.5 5 (0 votes)
Your score:	Voting is allowed only for logged in users.
Share:

Similar works from our repository:

Similar works from other repositories:

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

Title:	IX Latin and American Algorithms, Graphs and Optimization Symposium, September 11-15, 2017, Marseille, France
Place of publishing:	[S. l.
Publisher:	s. n.]
Year of publishing:	2017
COBISS.SI-ID:	1540556484

Leave comment

You must log in to leave a comment.

Comments (0)

0 - 0 / 0

There are no comments!

Back