I am a PhD Student at the Computer Science and Engineering department at Chalmers University of Technology.
Part of Bioinformatics Research Group at Chalmers.
Born 1984/11/13, Novosibirsk, USSR
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.
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
Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover,
Theoretical Computer Science, 452, pp 39-46
Error propagation in sparse linear systems with peptide-protein incidence matrices
Intenational Symposium on Bioinformatics Research and Applications 2012, LNCS (LNBI) 7292, pp 72-83
Application of combinatorial methods to protein identification in peptide mass fingerprinting,
International Conference on Knowledge Discovery and Information Retrieval 2010, pp 307-313
(Parameterized) algorithms in bioinformatics and computational biology.
I am also interested in discrete mathematics, probability theory, dynamic systems
A hobby and means for solving the actual task (as it should - arguably - be for any mathematician in past 4-color theorem proof).
I am convinced that OOP is overused and FP may be more beneficial for those who intend to develop major projects (though I am not one of the enlightened). As for myself, I tend to use C for implementing my algorithms (scrupulous memory management and faster running times are a must for algorithms that have big memory and time complexities), with Perl as a supplement for preprocessing. However, I have experience working with C++ and Java back in 2000 and quite recently for some ML/NLP projects. I am not totally unfamiliar to FP, as I had my hands on LISP a while ago in a university course, and I also tried myself in Haskell. However, I am not, by any means, an expert in FP.
Advanced Algorithms, 2012/13 (HT)
Algorithms, 2012/2013 (HT)
Project in Artificial Intelligence, 2011/2012 (VT)
Computational Systems Biology Seminar
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