Log In Sign Up

Toward perfect reads

by   Antoine Limasset, et al.

We propose a new method to correct short reads using de Bruijn graphs, and implement it as a tool called Bcool. As a first step, Bcool constructs a corrected compacted de Bruijn graph from the reads. This graph is then used as a reference and the reads are corrected according to their mapping on the graph. We show that this approach yields a better correction than kmer-spectrum techniques, while being scalable, making it possible to apply it to human-size genomic datasets and beyond. The implementation is open source and available at


page 1

page 2

page 3

page 4


Out-of-Vocabulary Entities in Link Prediction

Knowledge graph embedding techniques are key to making knowledge graphs ...

Perfect Clustering for Stochastic Blockmodel Graphs via Adjacency Spectral Embedding

Vertex clustering in a stochastic blockmodel graph has wide applicabilit...

Lerna: Transformer Architectures for Configuring Error Correction Tools for Short- and Long-Read Genome Sequencing

Sequencing technologies are prone to errors, making error correction (EC...

A computationally and cognitively plausible model of supervised and unsupervised learning

Both empirical and mathematical demonstrations of the importance of chan...

Muscle Synergy and Coupling for Hand

The knowledge of the intuitive link between muscle activity and the fing...

Nebula Graph: An open source distributed graph database

This paper introduces the recent work of Nebula Graph, an open-source, d...

Just-Enough Interaction Approach to Knee MRI Segmentation: Data from the Osteoarthritis Initiative

State-of-the-art automated segmentation algorithms are not 100% accurate...