User:AlexK
From Bioptrain
- Name
- Alexandr Kovalev
- Country
- Belarus
- Education
-
- Diplom in Computer Science at Belarusian State University of Informatics and Radioelectronics
- Research interests
-
- Bioinformatics
- Computer Science
- lp.nanzop.tup.sc@velavoka
- Website
- Theoretical research on SPDP
- Computer experiments with digestion data from several publications
- Preparation for the thesis defence
- Computer application with algorithms to solve SPDP
Year 4 (Sep 2008 - Aug 2009)
Talks
- Genome mapping via simplified partial digest method: handling measurement errors
2008-09-17, Rome, Italy, Mini EURO CCBBM
Conferences
- Mini EURO CCBBM, Rome, Italy (2008-09-15 - 2008-09-17)
Pending publications
- Jacek Blazewicz, Edmund K. Burke, Marta Kasprzak, Alexandr Kovalev and Mikhail Y. Kovalyov, The Simplified Partial Digest Problem:
approximation and a graph-theoretic model, INFORMS Journal on Computing, submitted.
Year 3 (Sep 2007 - Aug 2008)
Talks
- The Simplified Partial Digest Problem: enumerative and dynamic programming algorithms
2007-10-06, Uniejow, Poland, V Computational Biology Workshop - Polynomial time approximation algorithms for the Simplified Partial Digest Problem
2007-11-27, research seminar of the Institute of Computer Science (Poznan University of Technology) - A dynamic programming algorithm for the Simplified Partial Digest Problem
2008-05-23, Neringa, Lithuania, EUROPT-2008: EURO Mini Conference
Conferences
- COMBI '07: V Computational Biology Workshop, Uniejow, Poland (2007-10-05 - 2007-10-06)
- RECOMB2008, Singapore (2008-03-30 - 2008-04-02)
Dynamic programming and approximation algorithms for the Simplified Partial Digest Problem, poster - Bioinformatics 2008 Conference, Warsaw, Poland (2008-04-24 - 2008-04-27)
- EUROPT-2008: EURO Mini Conference, Neringa, Lithuania (2008-05-20 - 2008-05-23)
Pending publications
- Jacek Blazewicz, Edmund K. Burke, Marta Kasprzak, Alexandr Kovalev and Mikhail Y. Kovalyov, On the approximability of the Simplified Partial Digest Problem, Discrete Applied Mathematics, accepted.
Publications
- Alexandr Kovalev, C.T. Ng, A discrete EOQ problem is solvable in O(logn) time, European Journal of Operational Research, Vol. 189, Iss. 3, pp. 914-919, 2008.
Year 2 (Sep 2006 - Aug 2007)
Talks
- The Complexity Class APX and Its Relation to Some Bioinformatics Problems
2006-10-07, Jadwisin, 4th Poznan-Warsaw Computational Biology Workshop - Combinatorial algorithms for the error-free SPDP
2007-05-24, Limassol, Cyprus, ECCO XX - 2007 - Polynomial time approximation algorithms for the Simplified Partial Digest Problem
2007-07-08, Prague, Czech Republic, EURO-CBBM Workshop OR in Computational Biology, Bioinformatics and Medicine
Conferences
- 4th Poznan-Warsaw Computational Biology Workshop, Jadwisin, Poland (2006-10-06 - 2006-10-07)
- ECCO XX - 2007, Limassol, Cyprus (2007-05-24 - 2007-05-26)
- EURO-CBBM Workshop, Prague, Czech Republic (2007-07-08)
- EURO XXII, Prague, Czech Republic (2007-07-09 - 2007-07-11)
Pending publications
- Jacek Blazewicz, Edmund K. Burke, Marta Kasprzak, Alexandr Kovalev and Mikhail Y. Kovalyov, The Simplified Partial Digest Problem:
approximation and a graph-theoretic model, Theoretical Computer Science, submitted.
Publications
- Jacek Blazewicz, Edmund K. Burke, Marta Kasprzak, Alexandr Kovalev, and Mikhail Y. Kovalyov, Simplified Partial Digest Problem: Enumerative and Dynamic Programming Algorithms, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 4, no. 4, pp. 668-680, Oct-Dec, 2007.
Year 1 (Sep 2005 - Aug 2006)
Pending publications
- Jacek Blazewicz, Edmund Burke, Marta Kasprzak, Alexandr Kovalev, and Mikhail Y. Kovalyov, The Simplified Partial Digest Problem: Enumerative and Dynamic Programming Algorithms, IEEE/ACM Transactions on Computational Biology and Bioinformatics, accepted, to appear in 2007.
Talks
- An O(log n) time algorithm for a discrete Economic Order Quantity problem
2005-11-8, research seminar of the Institute of Computer Science (Poznan University of Technology) - Combinatorial Aspects of the Simplifying Partial Digest Method of Genome Mapping
2006-03-20, seminar of the United Institute of Informatics Problems (National Academy of Sciences of Belarus) - The complexity class APX and its relation to some bioinformatics problems
2006-05-16, research seminar of the Institute of Computer Science (Poznan University of Technology)
Year 3 (Sep 2007 - Aug 2008)
Visits abroad
- University of Nottingham, 2008-02 - 2008-03, 2008-07
Courses
- Scheduling for parallel processing, Institute of Computer Science (PUT) (2007-11-6 - 2007-11-20)
- Development directions of metacheuristic algorithms, Institute of Computing Science (PUT) (2008-05-06 - 2008-05-13)
- Seminars of the Laboratory of Theory of Algorithms and Programming Systems, Institute of Computer Science (PUT)
Year 2 (Sep 2006 - Aug 2007)
Courses
- Type systems for programming languages, Institute of Computer Science (PUT) (2006-11-14 - 2006-12-12)
- Advanced methods in pattern recognition, Institute of Computer Science (PUT) (2007-02-27 - 2007-03-20)
- Seminars of the Laboratory of Theory of Algorithms and Programming Systems, Institute of Computer Science (PUT)
Communication skills
- Polish language, Poznan University of Technology (2006-11-25 - current)
Year 1 (Sep 2005 - Aug 2006)
Courses
- Topics in Scheduling Theory, Institute of Computer Science (PUT)
- Artificial Intelligence, Institute of Computer Science (PUT)
- Preference Modelling and Decision Support, Institute of Computer Science (PUT)
- Advanced Database Systems, Institute of Computer Science (PUT)
- Seminars of the Laboratory of Theory of Algorithms and Programming Systems, Institute of Computer Science (PUT)
Communication skills
- Polish language, Poznan University of Technology
