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

Antoine Recanati

dblp:209/8120 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2017
—ORCID · none

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

Applied, interdisciplinary, general and emerging computing · 1 · 1 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
1 paper
Bioinformatics and computational biology · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › sequence analysis › sequence assembly › genome assembly
de novo assembly
0.312017
A spectral algorithm for fast de novo layout of uncorrected long nanopore reads · Bioinform. 2017
Bioinformatics and computational biology › sequence analysis › sequence assembly
genome assembly
0.312017
A spectral algorithm for fast de novo layout of uncorrected long nanopore reads · Bioinform. 2017
Bioinformatics and computational biology › sequence analysis › sequence assembly › genome assembly
long-read assembly
0.312017
A spectral algorithm for fast de novo layout of uncorrected long nanopore reads · Bioinform. 2017
Bioinformatics and computational biology › sequence analysis › sequence assembly › genome assembly › de novo assembly
overlap-layout-consensus
0.312017
A spectral algorithm for fast de novo layout of uncorrected long nanopore reads · Bioinform. 2017

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

spectral graph partitioning · 0.3spectral algorithm · 0.3
YearPublicationVenuePosition
2017 A spectral algorithm for fast de novo layout of uncorrected long nanopore reads
abstract
Abstract Motivation New long read sequencers promise to transform sequencing and genome assembly by producing reads tens of kilobases long. However, their high error rate significantly complicates assembly and requires expensive correction steps to layout the reads using standard assembly engines. Results We present an original and efficient spectral algorithm to layout the uncorrected nanopore reads, and its seamless integration into a straightforward overlap/layout/consensus (OLC) assembly scheme. The method is shown to assemble Oxford Nanopore reads from several bacterial genomes into good quality (∼99% identity to the reference) genome-sized contigs, while yielding more fragmented assemblies from the eukaryotic microbe Sacharomyces cerevisiae. Availability and implementation https://github.com/antrec/spectrassembler. Supplementary Information Supplementary data are available at Bioinformatics online.
Antoine Recanati, Thomas Brüls, Alexandre d'Aspremont
Bioinform.1