{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T14:42:46Z","timestamp":1773585766067,"version":"3.50.1"},"reference-count":10,"publisher":"Oxford University Press (OUP)","issue":"8","license":[{"start":{"date-parts":[[2016,10,2]],"date-time":"2016-10-02T00:00:00Z","timestamp":1475366400000},"content-version":"vor","delay-in-days":1326,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,4,15]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Summary: Many high-throughput sequencing experiments produce paired DNA reads. Paired-end DNA reads provide extra positional information that is useful in reliable mapping of short reads to a reference genome, as well as in downstream analyses of structural variations. Given the importance of paired-end alignments, it is surprising that there have been no previous publications focusing on this topic. In this article, we present a new probabilistic framework to predict the alignment of paired-end reads to a reference genome. Using both simulated and real data, we compare the performance of our method with six other read-mapping tools that provide a paired-end option. We show that our method provides a good combination of accuracy, error rate and computation time, especially in more challenging and practical cases, such as when the reference genome is incomplete or unavailable for the sample, or when there are large variations between the reference genome and the source of the reads. An open-source implementation of our method is available as part of Last, a multi-purpose alignment program freely available at http:\/\/last.cbrc.jp.<\/jats:p>\n               <jats:p>Contact: \u00a0martin@cbrc.jp<\/jats:p>\n               <jats:p>Supplementary information: \u00a0Supplementary data are available at Bioinformatics online.<\/jats:p>","DOI":"10.1093\/bioinformatics\/btt073","type":"journal-article","created":{"date-parts":[[2013,2,15]],"date-time":"2013-02-15T04:03:00Z","timestamp":1360900980000},"page":"965-972","source":"Crossref","is-referenced-by-count":18,"title":["An approximate Bayesian approach for mapping paired-end DNA reads to a reference genome"],"prefix":"10.1093","volume":"29","author":[{"given":"Anish Man Singh","family":"Shrestha","sequence":"first","affiliation":[{"name":"Computational Biology Research Center, National Institute for Advanced Industrial Science and Technology (AIST), Koto-ku, Tokyo 135-0064, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin C.","family":"Frith","sequence":"additional","affiliation":[{"name":"Computational Biology Research Center, National Institute for Advanced Industrial Science and Technology (AIST), Koto-ku, Tokyo 135-0064, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2013,2,14]]},"reference":[{"key":"2023012810300760600_btt073-B1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511790492","volume-title":"Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids","author":"Durbin","year":"1998"},{"key":"2023012810300760600_btt073-B2","doi-asserted-by":"crossref","first-page":"e100","DOI":"10.1093\/nar\/gkq010","article-title":"Incorporating sequence quality data into alignment improves DNA read mapping","volume":"38","author":"Frith","year":"2010","journal-title":"Nucleic Acids Res."},{"key":"2023012810300760600_btt073-B3","doi-asserted-by":"crossref","first-page":"D876","DOI":"10.1093\/nar\/gkq963","article-title":"The UCSC genome browser database: update 2011","volume":"39","author":"Fujita","year":"2011","journal-title":"Nucleic Acids Res."},{"key":"2023012810300760600_btt073-B4","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1101\/gr.113985.110","article-title":"Adaptive seeds tame genomic sequence comparison","volume":"21","author":"Kie\u0142basa","year":"2011","journal-title":"Genome Res."},{"key":"2023012810300760600_btt073-B5","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":"2023012810300760600_btt073-B6","doi-asserted-by":"crossref","first-page":"1754","DOI":"10.1093\/bioinformatics\/btp324","article-title":"Fast and accurate short read alignmen with Burrows-Wheeler transform","volume":"25","author":"Li","year":"2009","journal-title":"Bioinformatics"},{"key":"2023012810300760600_btt073-B7","doi-asserted-by":"crossref","first-page":"1966","DOI":"10.1093\/bioinformatics\/btp336","article-title":"SOAP2: an improved ultrafast tool for short read alignment","volume":"25","author":"Li","year":"2009","journal-title":"Bioinformatics"},{"key":"2023012810300760600_btt073-B8","doi-asserted-by":"crossref","first-page":"936","DOI":"10.1101\/gr.111120.110","article-title":"Stampy: a statistical algorithm for sensitive and fast mapping of Illumina sequence reads","volume":"21","author":"Lunter","year":"2011","journal-title":"Genome Res."},{"key":"2023012810300760600_btt073-B9","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/nar\/29.1.308","article-title":"dbSNP: the NCBI database of genetic variation","volume":"29","author":"Sherry","year":"2001","journal-title":"Nucleic Acids Res."},{"key":"2023012810300760600_btt073-B10","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1093\/bioinformatics\/btq057","article-title":"Fast and SNP-tolerant detection of complex variants and splicing in short reads","volume":"26","author":"Wu","year":"2010","journal-title":"Bioinformatics"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/29\/8\/965\/48899818\/bioinformatics_29_8_965.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/29\/8\/965\/48899818\/bioinformatics_29_8_965.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,28]],"date-time":"2023-01-28T12:14:13Z","timestamp":1674908053000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/29\/8\/965\/224799"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,14]]},"references-count":10,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2013,4,15]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btt073","relation":{},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2013,4,15]]},"published":{"date-parts":[[2013,2,14]]}}}