Lupa

Search the repository Help

A- | A+ | Print
Query: search in
search in
search in
search in
* old and bolonia study programme

Options:
  Reset


1 - 9 / 9
First pagePrevious page1Next pageLast page
1.
Linking within- and between-host dynamics to study the evolutionary dynamics of pathogens
Barbara Boldin, 2015, published scientific conference contribution abstract

Found in: ključnih besedah
Summary of found: ...patogeni, evolution, nested models, within-host dynamics, superinfection, branching, evolutionarily stable strategy, pathogens, ...
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: 15.10.2015; Views: 885; Downloads: 24
URL Full text (0,00 KB)
This document has more files! More...

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

Found in: ključnih besedah
Summary of found: ...#the #minimum conflict-free row split problem, branching, Dilworth's theorem, min-max theorem, approximation algorithm, APX-hardness...
Keywords: #the #minimum conflict-free row split problem, branching, Dilworth's theorem, min-max theorem, approximation algorithm, APX-hardness
Published: 14.11.2017; Views: 786; Downloads: 184
URL Full text (0,00 KB)
This document has more files! More...

3.
Stability of cellular automata trajectories revisited
Jan M. Baetens, Janko Gravner, 2016, original scientific article

Found in: ključnih besedah
Summary of found: ...asymptotic shape, branching walk, cellular automaton, doubly periodic configuration, large...
Keywords: asymptotic shape, branching walk, cellular automaton, doubly periodic configuration, large deviations, Lyapunov exponent, percolation, stability
Published: 02.03.2018; Views: 847; Downloads: 68
URL Full text (0,00 KB)

4.
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

Found in: ključnih besedah
Summary of found: ...perfect phylogeny, minimum conflict-free row split problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max...
Keywords: perfect phylogeny, minimum conflict-free row split problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, APXhardness
Published: 08.05.2018; Views: 667; Downloads: 86
URL Full text (0,00 KB)

5.
An extension of the classification of evolutionarily singular strategies in adaptive dynamics
Barbara Boldin, Odo Diekmann, 2018, published scientific conference contribution abstract

Found in: ključnih besedah
Summary of found: ...dynamics, mathematical model, evolutionarily singular strategy, evolutionary branching...
Keywords: adaptive dynamics, mathematical model, evolutionarily singular strategy, evolutionary branching
Published: 03.08.2018; Views: 521; Downloads: 4
URL Full text (0,00 KB)

6.
MIPUP
Edin Husić, Xinyue Li, Ademir Hujdurović, Miika Mehine, Romeo Rizzi, Veli Mäkinen, Martin Milanič, Alexandru I. Tomescu, 2018, original scientific article

Found in: ključnih besedah
Summary of found: ...perfect phylogeny, minimum conflict-free row split problem,, branching, acyclic digraph, integer linear programming...
Keywords: perfect phylogeny, minimum conflict-free row split problem, branching, acyclic digraph, integer linear programming
Published: 17.09.2018; Views: 387; Downloads: 56
URL Full text (0,00 KB)

7.
Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theorem
Martin Milanič, 2018, published scientific conference contribution abstract (invited lecture)

Found in: ključnih besedah
Summary of found: ...perfect phylogeny, NP-hard problem, graph coloring, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max...
Keywords: perfect phylogeny, NP-hard problem, graph coloring, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristic
Published: 17.09.2018; Views: 283; Downloads: 5
URL Full text (0,00 KB)

8.
Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theorem
Ademir Hujdurović, Martin Milanič, Edin Husić, Romeo Rizzi, Alexandru I. Tomescu, 2018, published scientific conference contribution abstract

Found in: ključnih besedah
Summary of found: ...perfect phylogeny, NP-hard problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max...
Keywords: perfect phylogeny, NP-hard problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristic
Published: 17.09.2018; Views: 305; Downloads: 19
.pdf Full text (1,44 MB)
This document has more files! More...

9.
Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theorem
Ademir Hujdurović, Martin Milanič, Edin Husić, Romeo Rizzi, Alexandru I. Tomescu, 2017, published scientific conference contribution abstract

Found in: ključnih besedah
Summary of found: ...perfect phylogeny, NP-hard problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max...
Keywords: perfect phylogeny, NP-hard problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristic
Published: 17.09.2018; Views: 372; Downloads: 60
URL Full text (0,00 KB)

Search done in 0 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica