Scaling metagenome sequence assembly with probabilistic de Bruijn graphs

Details Scaling metagenome sequence assembly with probabilistic de Bruijn graphs Scaling metagenome sequence assembly with probabilistic de Bruijn graphs

2011-12-18

arxiv.org/abs/1112.4193v2

Biology

Quantitative Biology

Genomics

Scientific paper

The memory requirements for de novo assembly of short-read shotgun sequencing data from complex microbial populations are an increasingly large practical barrier to environmental studies. Here we introduce a memory-efficient graph representation with which we can analyze the k-mer connectivity of metagenomic samples, allowing us to reduce the size of the de novo assembly process for metagenomes with a "divide and conquer" algorithm. This graph representation is based on a probabilistic data structure, a Bloom filter, that allows us to store assembly graphs in as little as 4 bits per k-mer. We use this approach to achieve a 20-fold decrease in memory for the assembly of a soil metagenome sample.

Affiliated with

Also associated with

No associations

Rating

Scaling metagenome sequence assembly with probabilistic de Bruijn graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Scaling metagenome sequence assembly with probabilistic de Bruijn graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scaling metagenome sequence assembly with probabilistic de Bruijn graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-209706