Leonid Molokov

Leonid Molokov
Datavetenskap
molokov at chalmers dot se
+46 31 772 10 63
Leonid Molokov is a PhD student in Computational Systems Biology. Supervisor: Peter Damaschke.

Visiting address: Rännvägen 6

Room: 6476, 6th floor (EDIT-building)

Link to personal page

Publikationer 2013

Damaschke, Peter; Egecioglu, Ömer; Molokov, Leonid: Fixed-parameter tractability of error correction in graphical linear systems. 7th International Workshop on Algorithms and Computation WALCOM 2013, Lecture Notes in Computer Science, 7748 pp. 245-256. ISBN/ISSN: 978-3-642-36064-0

Molokov, Leonid: Protein Mixture Inference as Hitting Set Variants and Linear Algebra Problems. Göteborg : Chalmers University of Technology. Diss. ISBN/ISSN: 978-91-7385-833-5

2012

Damaschke, Peter; Molokov, Leonid: Error propagation in sparse linear systems with peptide-protein incidence matrices. 8th International Symposium on Bioinformatics Research and Applications ISBRA 2012, Lecture Notes in Bioinformatics, 7292 pp. 72-83. ISBN/ISSN: 978-3-642-30190-2

Damaschke, Peter; Molokov, Leonid: Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover. Theoretical Computer Science, 452 pp. 39-46.

2011

Damaschke, Peter; Molokov, Leonid: Parameterized reductions and algorithms for another vertex cover generalization. 12th Algorithms and Data Structures Symposium WADS 2011, Lecture Notes in Computer Science, 6844 pp. 279-289. ISBN/ISSN: 978-3-642-22299-3

Molokov, Leonid: Parameterized algorithms for hitting set variants applied to protein identification in shotgun proteomics. Göteborg : Chalmers University of Technology.

2010

Molokov, Leonid: Application of Combinatorial Methods to Protein Identification in Peptide Mass Fingerprinting. KDIR 2010 - International Conference on Knowledge Discovery and Information Retrieval, Valencia, Spain, pp. 307-313. ISBN/ISSN: 978-989-8425-28-7

2009

Damaschke, Peter; Molokov, Leonid: The union of minimal hitting sets: parameterized combinatorial bounds and counting. Journal of Discrete Algorithms, 7 (4) pp. 391-401.

Uppdaterad: 27 februari 2013

 SÖK


DATA- OCH INFORMATIONSTEKNIK - Chalmers tekniska högskola och Göteborgs universitet - 412 96 Göteborg
Telefon: 031-772 1000