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

Aubin Thomas

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

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

Applied, interdisciplinary, general and emerging computing · 1

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 › sequencing error correction
long-read error correction
0.412020
TALC: Transcript-level Aware Long-read Correction · Bioinform. 2020
Bioinformatics and computational biology
sequence analysis
0.412020
TALC: Transcript-level Aware Long-read Correction · Bioinform. 2020
Bioinformatics and computational biology › transcriptomics
RNA-seq analysis
0.112020
TALC: Transcript-level Aware Long-read Correction · Bioinform. 2020
Bioinformatics and computational biology
transcriptomics
0.112020
TALC: Transcript-level Aware Long-read Correction · Bioinform. 2020

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

weighted de bruijn graph · 0.4hybrid correction · 0.4
YearPublicationVenuePosition
2020 TALC: Transcript-level Aware Long-read Correction
abstract
MOTIVATION: Long-read sequencing technologies are invaluable for determining complex RNA transcript architectures but are error-prone. Numerous 'hybrid correction' algorithms have been developed for genomic data that correct long reads by exploiting the accuracy and depth of short reads sequenced from the same sample. These algorithms are not suited for correcting more complex transcriptome sequencing data. RESULTS: We have created a novel reference-free algorithm called Transcript-level Aware Long-Read Correction (TALC) which models changes in RNA expression and isoform representation in a weighted De Bruijn graph to correct long reads from transcriptome studies. We show that transcript-level aware correction by TALC improves the accuracy of the whole spectrum of downstream RNA-seq applications and is thus necessary for transcriptome analyses that use long read technology. AVAILABILITY AND IMPLEMENTATION: TALC is implemented in C++ and available at https://github.com/lbroseus/TALC. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Lucile Broseus, Aubin Thomas, Andrew J. Oldfield, Dany Severac, Emeric Dubois, William Ritchie
Bioinform.2