Skip to main content

Anton Bankevich

Education:
  • 2004-2009 St. Petersburg State University, Mathematics & Mechanics Faculty, Department of Algebra.
  • 2009-present PhD student, St. Petersburg State University, Mathematics & Mechanics Faculty, Department of Algebra.
 
Teaching experience:
  • 2003-2007 Conducted classes in Olympiad Mathematics for school students at specialized school #533, St. Petersburg.
  • 2008, 2010 Conducted classes in Mathematics for students at St. Petersburg State University.
 
Publications:
  • Yana Safonova, Anton Bankevich, Pavel A. Pevzner ”DipSPAdes: Assembler for Highly Polymorphic Diploid Genomes” (accepted to RECOMB2014).
  • Sergey Nurk, Anton Bankevich, Dmitry Antipov, Alexey Gurevich, Anton Korobeynikov, Alla Lapidus, Andrey Prjibelsky, Alexey Pyshkin, Alexander Sirotkin, Yakov Sirotkin, Ramunas Stepanauskas, Jeffrey McLean, Roger Lasken, Scott R. Clingenpeel, Tanja Woyke, Glenn Tesler, Max A. Alekseyev, and Pavel A. Pevzner:  “Assembling Genomes and Mini-metagenomes from Highly Chimeric Reads.”  Journal of Computational Biology 20(10), 2013
  • Sergey Nurk, Anton Bankevich, Dmitry Antipov, Alexey Gurevich, Anton Korobeynikov, Alla Lapidus, Andrey Prjibelsky, Alexey Pyshkin, Alexander Sirotkin, Yakov Sirotkin, Ramunas Stepanauskas, Jeffrey McLean, Roger Lasken, Glenn Tesler, Max A. Alekseyev, and Pavel A. Pevzner “Assembling Genomes and Mini-metagenomes from Highly Chimeric Reads.” RECOMB2013, Beijing, China.
  • Anton Bankevich, Sergey Nurk, Dmitry Antipov, Alexey Gurevich, Mikhail Dvorkin, Alexander Kulikov, Valery Lesin, Sergey Nikolenko, Son Pham, Andrey Prjibelski, Alexey Pyshkin, Alexander Sirotkin, Nikolay Vyahhi, Glenn Tesler, Max Alekseyev and Pavel Pevzner “SPAdes: a New Genome Assembler and its Applications to Single Cell Sequencing.” Journal of Computational Biology 19(5). 2012.
  • A. V. Bankevich “Bounds of the number of leaves of spanning trees in graphs without triangles” Journal of Mathematical Sciences, August 2012, Volume 184, Issue 5, pp 557-563.
  • A. V. Bankevich, D. V. Karpov “Bounds of the number of leaves of spanning trees” Journal of Mathematical Sciences, August 2012, Volume 184, Issue 5, pp 564-572.
 
Awards:
  • 2004 the second award on All-Russian Math Olympiad.
  • 2008 the second award on ACM North-Eastern region semifinal.
 
Scientific interests:
bioinformatics, graph theory, algebra, computer science