<?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=13944"><dc:title>Reconstructing perfect phylogenies via branchings in acyclic digraphs</dc:title><dc:creator>Baghirova,	Narmina	(Avtor)
	</dc:creator><dc:creator>Milanič,	Martin	(Mentor)
	</dc:creator><dc:subject>perfect phylogeny</dc:subject><dc:subject>minimum conflict-free row split problem</dc:subject><dc:subject>minimum uncovering branching 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:publisher>[N. Baghirova]</dc:publisher><dc:date>2020</dc:date><dc:date>2020-08-07 09:23:46</dc:date><dc:type>Magistrsko delo/naloga</dc:type><dc:identifier>13944</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>