at CHALMERS | UNIVERSITY OF GOTHENBURG

Leonid Molokov

PhD Student at the Computer Science and Engineering department at Chalmers University of Technology.
Part of Bioinformatics Research Group at Chalmers.

Supervisors:
Peter Damashcke
Devdatt Dubhashi

Bio:
Born 1984/11/13, Novosibirsk, USSR
Education

2000-2005, St Petersburg State University, Specialist in Maths and CS.
2006-2008, Chalmers University of Technology, MSc in Bioinformatics.
2008-...., Chalmers University of Technology, Doctoral student.

Publications
With Peter Damaschke:
The union of minimal hitting sets: Parameterized combinatorial bounds and counting,
Journal of Discrete Algorithms 7 (2009), pp 391-401

Parameterized reductions and algorithms for another vertex cover generalization,
Algorithms and Data Structures Symposium 2011, LNCS 8644, pp 279-289

Solo:
Application of combinatorial methods to protein identification in peptide mass fingerprinting,
International Conference on Knowledge Discovery and Information Retrieval 2010, pp 307-313

Present:

Research field
(Parameterized) algorithms in bioinformatics and computational biology.
I am also interested in discrete mathematics, probability theory, dynamic systems and fractals.

Teaching
Advanced Algorithms, 2011/12 (HT)
Algorithms, 2011/2012 (HT)
Project in Artificial Intelligence, 2009/2010 (VT)

Seminar organisation
Computational Systems Biology Seminar

Leonid Molokov
Computer Science and Engineering, Chalmers University of Technology,
SE-412 96 Göteborg, Sweden
Telephone: +46-(0)31 7721063; Fax: +46-(0)31 165655
E-mail: molokov (at) chalmers