<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://repozitorij.upr.si/IzpisGradiva.php?id=9793"><dc:title>Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theorem</dc:title><dc:creator>Hujdurović,	Ademir	(Avtor)
	</dc:creator><dc:creator>Milanič,	Martin	(Avtor)
	</dc:creator><dc:creator>Husić,	Edin	(Avtor)
	</dc:creator><dc:creator>Rizzi,	Romeo	(Avtor)
	</dc:creator><dc:creator>Tomescu,	Alexandru I.	(Avtor)
	</dc:creator><dc:subject>perfect phylogeny</dc:subject><dc:subject>NP-hard problem</dc:subject><dc:subject>branching</dc:subject><dc:subject>acyclic digraph</dc:subject><dc:subject>chain partition</dc:subject><dc:subject>Dilworth's theorem</dc:subject><dc:subject>min-max theorem</dc:subject><dc:subject>approximation algorithm</dc:subject><dc:subject>heuristic</dc:subject><dc:date>2018</dc:date><dc:date>2018-09-17 14:11:31</dc:date><dc:type>Neznano</dc:type><dc:identifier>9793</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>