Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Anton Bankevich

dblp:122/8750 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
0since 2021 · last 2020
0000-0003-0609-9542ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 6 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
6 papers
Bioinformatics and computational biology · 100%

Topics — the 11 heaviest of 11, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › sequence analysis › sequence assembly
genome assembly
1.452020
MosaicFlye: Resolving Long Mosaic Repeats Using Long Reads · RECOMB 2020
cloudSPAdes: assembly of synthetic long reads using de Bruijn graphs · Bioinform. 2019
ExSPAnder: a universal repeat resolver for DNA fragment assembly · Bioinform. 2014
Bioinformatics and computational biology
sequence analysis
0.822020
MosaicFlye: Resolving Long Mosaic Repeats Using Long Reads · RECOMB 2020
Long Reads Enable Accurate Estimates of Complexity of Metagenomes · RECOMB 2018
Bioinformatics and computational biology
genomics
0.622020
MosaicFlye: Resolving Long Mosaic Repeats Using Long Reads · RECOMB 2020
ExSPAnder: a universal repeat resolver for DNA fragment assembly · Bioinform. 2014
Bioinformatics and computational biology › sequence analysis › sequence assembly › genome assembly
repeat resolution
0.622020
MosaicFlye: Resolving Long Mosaic Repeats Using Long Reads · RECOMB 2020
ExSPAnder: a universal repeat resolver for DNA fragment assembly · Bioinform. 2014
Bioinformatics and computational biology › sequence analysis › sequence assembly › genome assembly
long-read assembly
0.412020
MosaicFlye: Resolving Long Mosaic Repeats Using Long Reads · RECOMB 2020
Bioinformatics and computational biology › sequence analysis › sequence assembly
de bruijn graph
0.412019
cloudSPAdes: assembly of synthetic long reads using de Bruijn graphs · Bioinform. 2019
Bioinformatics and computational biology › sequence analysis
long-read sequencing
0.312018
Long Reads Enable Accurate Estimates of Complexity of Metagenomes · RECOMB 2018
Bioinformatics and computational biology
metagenomics
0.312018
Long Reads Enable Accurate Estimates of Complexity of Metagenomes · RECOMB 2018
Bioinformatics and computational biology › sequence analysis › sequence assembly › genome assembly
diploid genome assembly
0.212014
dipSPAdes: Assembler for Highly Polymorphic Diploid Genomes · RECOMB 2014
Bioinformatics and computational biology › metagenomics
metagenomic assembly
0.212013
Assembling Genomes and Mini-metagenomes from Highly Chimeric Reads · RECOMB 2013
Bioinformatics and computational biology › single-cell analysis
single-cell sequencing
0.112014
ExSPAnder: a universal repeat resolver for DNA fragment assembly · Bioinform. 2014

Methods — techniques the papers use, named apart from their topics

mosaic repeat resolution · 0.4de bruijn graph · 0.4long-read assembly · 0.3read-pair analysis · 0.2de bruijn graph assembly · 0.2
YearPublicationVenuePosition
2020 MosaicFlye: Resolving Long Mosaic Repeats Using Long Reads
Anton Bankevich, Pavel A. Pevzner
RECOMB1
2019 cloudSPAdes: assembly of synthetic long reads using de Bruijn graphs
abstract
MOTIVATION: The recently developed barcoding-based synthetic long read (SLR) technologies have already found many applications in genome assembly and analysis. However, although some new barcoding protocols are emerging and the range of SLR applications is being expanded, the existing SLR assemblers are optimized for a narrow range of parameters and are not easily extendable to new barcoding technologies and new applications such as metagenomics or hybrid assembly. RESULTS: We describe the algorithmic challenge of the SLR assembly and present a cloudSPAdes algorithm for SLR assembly that is based on analyzing the de Bruijn graph of SLRs. We benchmarked cloudSPAdes across various barcoding technologies/applications and demonstrated that it improves on the state-of-the-art SLR assemblers in accuracy and speed. AVAILABILITY AND IMPLEMENTATION: Source code and installation manual for cloudSPAdes are available at https://github.com/ablab/spades/releases/tag/cloudspades-paper. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Ivan Tolstoganov, Anton Bankevich, Zhoutao Chen, Pavel A. Pevzner
Bioinform.2
2018 Long Reads Enable Accurate Estimates of Complexity of Metagenomes
Anton Bankevich, Pavel A. Pevzner
RECOMB1
2014 dipSPAdes: Assembler for Highly Polymorphic Diploid Genomes
Yana Safonova, Anton Bankevich, Pavel A. Pevzner
RECOMB2
2014 ExSPAnder: a universal repeat resolver for DNA fragment assembly
abstract
UNLABELLED: Next-generation sequencing (NGS) technologies have raised a challenging de novo genome assembly problem that is further amplified in recently emerged single-cell sequencing projects. While various NGS assemblers can use information from several libraries of read-pairs, most of them were originally developed for a single library and do not fully benefit from multiple libraries. Moreover, most assemblers assume uniform read coverage, condition that does not hold for single-cell projects where utilization of read-pairs is even more challenging. We have developed an exSPAnder algorithm that accurately resolves repeats in the case of both single and multiple libraries of read-pairs in both standard and single-cell assembly projects. AVAILABILITY AND IMPLEMENTATION: http://bioinf.spbau.ru/en/spades
Andrey D. Prjibelski, Irina Vasilinetc, Anton Bankevich, Alexey A. Gurevich, Tatiana Krivosheeva, Sergey Nurk, Son K. Pham, Anton I. Korobeynikov, Alla L. Lapidus, Pavel A. Pevzner
Bioinform.3
2013 Assembling Genomes and Mini-metagenomes from Highly Chimeric Reads
Sergey Nurk, Anton Bankevich, Dmitry Antipov, Alexey A. Gurevich, Anton I. Korobeynikov, Alla L. Lapidus, Andrey D. Prjibelski, Alex Pyshkin, Alexander Sirotkin 0001, Yakov Sirotkin, Ramunas Stepanauskas, Jeffrey S. McLean, Roger Lasken, Scott R. Clingenpeel, Tanja Woyke, Glenn Tesler, Max A. Alekseyev, Pavel A. Pevzner
RECOMB2