Teaching

Bioinformatics (B4M36BIN), Spring 2020 , 1 tutorial, 9 weeks, Graduate, in Czech

Bioinformatics introduction, sequence assembly, sequence alignment, BLAST, phylogeny, Markov chains, Gene expression analysis

Symbolic machine learning (B4M(E)36SMU), Spring 2020 , 3 tutorials, 3 weeks, Graduate, in Czech and English

Reinforcement learning (direct utility estimation, adaptive dynamic programming, temporal difference learning, Q-learning, SARSA, GLIE)

Advanced algorithms (B4M33PAL), Fall 2019, 2 tutorials, 14 weeks, Graduate, in Czech

MSTs, Eulerian graphs, heaps, graph isomorphishm, random generators, DFA, NFA, text search, skip list, B-trees, R-B trees, splay trees, K-D trees, trie

Symbolic machine learning (B4M(E)36SMU), Spring 2019, 3 tutorials, 3 weeks, Graduate, in Czech and English

Reinforcement learning (direct utility estimation, adaptive dynamic programming, temporal difference learning, Q-learning, SARSA, GLIE)

Bioinformatics (B4M36BIN), Spring 2019, 1 tutorial, 9 weeks, Graduate, in English

Bioinformatics introduction, sequence assembly, sequence alignment, BLAST, phylogeny, Markov chains, Gene expression analysis

Advanced algorithms (B4M33PAL), Fall 2018, 2 tutorials, 14 weeks, Graduate, in Czech

MSTs, Eulerian graphs, heaps, graph isomorphishm, random generators, DFA, NFA, text search, skip list, B-trees, R-B trees, splay trees, K-D trees, trie

Symbolic machine learning (B4M(E)36SMU), Spring 2018, 2 tutorials, 3 weeks, Graduate, in Czech and English

Reinforcement learning (direct utility estimation, adaptive dynamic programming, temporal difference learning, Q-learning, SARSA, GLIE)

Bioinformatics (B4M36BIN), Spring 2018, 1 tutorial, 3 weeks, Graduate, in Czech

Sequence assembly, sequence alignment, BLAST, multiple sequence alignment

Advanced algorithms (B4M33PAL), Fall 2017, 2 tutorials, 14 weeks, Graduate, in Czech

MSTs, Eulerian graphs, heaps, graph isomorphishm, random generators, DFA, NFA, text search, skip list, B-trees, R-B trees, splay trees, K-D trees, trie

Symbolic machine learning (B4M(E)36SMU), Spring 2017, 2 tutorials, 4 weeks, Graduate, in Czech and English

Reinforcement learning (direct utility estimation, adaptive dynamic programming, temporal difference learning, Q-learning, SARSA, GLIE)

Advanced algorithms (B4M33PAL), Fall 2016, 1 tutorial, 14 weeks, Graduate, in Czech

MSTs, Eulerian graphs, heaps, graph isomorphishm, random generators, DFA, NFA, text search, skip list, B-trees, R-B trees, splay trees, K-D trees, trie

Algorithms (B4B33ALG), Spring 2016, 1 tutorial, 14 weeks, Undergraduate, in Czech

Asymptotic complexity, trees, BST, BFS, DFS, AVL, B-trees, sorting, dynamic programming, hashing