{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,28]],"date-time":"2026-08-28T17:45:00Z","timestamp":1787939100716,"version":"build-2784847793"},"reference-count":18,"publisher":"Oxford University Press (OUP)","issue":"5","license":[{"start":{"date-parts":[[2016,10,2]],"date-time":"2016-10-02T00:00:00Z","timestamp":1475366400000},"content-version":"vor","delay-in-days":1080,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,3,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>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.<\/jats:p>\n                  <jats:p>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.<\/jats:p>\n                  <jats:p>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.<\/jats:p>\n                  <jats:p>Contact: \u00a0Tomas.Flouri@h-its.org<\/jats:p>","DOI":"10.1093\/bioinformatics\/btt593","type":"journal-article","created":{"date-parts":[[2013,10,18]],"date-time":"2013-10-18T23:46:23Z","timestamp":1382139983000},"page":"614-620","source":"Crossref","is-referenced-by-count":4161,"title":["PEAR: a fast and accurate Illumina Paired-End reAd mergeR"],"prefix":"10.1093","volume":"30","author":[{"given":"Jiajie","family":"Zhang","sequence":"first","affiliation":[{"name":"1 The Exelixis Lab, Scientific Computing Group, Heidelberg Institute for Theoretical Studies, Schloss-Wolfsbrunnenweg 35, D-69118 Heidelberg, 2Graduate School for Computing in Medicine and Life Sciences, 3Institut f\u00fcr Neuro- und Bioinformatik, University of L\u00fcbeck, 23538 L\u00fcbeck and 4Karlsruhe Institute of Technology, Institute for Theoretical Informatics, Postfach 6980, 76128 Karlsruhe, Germany"},{"name":"1 The Exelixis Lab, Scientific Computing Group, Heidelberg Institute for Theoretical Studies, Schloss-Wolfsbrunnenweg 35, D-69118 Heidelberg, 2Graduate School for Computing in Medicine and Life Sciences, 3Institut f\u00fcr Neuro- und Bioinformatik, University of L\u00fcbeck, 23538 L\u00fcbeck and 4Karlsruhe Institute of Technology, Institute for Theoretical Informatics, Postfach 6980, 76128 Karlsruhe, Germany"},{"name":"1 The Exelixis Lab, Scientific Computing Group, Heidelberg Institute for Theoretical Studies, Schloss-Wolfsbrunnenweg 35, D-69118 Heidelberg, 2Graduate School for Computing in Medicine and Life Sciences, 3Institut f\u00fcr Neuro- und Bioinformatik, University of L\u00fcbeck, 23538 L\u00fcbeck and 4Karlsruhe Institute of Technology, Institute for Theoretical Informatics, Postfach 6980, 76128 Karlsruhe, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kassian","family":"Kobert","sequence":"additional","affiliation":[{"name":"1 The Exelixis Lab, Scientific Computing Group, Heidelberg Institute for Theoretical Studies, Schloss-Wolfsbrunnenweg 35, D-69118 Heidelberg, 2Graduate School for Computing in Medicine and Life Sciences, 3Institut f\u00fcr Neuro- und Bioinformatik, University of L\u00fcbeck, 23538 L\u00fcbeck and 4Karlsruhe Institute of Technology, Institute for Theoretical Informatics, Postfach 6980, 76128 Karlsruhe, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tom\u00e1\u0161","family":"Flouri","sequence":"additional","affiliation":[{"name":"1 The Exelixis Lab, Scientific Computing Group, Heidelberg Institute for Theoretical Studies, Schloss-Wolfsbrunnenweg 35, D-69118 Heidelberg, 2Graduate School for Computing in Medicine and Life Sciences, 3Institut f\u00fcr Neuro- und Bioinformatik, University of L\u00fcbeck, 23538 L\u00fcbeck and 4Karlsruhe Institute of Technology, Institute for Theoretical Informatics, Postfach 6980, 76128 Karlsruhe, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexandros","family":"Stamatakis","sequence":"additional","affiliation":[{"name":"1 The Exelixis Lab, Scientific Computing Group, Heidelberg Institute for Theoretical Studies, Schloss-Wolfsbrunnenweg 35, D-69118 Heidelberg, 2Graduate School for Computing in Medicine and Life Sciences, 3Institut f\u00fcr Neuro- und Bioinformatik, University of L\u00fcbeck, 23538 L\u00fcbeck and 4Karlsruhe Institute of Technology, Institute for Theoretical Informatics, Postfach 6980, 76128 Karlsruhe, Germany"},{"name":"1 The Exelixis Lab, Scientific Computing Group, Heidelberg Institute for Theoretical Studies, Schloss-Wolfsbrunnenweg 35, D-69118 Heidelberg, 2Graduate School for Computing in Medicine and Life Sciences, 3Institut f\u00fcr Neuro- und Bioinformatik, University of L\u00fcbeck, 23538 L\u00fcbeck and 4Karlsruhe Institute of Technology, Institute for Theoretical Informatics, Postfach 6980, 76128 Karlsruhe, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"286","published-online":{"date-parts":[[2013,10,18]]},"reference":[{"key":"2023012710434526400_btt593-B1","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1016\/S0076-6879(96)66029-7","article-title":"Local alignment statistics","volume":"266","author":"Altschul","year":"1996","journal-title":"Methods Enzymol."},{"key":"2023012710434526400_btt593-B2","doi-asserted-by":"crossref","first-page":"3846","DOI":"10.1128\/AEM.02772-10","article-title":"Generation of multimillion-sequence 16S rRNA gene libraries from complex microbial communities by assembling paired-end Illumina reads","volume":"77","author":"Bartram","year":"2011","journal-title":"Appl. Environ. Microbiol."},{"key":"2023012710434526400_btt593-B3","doi-asserted-by":"crossref","first-page":"4516","DOI":"10.1073\/pnas.1000080107","article-title":"Global patterns of 16S rRNA diversity at a depth of millions of sequences per sample","volume":"108","author":"Caporaso","year":"2011","journal-title":"Proc. Natl Acad. Sci. USA"},{"key":"2023012710434526400_btt593-B4","doi-asserted-by":"crossref","first-page":"1767","DOI":"10.1093\/nar\/gkp1137","article-title":"The Sanger FASTQ file format for sequences with quality scores, and the Solexa\/Illumina FASTQ variants","volume":"38","author":"Cock","year":"2010","journal-title":"Nucleic Acids Res."},{"key":"2023012710434526400_btt593-B5","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1186\/1471-2105-11-485","article-title":"SolexaQA: at-a-glance quality assessment of Illumina second-generation sequencing data","volume":"11","author":"Cox","year":"2010","journal-title":"BMC Bioinformatics"},{"key":"2023012710434526400_btt593-B6","first-page":"183","article-title":"Illumina-based analysis of microbial community diversity","volume":"6","author":"Degnan","year":"2012","journal-title":"SME J."},{"key":"2023012710434526400_btt593-B7","doi-asserted-by":"crossref","first-page":"e15406","DOI":"10.1371\/journal.pone.0015406","article-title":"Microbiome profiling by Illumina sequencing of combinatorial sequence-tagged PCR products","volume":"5","author":"Gloor","year":"2010","journal-title":"PLoS One"},{"key":"2023012710434526400_btt593-B8","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1093\/bioinformatics\/btr708","article-title":"ART: a next-generation sequencing read simulator","volume":"28","author":"Huang","year":"2012","journal-title":"Bioinformatics"},{"key":"2023012710434526400_btt593-B9","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1038\/nmeth.1923","article-title":"Fast gapped-read alignment with Bowtie 2","volume":"9","author":"Langmead","year":"2012","journal-title":"Nat. Methods"},{"key":"2023012710434526400_btt593-B10","doi-asserted-by":"crossref","first-page":"2870","DOI":"10.1093\/bioinformatics\/bts563","article-title":"COPE: an accurate k-mer-based pair-end reads connection tool to facilitate genome assembly","volume":"28","author":"Liu","year":"2012","journal-title":"Bioinformatics"},{"key":"2023012710434526400_btt593-B11","doi-asserted-by":"crossref","first-page":"R103","DOI":"10.1186\/gb-2009-10-10-r103","article-title":"ALLPATHS 2: small genomes assembled accurately and with high continuity from short paired reads","volume":"10","author":"MacCallum","year":"2009","journal-title":"Genome Biol."},{"key":"2023012710434526400_btt593-B12","doi-asserted-by":"crossref","first-page":"2957","DOI":"10.1093\/bioinformatics\/btr507","article-title":"FLASH: fast length adjustment of short reads to improve genome assemblies","volume":"27","author":"Mago\u010d","year":"2011","journal-title":"Bioinformatics"},{"key":"2023012710434526400_btt593-B13","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1186\/1471-2105-13-31","article-title":"PANDAseq: paired-end assembler for Illumina sequences","volume":"13","author":"Masella","year":"2012","journal-title":"BMC Bioinformatics"},{"key":"2023012710434526400_btt593-B14","doi-asserted-by":"crossref","first-page":"e90","DOI":"10.1093\/nar\/gkr344","article-title":"Sequence-specific error profile of Illumina sequencers","volume":"39","author":"Nakamura","year":"2011","journal-title":"Nucleic Acids Res."},{"key":"2023012710434526400_btt593-B15","doi-asserted-by":"crossref","first-page":"e11840","DOI":"10.1371\/journal.pone.0011840","article-title":"Unlocking short read sequencing for metagenomics","volume":"5","author":"Rodrigue","year":"2010","journal-title":"PLoS One"},{"key":"2023012710434526400_btt593-B16","doi-asserted-by":"crossref","first-page":"5261","DOI":"10.1128\/AEM.00062-07","article-title":"Naive Bayesian classifier for rapid assignment of rRNA sequences into the new bacterial taxonomy","volume":"73","author":"Wang","year":"2007","journal-title":"Appl. Environ. Microbiol."},{"key":"2023012710434526400_btt593-B17","doi-asserted-by":"crossref","first-page":"726","DOI":"10.1186\/1471-2164-11-726","article-title":"De novo assembly and characterization of root transcriptome using Illumina paired-end sequencing and development of cSSR markers in sweet potato (Ipomoea batatas)","volume":"11","author":"Wang","year":"2010","journal-title":"BMC Genomics"},{"key":"2023012710434526400_btt593-B18","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1038\/ismej.2010.160","article-title":"BIPES, a cost-effective high-throughput method for assessing microbial diversity","volume":"5","author":"Zhou","year":"2011","journal-title":"ISME J."}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/30\/5\/614\/48919224\/bioinformatics_30_5_614.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/30\/5\/614\/48919224\/bioinformatics_30_5_614.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T06:04:55Z","timestamp":1674799495000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/30\/5\/614\/247231"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,18]]},"references-count":18,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2014,3,1]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btt593","relation":{},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2014,3,1]]},"published":{"date-parts":[[2013,10,18]]}}}