SLO

Login

First page / Search the repository

Search the repository

A- | A+ | Print

Query:	search in
	search in
	search in
	search in
Work type:	* old and bologna study programme
Language:
Search in:
Options:	Show only hits with full text
	Reset

1 - 4 / 4

1

1.

Reconstructing perfect phylogenies via branchings in acyclic digraphs : a new lower bound and efficiently solvable cases
Narmina Baghirova, 2020, master's thesis

Keywords: perfect phylogeny, minimum conflict-free row split problem, minimum uncovering branching problem, branching, acyclic digraph, chain partition, Dilworth's theorem
Published in RUP: 07.08.2020; Views: 4213; Downloads: 97
Full text (1,85 MB)

2.

MIPUP : minimum perfect unmixed phylogenies for multi-sampled tumors via branchings and ILP
Edin Husić, Xinyue Li, Ademir Hujdurović, Miika Mehine, Romeo Rizzi, Veli Mäkinen, Martin Milanič, Alexandru I. Tomescu, 2018, original scientific article

Keywords: perfect phylogeny, minimum conflict-free row split problem, branching, acyclic digraph, integer linear programming
Published in RUP: 17.09.2018; Views: 4873; Downloads: 126
Link to full text

3.

Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theorem
Ademir Hujdurović, Edin Husić, Martin Milanič, Romeo Rizzi, Alexandru I. Tomescu, 2018, original scientific article

Keywords: perfect phylogeny, minimum conflict-free row split problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, APXhardness
Published in RUP: 08.05.2018; Views: 5061; Downloads: 164
Link to full text

4.

The minimum conflict-free row split problem revisited
Ademir Hujdurović, Edin Husić, Martin Milanič, Romeo Rizzi, Alexandru I. Tomescu, 2016, published scientific conference contribution

Keywords: #the #minimum conflict-free row split problem, branching, Dilworth's theorem, min-max theorem, approximation algorithm, APX-hardness
Published in RUP: 14.11.2017; Views: 6257; Downloads: 289
Link to full text
This document has more files! More...

Search done in 0 sec.

Logos of partners