Michal Voracek assistant professor, PhD candidate
Stringology and Compiler Construction Research GroupSoftware Engineering Research Group
Department of Computer Science and Engineering
Faculty of Electrical Engineering
Czech Technical University
Karlovo namesti 13
121 35 Praha 2
Czech Republic
email: voracem [at] fel [dot] cvut [dot] cz
web: http://cs.felk.cvut.cz/~voracem/
Education
- Ing. (equiv. of MSc) in Computer Science, CTU Prague, June 2003
Professional Interests
- Text Algorithms
- Automata and Formal Languages Theory
- Bioinformatics
- Software Engineering
Selected Publications
- M.Voracek: Computing Seeds in Generalized Strings. In Proceedings of WORKHSOP 2006, Part A CTU in Prague, February 2005.
- M.Voracek, B. Melichar: Searchig for Regularities in Generalized Strings using Finite Automata. In ICNAAM 2005 - International Conference on Numerical Analysis and Applied Mathematics 2005. Weinheim: WILEY - VCH Verlag Gmb, 2005, s. 809-812. ISBN 3-527-40652-2.
- M.Voracek: Computing Covers in Generalized Strings. In proceedings of POSTER 2005, CTU in Prague, May 2005.
- M.Voracek, B. Melichar: Searchig for Regularities in Strings using Finite Automata. In Proceedings of WORKHSOP 2005, Part A, pp. 264-265, CTU in Prague, March 2005, ISBN 80-01-03201-9.
- M.Voracek, B.Melichar, M.Christodoulakis: Generalized and Weighted Strings: Repetitions and Pattern Matching. In String Algorithmics, edited by Costas S. Iliopoulous and Thierry Lecroq. pp. 227-250. Texts in Algorithmics, volume 2, King's College Publications, 2004. ISBN 1-904987-02-8. pi
- M.Voracek: Algorithms for Comparison of DNA Sequences. Diploma Thesis. Department of Computer Science and Engineering, FEE CTU Prague, June 2003.
Teaching Experience
- Algorithmics
- Programming in Java
- Text and Compression Algorithms
- Automata and Formal Languages Theory
- Programming Languages and Compiler Construction
- Software Engineering I. (Analysis and Design)
- Software Engineering III. (Implementation)
- Object modelling