Abstract

Motivation: The Illumina paired-end sequencing technology can generate reads from both ends of target DNA fragments, which can subsequently be merged to increase the overall read length. There already exist tools for merging these paired-end reads when the target fragments are equally long. However, when fragment lengths vary and, in particular, when either the fragment size is shorter than a single-end read, or longer than twice the size of a single-end read, most state-of-the-art mergers fail to generate reliable results. Therefore, a robust tool is needed to merge paired-end reads that exhibit varying overlap lengths because of varying target fragment lengths.Results: We present the PEAR software for merging raw Illumina paired-end reads from target fragments of varying length. The program evaluates all possible paired-end read overlaps and does not require the target fragment size as input. It also implements a statistical test for minimizing false-positive results. Tests on simulated and empirical data show that PEAR consistently generates highly accurate merged paired-end reads. A highly optimized implementation allows for merging millions of paired-end reads within a few minutes on a standard desktop computer. On multi-core architectures, the parallel version of PEAR shows linear speedups compared with the sequential version of PEAR.Availability and implementation: PEAR is implemented in C and uses POSIX threads. It is freely available at http://www.exelixis-lab.org/web/software/pear.Contact: Tomas.Flouri@h-its.org

Highlights

  • The Illumina sequencing platform can produce millions of short reads in a single run

  • To identify false-positive merged reads, we propose a statistical test that is based on the observed expected alignment scores (OESs)

  • We set the parameters of ART to generate target DNA fragments by randomly sampling the reference sequences until a 10-fold coverage of the reference dataset was reached

Read more

Summary

INTRODUCTION

The Illumina sequencing platform can produce millions of short reads in a single run. In contrast to FLASH, PANDAseq works well with short overlap regions and does not require prior knowledge of the target DNA fragment size It assumes that all paired-end reads can be merged. Most current paired-end mergers assume that the DNA fragments are longer than the individual single-end reads When this does not hold, for example when sequencing the V6 region of 16S rRNA genes of bacterial samples [fragment sizes range between 110 and 130-bp (Gloor et al, 2010)] with read lengths of 150-bp (see case C in Fig. 1), current mergers will generate erroneous results. The program is accurate on datasets with (i) short overlaps and (ii) DNA target fragment sizes that are smaller than single-end read lengths. The parallel version of PEAR scales linearly with the number of cores

IMPLEMENTATION
Overlap algorithm
Statistical test
Output
Parallelization and memory management
RESULTS AND DISCUSSION
Simulated data
Single known sequence data
Run time and memory requirement
Reasons for high FPRs in PANDASeq
CONCLUSIONS
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call