1. |
2. Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theoremAdemir Hujdurović, Martin Milanič, Edin Husić, Romeo Rizzi, Alexandru I. Tomescu, 2017, published scientific conference contribution abstract Keywords: perfect phylogeny, NP-hard problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristic Published in RUP: 17.09.2018; Views: 1978; Downloads: 119 Link to full text |
3. Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theoremAdemir Hujdurović, Martin Milanič, Edin Husić, Romeo Rizzi, Alexandru I. Tomescu, 2018, published scientific conference contribution abstract Keywords: perfect phylogeny, NP-hard problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristic Published in RUP: 17.09.2018; Views: 1902; Downloads: 78 Full text (1,44 MB) This document has more files! More... |
4. Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theoremMartin Milanič, 2018, published scientific conference contribution abstract (invited lecture) Keywords: perfect phylogeny, NP-hard problem, graph coloring, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristic Published in RUP: 17.09.2018; Views: 1898; Downloads: 20 Link to full text |
5. MIPUP : minimum perfect unmixed phylogenies for multi-sampled tumors via branchings and ILPEdin 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: 2057; Downloads: 112 Link to full text |
6. |
7. Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theoremAdemir 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: 2360; Downloads: 154 Link to full text |
8. Stability of cellular automata trajectories revisited : branching walks and Lyapunov profileJan M. Baetens, Janko Gravner, 2016, original scientific article Keywords: asymptotic shape, branching walk, cellular automaton, doubly periodic configuration, large deviations, Lyapunov exponent, percolation, stability Published in RUP: 02.03.2018; Views: 2369; Downloads: 127 Link to full text |
9. The minimum conflict-free row split problem revisitedAdemir 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: 2682; Downloads: 275 Link to full text This document has more files! More... |
10. Linking within- and between-host dynamics to study the evolutionary dynamics of pathogensBarbara Boldin, 2015, published scientific conference contribution abstract Keywords: evolucija, gnezdeni modeli, dinamika znotraj gostitelja, superinfekcija, razvejanje, evolucijsko stabilna strategija, patogeni, evolution, nested models, within-host dynamics, superinfection, branching, evolutionarily stable strategy, pathogens Published in RUP: 15.10.2015; Views: 2411; Downloads: 76 Link to full text |