{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:37:50Z","timestamp":1742380670086},"reference-count":13,"publisher":"Oxford University Press (OUP)","issue":"1","license":[{"start":{"date-parts":[[2016,10,2]],"date-time":"2016-10-02T00:00:00Z","timestamp":1475366400000},"content-version":"vor","delay-in-days":2894,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc\/2.0\/uk\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,1,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Motivation: A plethora of alignment tools have been created that are designed to best fit different types of alignment conditions. While some of these are made for aligning Illumina Sequence Analyzer reads, none of these are fully utilizing its probability (prb) output. In this article, we will introduce a new alignment approach (Slider) that reduces the alignment problem space by utilizing each read base's probabilities given in the prb files.<\/jats:p>\n               <jats:p>Results: Compared with other aligners, Slider has higher alignment accuracy and efficiency. In addition, given that Slider matches bases with probabilities other than the most probable, it significantly reduces the percentage of base mismatches. The result is that its SNP predictions are more accurate than other SNP prediction approaches used today that start from the most probable sequence, including those using base quality.<\/jats:p>\n               <jats:p>Contact: \u00a0nmalhis@bcgsc.ca<\/jats:p>\n               <jats:p>Supplementary information and availability: \u00a0http:\/\/www.bcgsc.ca\/platform\/bioinfo\/software\/slider<\/jats:p>","DOI":"10.1093\/bioinformatics\/btn565","type":"journal-article","created":{"date-parts":[[2008,10,31]],"date-time":"2008-10-31T00:34:37Z","timestamp":1225413277000},"page":"6-13","source":"Crossref","is-referenced-by-count":40,"title":["Slider\u2014maximum use of probability information for alignment of short sequence reads and SNP detection"],"prefix":"10.1093","volume":"25","author":[{"given":"Nawar","family":"Malhis","sequence":"first","affiliation":[{"name":"1 Genome Sciences Centre, BC Cancer Agency, Vancouver and 2School of Computing Science, Simon Fraser University, Burnaby, BC, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaron S. N.","family":"Butterfield","sequence":"additional","affiliation":[{"name":"1 Genome Sciences Centre, BC Cancer Agency, Vancouver and 2School of Computing Science, Simon Fraser University, Burnaby, BC, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Ester","sequence":"additional","affiliation":[{"name":"1 Genome Sciences Centre, BC Cancer Agency, Vancouver and 2School of Computing Science, Simon Fraser University, Burnaby, BC, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven J. M.","family":"Jones","sequence":"additional","affiliation":[{"name":"1 Genome Sciences Centre, BC Cancer Agency, Vancouver and 2School of Computing Science, Simon Fraser University, Burnaby, BC, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2008,10,30]]},"reference":[{"key":"2023013110100761700_B1","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/360825.360855","article-title":"Efficient string matching: an aid to bibiographic search","volume":"18","author":"Aho","year":"1975","journal-title":"Commun. ACM"},{"key":"2023013110100761700_B2","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/S0022-2836(05)80360-2","article-title":"Basic local alignment search tool","volume":"215","author":"Altschul","year":"1990","journal-title":"J. Mol. Biol."},{"key":"2023013110100761700_B3","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1101\/gr.070227.107","article-title":"Quality scores and SNP detection in sequencing-by-synthesis systems","volume":"18","author":"Brockman","year":"2008","journal-title":"Genome Res."},{"key":"2023013110100761700_B4","doi-asserted-by":"crossref","first-page":"2478","DOI":"10.1093\/nar\/30.11.2478","article-title":"Fast algorithms for large-scale genome alignment and comparison","volume":"30","author":"Delcher","year":"2002","journal-title":"Nucleic Acids Res."},{"key":"2023013110100761700_B5","first-page":"513","article-title":"Sparse dynamic programming","volume-title":"Proceedings 1st Symposium Discrete Algorithms ACM and SIAM","author":"Eppstein","year":"1990"},{"key":"2023013110100761700_B6","article-title":"In Index structures, ch. 14","volume-title":"Database Systems: The Complete Book.","author":"Garcia-Molina","year":"2008","edition":"2nd edn"},{"key":"2023013110100761700_B7","doi-asserted-by":"crossref","first-page":"839","DOI":"10.1101\/gr.073262.107","article-title":"The new paradigm of flow cell sequencing","volume":"18","author":"Holt","year":"2008","journal-title":"Genome Res."},{"key":"2023013110100761700_B8","article-title":"In External sorting, sec 5.4","volume-title":"The Art of Computer Programming","author":"Knuth","year":"1998","edition":"2nd"},{"key":"2023013110100761700_B9","doi-asserted-by":"crossref","first-page":"1052","DOI":"10.1093\/bioinformatics\/16.11.1052","article-title":"MPBLAST: improved BLAST performance with multiplexed queries","volume":"16","author":"Korf","year":"2000","journal-title":"Bioinformatics"},{"key":"2023013110100761700_B10","doi-asserted-by":"crossref","first-page":"R12","DOI":"10.1186\/gb-2004-5-2-r12","article-title":"Versatile and open software for comparing large genomes","volume":"5","author":"Kurtz","year":"2004","journal-title":"Genome Biol."},{"key":"2023013110100761700_B11","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1186\/1471-2105-8-474","article-title":"High-throughput sequence alignment using Graphics Processing Units","volume":"8","author":"Schatz","year":"2007","journal-title":"BMC Bioinformatics"},{"key":"2023013110100761700_B12","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1186\/1471-2105-6-31","article-title":"Automated generation of heuristics for biological sequence comparison","volume":"6","author":"Slater","year":"2005","journal-title":"BMC Bioinformatics"},{"key":"2023013110100761700_B13","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1186\/1471-2105-9-128","article-title":"Using quality scores and longer reads improves accuracy of Solexa read mapping","volume":"9","author":"Smith","year":"2008","journal-title":"BMC Bioinformatics"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/25\/1\/6\/48984193\/bioinformatics_25_1_6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/25\/1\/6\/48984193\/bioinformatics_25_1_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T19:43:27Z","timestamp":1675194207000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/25\/1\/6\/301571"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,10,30]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,1,1]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btn565","relation":{},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2009,1,1]]},"published":{"date-parts":[[2008,10,30]]}}}