DeepAI
Log In Sign Up

Toward perfect reads

11/09/2017
by   Antoine Limasset, et al.
0

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 github.com/Malfoy/BCOOL

READ FULL TEXT

page 1

page 2

page 3

page 4

05/26/2021

Out-of-Vocabulary Entities in Link Prediction

Knowledge graph embedding techniques are key to making knowledge graphs ...
10/02/2013

Perfect Clustering for Stochastic Blockmodel Graphs via Adjacency Spectral Embedding

Vertex clustering in a stochastic blockmodel graph has wide applicabilit...
12/19/2021

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...
10/11/2020

A computationally and cognitively plausible model of supervised and unsupervised learning

Both empirical and mathematical demonstrations of the importance of chan...
04/25/2020

Muscle Synergy and Coupling for Hand

The knowledge of the intuitive link between muscle activity and the fing...
06/15/2022

Nebula Graph: An open source distributed graph database

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

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

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