Imagem de perfil de lexeyka
Bandeira de Russian Federation Saint Petersburg, Russian Federation
Membro desde 18 de novembro de 2013
0 Recomendações


On-line Offline
I worked in the field of bioinformatics and have a deep and extensive knowledge in statistics, algorithms and discrete mathematics. Experience in C/C++ is over 3 years. Currently I work in JetBrains, total experience in Java is over 5 years.
$20 USD/hr
0 comentários
  • N/ATrabalhos concluídos
  • N/ANo Orçamento
  • N/APontualmente
  • N/ATaxa de Recontratação


Comentários recentes

Sem comentários.


Software Developer

Dec 2013

Researcher/Software Engineer

Jun 2011 - Sep 2013 (2 years)

Developing SPAdes genome assembler [login to view URL], which was one of the first genome assemblers, specified for single-cell bacterial data. Duties particularly included preparing current release using C++, also optimizing time and memory consumption. In addition a set of tools for an assembly quality assessment was developed using Java and Python.


MS in mathematics

2008 - 2013 (5 years)

Ph.D expected

2013 - 2015 (2 years)


Anton Bankevich, Sergey Nurk, Dmitry Antipov, Alexey A. Gurevich, Mikhail Dvorkin, Alexander S. Kulikov, Valery M. Lesin, Sergey I. Nikolenko, Son Pham, Andrey D. Prjibelski, Alexey V. Pyshkin, Alexander V. Sirotkin, Nikolay Vyahhi, Glenn Tesler, Max A. A

The lion's share of bacteria in various environments cannot be cloned in the laboratory and thus cannot be sequenced using existing technologies. A major goal of single-cell genomics is to complement gene-centric metagenomic data with whole-genome assemblies of uncultivated organisms. Assembly of single-cell data is challenging because of highly non-uniform read coverage as well as elevated levels of sequencing errors and chimeric reads. We describe SPAdes, a new assembler for both single-cell and standard

Nikolay Vyahhi, Alexey Pyshkin, Son K. Pham, Pavel Pevzner. From de Bruijn Graphs to Rectangle Graphs for Genome Assembly, Lecture Notes in Bioinformatics 7534 (2012), pp. 249-261. doi:10.1007/978-3-642-33122-0_20

Jigsaw puzzles were originally constructed by painting a picture on a rectangular piece of wood and further cutting it into smaller pieces with a jigsaw. The Jigsaw Puzzle Problem is to find an arrangement of these pieces that fills up the rectangle in such a way that neighboring pieces have “matching” boundaries with respect to color and texture. While the general Jigsaw Puzzle Problem is NP-complete [6], we discuss its simpler version (called Rectangle Puzzle Problem) and study the rectangle graphs, recen


  • C++ Level 1


  • Conectado com o Facebook
  • Freelancer Preferencial
  • Pagamento Verificado
  • Telefone Verificado
  • Identidade Verificada
  • E-mail Verificado

Pesquisar Freelancers similares