pith. sign in

arxiv: 1311.3932 · v1 · pith:XDSZO7PCnew · submitted 2013-11-15 · 🧬 q-bio.QM · q-bio.GN

MetaPar: Metagenomic Sequence Assembly via Iterative Reclassification

classification 🧬 q-bio.QM q-bio.GN
keywords metagenomicassemblymetaparassemblersclassificationeffectivesequenceaccurate
0
0 comments X
read the original abstract

We introduce a parallel algorithmic architecture for metagenomic sequence assembly, termed MetaPar, which allows for significant reductions in assembly time and consequently enables the processing of large genomic datasets on computers with low memory usage. The gist of the approach is to iteratively perform read (re)classification based on phylogenetic marker genes and assembler outputs generated from random subsets of metagenomic reads. Once a sufficiently accurate classification within genera is performed, de novo metagenomic assemblers (such as Velvet or IDBA-UD) or reference based assemblers may be used for contig construction. We analyze the performance of MetaPar on synthetic data consisting of 15 randomly chosen species from the NCBI database through the effective gap and effective coverage metrics.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.