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, objavljeni povzetek znanstvenega prispevka na konferenci Ključne besede: perfect phylogeny, NP-hard problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristic Objavljeno v RUP: 17.09.2018; Ogledov: 2009; Prenosov: 119 Povezava na celotno besedilo |
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, objavljeni povzetek znanstvenega prispevka na konferenci Ključne besede: perfect phylogeny, NP-hard problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristic Objavljeno v RUP: 17.09.2018; Ogledov: 1936; Prenosov: 78 Celotno besedilo (1,44 MB) Gradivo ima več datotek! Več... |
4. Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theoremMartin Milanič, 2018, objavljeni povzetek znanstvenega prispevka na konferenci (vabljeno predavanje) Ključne besede: perfect phylogeny, NP-hard problem, graph coloring, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristic Objavljeno v RUP: 17.09.2018; Ogledov: 1929; Prenosov: 20 Povezava na celotno besedilo |
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, izvirni znanstveni članek Ključne besede: perfect phylogeny, minimum conflict-free row split problem, branching, acyclic digraph, integer linear programming Objavljeno v RUP: 17.09.2018; Ogledov: 2075; Prenosov: 112 Povezava na celotno besedilo |
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, izvirni znanstveni članek Ključne besede: perfect phylogeny, minimum conflict-free row split problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, APXhardness Objavljeno v RUP: 08.05.2018; Ogledov: 2380; Prenosov: 154 Povezava na celotno besedilo |
8. Stability of cellular automata trajectories revisited : branching walks and Lyapunov profileJan M. Baetens, Janko Gravner, 2016, izvirni znanstveni članek Ključne besede: asymptotic shape, branching walk, cellular automaton, doubly periodic configuration, large deviations, Lyapunov exponent, percolation, stability Objavljeno v RUP: 02.03.2018; Ogledov: 2398; Prenosov: 127 Povezava na celotno besedilo |
9. The minimum conflict-free row split problem revisitedAdemir Hujdurović, Edin Husić, Martin Milanič, Romeo Rizzi, Alexandru I. Tomescu, 2016, objavljeni znanstveni prispevek na konferenci Ključne besede: #the #minimum conflict-free row split problem, branching, Dilworth's theorem, min-max theorem, approximation algorithm, APX-hardness Objavljeno v RUP: 14.11.2017; Ogledov: 2714; Prenosov: 275 Povezava na celotno besedilo Gradivo ima več datotek! Več... |
10. Linking within- and between-host dynamics to study the evolutionary dynamics of pathogensBarbara Boldin, 2015, objavljeni povzetek znanstvenega prispevka na konferenci Ključne besede: evolucija, gnezdeni modeli, dinamika znotraj gostitelja, superinfekcija, razvejanje, evolucijsko stabilna strategija, patogeni, evolution, nested models, within-host dynamics, superinfection, branching, evolutionarily stable strategy, pathogens Objavljeno v RUP: 15.10.2015; Ogledov: 2436; Prenosov: 76 Povezava na celotno besedilo |