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.

Pierre Morisse

dblp:235/8492 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2018
—ORCID · unresolved

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
de bruijn graph assembly
0.312018
Hybrid correction of highly noisy long reads using a variable-order de Bruijn graph · Bioinform. 2018
Bioinformatics and computational biology › sequence analysis › sequencing error correction
hybrid error correction
0.312018
Hybrid correction of highly noisy long reads using a variable-order de Bruijn graph · Bioinform. 2018
Bioinformatics and computational biology
sequence analysis
0.312018
Hybrid correction of highly noisy long reads using a variable-order de Bruijn graph · Bioinform. 2018
Bioinformatics and computational biology › sequence analysis
sequencing error correction
0.312018
Hybrid correction of highly noisy long reads using a variable-order de Bruijn graph · Bioinform. 2018

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

variable-order de bruijn graph · 0.3seed-and-extend alignment · 0.3
YearPublicationVenuePosition
2018 Hybrid correction of highly noisy long reads using a variable-order de Bruijn graph
abstract
Motivation: The recent rise of long read sequencing technologies such as Pacific Biosciences and Oxford Nanopore allows to solve assembly problems for larger and more complex genomes than what allowed short reads technologies. However, these long reads are very noisy, reaching an error rate of around 10-15% for Pacific Biosciences, and up to 30% for Oxford Nanopore. The error correction problem has been tackled by either self-correcting the long reads, or using complementary short reads in a hybrid approach. However, even though sequencing technologies promise to lower the error rate of the long reads below 10%, it is still higher in practice, and correcting such noisy long reads remains an issue. Results: We present HG-CoLoR, a hybrid error correction method that focuses on a seed-and-extend approach based on the alignment of the short reads to the long reads, followed by the traversal of a variable-order de Bruijn graph, built from the short reads. Our experiments show that HG-CoLoR manages to efficiently correct highly noisy long reads that display an error rate as high as 44%. When compared to other state-of-the-art long read error correction methods, our experiments also show that HG-CoLoR provides the best trade-off between runtime and quality of the results, and is the only method able to efficiently scale to eukaryotic genomes. Availability and implementation: HG-CoLoR is implemented is C++, supported on Linux platforms and freely available at https://github.com/morispi/HG-CoLoR. Supplementary information: Supplementary data are available at Bioinformatics online.
Pierre Morisse, Thierry Lecroq, Arnaud Lefebvre
Bioinform.1