Cited by 4,497Genomics and Phylogenetic StudiesAlgorithms and Data CompressionFractal and DNA sequence analysis

PEAR: a fast and accurate Illumina Paired-End reAd mergeR

Open access
Zhang, Jiajie, Kobert, Kassian, Flouri, Tomáš, Stamatakis, Alexandros·2014·Bioinformatics

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

AI snapshot

Written from the paper’s full text.

TL;DR

PEAR is a C/POSIX-threads paired-end read merger that scores all possible overlaps without requiring the target fragment size and adds a statistical test to reduce false-positive merges. It is accurate across short, long, and absent overlaps and scales linearly on multi-core systems.

Key findings

  • On simulated 100-bp paired-end reads with 20-bp mean overlaps, PEAR with the statistical test disabled correctly merged 90.44% of fragments with an FPR of 3.16%; with P = 0.01 it correctly merged 70.06% with an FPR of 0.48%. PANDAseq correctly merged 83.51% but with an FPR of 6.65% (Table 1).
  • On simulated reads with no overlap, PEAR with P = 0.01 merged only 8 of 23,096 pairs, yielding 99.96% correct and an FPR of 0.03%; PANDAseq default incorrectly merged 55.4% of non-overlapping reads (Table 1).
  • On 647,052 pairs of 101-bp S. aureus reads with mean fragment size 180-bp, PEAR with the test disabled merged 411,321 reads, 60.45% correct, FPR 4.90%; PANDAseq default merged 534,839 reads, 64.72% correct, FPR 21.71% (Table 2).
  • On 673,845 pairs of 108-bp reads from a single 198-bp template with 18-bp overlap, PEAR with P = 0.01 merged 576,225 reads with FPR 0.03% and error rate 0.1470, versus raw-read error rate 0.51; on 36,504,800 human chromosome 14 101-bp reads using 48 cores, PEAR finished in 62 s while FLASH and PANDAseq needed 7 and 21.5 min, respectively.

Methods

  • PEAR scores all possible overlaps for each read pair using an assembly score that rewards matches with α and penalizes mismatches with β, then applies a statistical test based on observed expected alignment scores to decide whether to merge.
  • Simulated data: 1000 full-length bacterial 16S rRNA sequences from the RDP classifier training dataset; ART v1.5.0 generated 100-bp paired-end reads with mean fragment sizes 101, 150, 165, 180, 190, and 250 bp, SD 10 bp, at 10-fold coverage; an additional 150-bp read set with mean fragment size 101 bp emulated fragments shorter than single-end reads.
  • Empirical data: S. aureus deep-sequencing dataset (647,052 pairs, 101-bp reads, mean fragment 180 bp) with Bowtie2 mapping to the reference genome; a single-template M. capsulatus V3 16S rRNA dataset (673,845 pairs, 108-bp reads, 18-bp overlap) evaluated by global alignment and error rate; runtime tested on an AMD Opteron 6174 48-core machine.

Limitations

  • The paper states that when the overlap is known to be short (35 bp in simulations), the statistical test can reject up to 4% of correctly merged sequences because of low quality scores; using MAP to recover more merged reads makes the P-value invalid.
  • The paper states that choosing a smaller P-value reduces the FPR but also reduces the number of reads merged, and that automatic buffer-size tuning is left for future work.
  • Evident from the text: PEAR’s performance depends on user-specified RAM/buffer size, and its evaluation is limited to simulated 16S rRNA reads plus two empirical datasets and one runtime dataset; with the statistical test disabled, FPRs can be high for no-overlap (35.4%) and 10-bp mean-overlap (13.10%) simulated cases.

Model-written summary. Check it against the paper before relying on it.

Integrity signals

Registry

Crossref · 10.1093/bioinformatics/btt593

Cites

18 of 18 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Claims the paper makes

0 of 16 cited sources checked · 0 supported · 0 flagged

  • Findingnone given

    When fragment lengths vary, and especially when the fragment size is shorter than a single-end read or longer than twice the single-end read, most state-of-the-art paired-end mergers fail to generate reliable results.

    “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.”
    Quote in the paperNot a substantial claim
  • Findingcitation

    When DNA fragment size is shorter than single-end read length, current mergers generate erroneous results.

    “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.”
    Quote in the paperSubstantial claim0 of 1 sources checked
    • cites Gloor et al., 2010 source

      Not checked in the free run.

  • Findingown data

    PEAR can merge ∼40% of the reads when the mean overlap is only 10-bp.

    “PEAR is robust with respect to short overlaps because it can still merge ∼40% of the reads when the mean overlap is only 10-bp.”
    Quote in the paperSubstantial claim
  • Findingown data

    When running with four cores, PEAR and FLASH are equally fast.

    “Surprisingly, when running the experiment with four cores, which corresponds to a standard desktop PC, PANDAseq is slower than for the sequential run, whereas PEAR and FLASH are equally fast and twice as fast as PANDAseq.”
    Quote in the paperNot a substantial claim
  • Findingnone given

    PEAR implements a statistical test for minimizing false-positive results.

    “It also implements a statistical test for minimizing false-positive results.”
    Quote in the paperSubstantial claim
    • The authors state this as an assumption: In the null model for the statistical test, the two corresponding reads are independent random sequences and there are no sequencing errors.
    • The authors state this as an assumption: The null hypothesis is that the two corresponding reads are independent from each other, meaning any overlap between the two reads is purely by chance.
  • Classified as probably not a substantial claim. 22
  • May combine two claims. 13
  • Classified as probably not a substantial claim.

    Findingnone given

    PEAR evaluates all possible paired-end read overlaps.

    “The program evaluates all possible paired-end read overlaps”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Findingown data

    FLASH and PANDAseq yield no speedup at all.

    “In fact, although PEAR yields linear speedups, FLASH and PANDAseq yield no speedup at all.”
    Quote in the paperSubstantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Findingnone given

    The ER of the raw reads is 0.51.

    “The ER of the raw reads is 0.51.”
    Quote in the paperNot a substantial claim
  • May combine two claims.

    Findingown data

    Both PANDAseq and FLASH produce comparable results but with a slightly higher FPR.

    “Both, PANDAseq and FLASH, produce comparable results but with a slightly higher FPR.”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Findingnone given

    PEAR neither requires prior information on read length nor target fragment size.

    “Furthermore, PEAR neither requires prior information on read length nor target fragment size.”
    Quote in the paperSubstantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Findingown data

    A per-thread set size of 500 reads yielded the best performance in PEAR's experiments.

    “This per-thread set size of 500 yielded the best performance in our experiments (data not shown)”
    Quote in the paperNot a substantial claim
  • Classified as probably not a substantial claim.

    Findingnone given

    PEAR merges reads by maximizing the assembly score (AS) of the read overlap via a scoring matrix that penalizes mismatches with a negative value β and rewards matches with a positive value α.

    “PEAR merges reads by maximizing the assembly score (AS) of the read overlap via a scoring matrix that penalizes mismatches with a negative value β and rewards matches with a positive value α.”
    Quote in the paperSubstantial claim
    • The authors state this as an assumption: There are no gaps in overlaps between Illumina paired-end reads.
  • Probably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.

    Findingreasoning

    PEAR can use several gigabytes, but also just a few kilobytes of RAM.

    “PEAR can use several gigabytes, but also just a few kilobytes of RAM.”
    Quote in the paperNot a substantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Findingown data

    On four cores of the same hardware configuration, the optimal empirical RAM setting is 50 MB.

    “On four cores of the same hardware configuration, the optimal empirical setting is 50 MB.”
    Quote in the paperNot a substantial claim
  • May combine two claims.

    Findingnone given

    COPE exhibits high memory requirements and relatively long execution times.

    “COPE exhibits high memory requirements and also relatively long execution times.”
    Quote in the paperSubstantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Findingreasoning

    Shera is up to 100 times slower than competing mergers.

    “Because it is a proof-of-concept implementation, it is up to 100 times slower than competing mergers.”
    Quote in the paperNot a substantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Findingown data

    The overall run time of COPE on the single template dataset is 395 s using the parallel k-mer computation on 48 cores (minimum memory requirement of 16 GB).

    “For the sake of completeness, the overall run time of COPE on this dataset is 395 s using the parallel k-mer computation on 48 cores (minimum memory requirement of 16 GB).”
    Quote in the paperNot a substantial claim
  • May combine two claims.

    Findingnone given

    PEAR does not require preprocessing of raw data or specifying the fragment size.

    “It does not require preprocessing of the raw data or specifying the fragment size.”
    Quote in the paperSubstantial claim
  • Probably not a substantial claim: may not pass S4 (based).

    Findingnone given

    PEAR does not require preprocessing or quality control before merging.

    “Furthermore, PEAR does not require preprocessing or quality control before merging.”
    Quote in the paperNot a substantial claim
  • May combine two claims.

    Premisenone given

    Both Shera and FLASH ignore the quality scores of the base calls.

    “Both, Shera and FLASH (see later in the text) ignore the quality scores of the base calls.”
    Quote in the paperSubstantial claim0 of 2 sources checked
    • cites Rodrigue et al., 2010 source

      Not checked in the free run.

    • cites Magoč and Salzberg, 2011 source

      Not checked in the free run.

  • May combine two claims.

    Interpretationreasoning

    Choosing a smaller P-value will reduce the FPR of the merged sequences, but a lower number of reads will be merged.

    “Choosing a smaller P-value will reduce the FPR of the merged sequences, but a lower number of reads will be merged.”
    Quote in the paperNot a substantial claim
    • The authors state this as an assumption: In the null model for the statistical test, the two corresponding reads are independent random sequences and there are no sequencing errors.
    • The authors state this as an assumption: The null hypothesis is that the two corresponding reads are independent from each other, meaning any overlap between the two reads is purely by chance.
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Premisecitation

    PANDAseq combines quality scores with sequence matches and thereby improves merging quality.

    “It combines quality scores with sequence matches and thereby improves merging quality.”
    Quote in the paperNot a substantial claim0 of 1 sources checked
    • cites Masella et al., 2012 source

      Not checked in the free run.

  • Probably not a substantial claim: may not pass S4 (based). May combine two claims.

    Interpretationnone given

    By merging paired-end reads, the overlapping region can be deployed for correcting sequencing errors and potentially yield sequences of higher quality.

    “By merging paired-end reads, the overlapping region between them can also be deployed for correcting sequencing errors and potentially yield sequences of higher quality.”
    Quote in the paperNot a substantial claim
    • The authors state this as an assumption: Sequencing errors are independent events.
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Premisecitation

    COPE is designed to handle deep genome sequencing datasets.

    “COPE is designed to handle deep genome sequencing datasets.”
    Quote in the paperNot a substantial claim0 of 1 sources checked
    • cites Liu et al., 2012 source

      Not checked in the free run.

  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Premisecitation

    COPE considers that k-mers that occur infrequently are likely to be sequencing errors.

    “Thus, it considers that k-mers that occur infrequently are likely to be sequencing errors.”
    Quote in the paperNot a substantial claim0 of 1 sources checked
    • cites Liu et al., 2012 source

      Not checked in the free run.

  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Premisecitation

    Shera merges reads by maximizing the number of matches between the paired-end reads.

    “Shera merges the reads by maximizing the number of matches between the paired-end reads.”
    Quote in the paperNot a substantial claim0 of 1 sources checked
    • cites Rodrigue et al., 2010 source

      Not checked in the free run.

  • Probably not a substantial claim: may not pass S3 (load-bearing), S4 (based).

    Interpretationreasoning

    COPE's lower FPR is likely because COPE is specifically designed for such deep sequencing datasets.

    “This is likely because COPE is specifically designed for such deep sequencing datasets.”
    Quote in the paperNot a substantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.

    Premisecitation

    COPE deploys an analogous approach as FLASH for finding the best overlap, but also takes into account the quality scores of mismatches.

    “COPE deploys an analogous approach as FLASH for finding the best overlap, but also takes into account the quality scores of mismatches.”
    Quote in the paperNot a substantial claim0 of 1 sources checked
    • cites Liu et al., 2012 source

      Not checked in the free run.

  • Probably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.

    Premisecitation

    PANDAseq works well with short overlap regions and does not require prior knowledge of the target DNA fragment size.

    “In contrast to FLASH, PANDAseq works well with short overlap regions and does not require prior knowledge of the target DNA fragment size.”
    Quote in the paperNot a substantial claim0 of 1 sources checked
    • cites Masella et al., 2012 source

      Not checked in the free run.

  • May combine two claims.

    Interpretationreasoning

    PEAR hides the latency of disk accesses and can use the majority of threads/cores for merging short reads and thus reduce overall run time.

    “By using this technique, we hide the latency of disk accesses and can use the majority of threads/cores for merging short reads and thus reduce overall run time.”
    Quote in the paperSubstantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Premisecitation

    Shera merges all reads and leaves it to the user to decide which merged reads are correct.

    “Shera merges all reads and leaves it to the user to decide which merged reads are correct.”
    Quote in the paperNot a substantial claim0 of 1 sources checked
    • cites Rodrigue et al., 2010 source

      Not checked in the free run.

  • Classified as probably not a substantial claim.

    Premisecitation

    PANDAseq assumes that all paired-end reads can be merged.

    “However, it assumes that all paired-end reads can be merged.”
    Quote in the paperSubstantial claim0 of 1 sources checked
    • cites Masella et al., 2012 source

      Not checked in the free run.

  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Premisecitation

    PANDAseq merges fragments by maximizing the probability of true sequence matches, given the observed sequences.

    “PANDAseq merges fragments by maximizing the probability of true sequence matches, given the observed sequences.”
    Quote in the paperNot a substantial claim0 of 1 sources checked
    • cites Masella et al., 2012 source

      Not checked in the free run.

  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Premisecitation

    FLASH constructs merged reads that maximize the overlap length-to-matches ratio.

    “FLASH constructs merged reads that maximize the overlap length-to-matches ratio.”
    Quote in the paperNot a substantial claim0 of 1 sources checked
    • cites Magoč and Salzberg, 2011 source

      Not checked in the free run.

  • May combine two claims.

    Interpretationown data

    PEAR produces highly accurate merged Illumina paired-end reads with low FPRs.

    “We introduce PEAR, a new software tool that produces highly accurate merged Illumina paired-end reads with low FPRs.”
    Quote in the paperSubstantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing), S4 (based).

    Interpretationnone given

    One main application scenario for PEAR is merging paired-end reads from datasets with varying DNA fragment sizes.

    “One main application scenario is the merging of paired-end reads from datasets with varying DNA fragment sizes.”
    Quote in the paperNot a substantial claim
31 of 31
  • The authors state this as an assumption.

    Sequencing errors are independent events.

    “Assuming that errors are independent events, we can calculate the probability of a true base match, given the observed base match as”
  • The authors state this as an assumption.

    There are no gaps in overlaps between Illumina paired-end reads.

    “assuming no gaps, as they are infrequent on Illumina platforms (Nakamura et al., 2011)”
  • The authors state this as an assumption.

    In the null model for the statistical test, the two corresponding reads are independent random sequences and there are no sequencing errors.

    “Let and be two independent random sequences and let us further assume that there are no sequencing errors.”
  • The authors state this as an assumption.

    The null hypothesis is that the two corresponding reads are independent from each other, meaning any overlap between the two reads is purely by chance.

    “we calculate a P-value for the null hypothesis that the two corresponding reads are independent from each other. By independent we mean that any overlap between the two reads is purely by chance.”
  • The authors state this as an assumption.

    The merged sequences are generated randomly with all base frequencies equally likely with probability 0.25 and all bases have an equal error probability e.

    “Assuming that the merged sequences are generated randomly with all base frequencies being equally likely with probability 0.25 and that all bases have an equal error probability e, we can simplify Equation (2) to Solving the above inequality, we obtain .”
  • The paper relies on this without support.

    The quality of Illumina reads decreases toward the end of the reads.

    “Because the quality of Illumina reads decreases toward the end of the reads, PANDAseq will therefore incorrectly merge reads that do not overlap.”
6 of 6

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

Each contradiction between two passages listed here was confirmed by an independent check.

  • No-overlap FPRs use a different denominator from the stated definition

    Major

    The paper defines FPR as the fraction of merged reads that should not have been merged. In the no-overlap dataset, every merged read meets that description, so the FPR for PEAR's eight merged reads would be 100%, not 0.03%. The other nonzero merged counts in that group have the same problem.

  • S. aureus correct-merge rates differ by more than approximately 2%

    Minor

    Table 2 gives correct-merge rates of 64.72% for PANDAseq and 60.45% for PEAR with the test disabled. Their difference is 4.27 percentage points, not approximately 2%.

    Reported 2 · recomputed 4.27

  • Reported 20-bp false-positive rate disagrees with Table 1

    Minor

    For PEAR with the statistical test disabled on the 20-bp mean-overlap dataset, the text reports an FPR of 2.78%, whereas Table 1 reports 3.16% for the same result.

  • PEAR does not always have a lower FPR than every competitor

    Minor

    The blanket claim includes the no-overlap dataset, where Table 1 reports a 0% FPR for FLASH but 0.03% for PEAR at P = 0.01 and 0.14% at MAP = 0.01.

4 of 4

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Zhang, J., Kobert, K., Flouri, T., & Stamatakis, A.
Affiliations
Heidelberg Institute for Theoretical Studies (DE)
Corresponding author
Flouri, Tomáš
Venue
Bioinformatics
Published
2013-10-18
Volume
30
Issue
5
Pages
614-620
ISSN
  • 1367-4803 (ISSN-L)
  • 1367-4811
OpenAlex
W2128711701
Cited by
4,497
References
18
Citations by year
2026: 248 · 2025: 359 · 2024: 429 · 2023: 384 · 2022: 406 · 2021: 540 · 2020: 559 · 2019: 498 · 2018: 481 · 2017: 318 · 2016: 188 · 2015: 67 · 2014: 15 · 2013: 1
FWCI
40.43
Type
journal article
Language
en
Open access
Locations
  • Bioinformatics (publishedVersion, cc-by)
  • Europe PMC (PubMed Central) (publishedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by)
  • PubMed (publishedVersion)
Funders
Deutsche Forschungsgemeinschaft
Topics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Genomics and Phylogenetic Studies
  • Physical Sciences › Computer Science › Artificial Intelligence › Algorithms and Data Compression
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Fractal and DNA sequence analysis
Keywords
pear, Illumina sequencing
MeSH terms
Software, Staphylococcus aureus, Sequence Alignment, Sequence Analysis, DNA, Genomics, High-Throughput Nucleotide Sequencing

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Claims read by deepseek-v4.1-flash under definition version 3 (extract-v3) on 2026-10-09.

Classified by jev-1.13-20260917 (gold-guideline-v0.2) on 2026-10-09.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review