ParDRe: faster parallel duplicated reads removal tool for sequencing studies

J González-Domínguez, B Schmidt - Bioinformatics, 2016 - academic.oup.com
Bioinformatics, 2016academic.oup.com
Current next generation sequencing technologies often generate duplicated or near-
duplicated reads that (depending on the application scenario) do not provide any interesting
biological information but can increase memory requirements and computational time of
downstream analysis. In this work we present ParDRe, a de novo parallel tool to remove
duplicated and near-duplicated reads through the clustering of Single-End or Paired-End
sequences from fasta or fastq files. It uses a novel bitwise approach to compare the suffixes …
Abstract
Summary: Current next generation sequencing technologies often generate duplicated or near-duplicated reads that (depending on the application scenario) do not provide any interesting biological information but can increase memory requirements and computational time of downstream analysis. In this work we present ParDRe, a de novo parallel tool to remove duplicated and near-duplicated reads through the clustering of Single-End or Paired-End sequences from fasta or fastq files. It uses a novel bitwise approach to compare the suffixes of DNA strings and employs hybrid MPI/multithreading to reduce runtime on multicore systems. We show that ParDRe is up to 27.29 times faster than Fulcrum (a representative state-of-the-art tool) on a platform with two 8-core Sandy-Bridge processors.
Availability and implementation: Source code in C ++ and MPI running on Linux systems as well as a reference manual are available at https://sourceforge.net/projects/pardre/
Contact:  jgonzalezd@udc.es
Oxford University Press
以上显示的是最相近的搜索结果。 查看全部搜索结果