{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T11:10:55Z","timestamp":1778929855486,"version":"3.51.4"},"reference-count":22,"publisher":"Oxford University Press (OUP)","issue":"9","license":[{"start":{"date-parts":[[2016,10,2]],"date-time":"2016-10-02T00:00:00Z","timestamp":1475366400000},"content-version":"vor","delay-in-days":997,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,5,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Motivation: Base-calling of sequencing data produced by high-throughput sequencing platforms is a fundamental process in current bioinformatics analysis. However, existing third-party probabilistic or machine-learning methods that significantly improve the accuracy of base-calls on these platforms are impractical for production use due to their computational inefficiency.<\/jats:p>\n               <jats:p>Results: We directly formulate base-calling as a blind deconvolution problem and implemented BlindCall as an efficient solver to this inverse problem. BlindCall produced base-calls at accuracy comparable to state-of-the-art probabilistic methods while processing data at rates 10 times faster in most cases. The computational complexity of BlindCall scales linearly with read length making it better suited for new long-read sequencing technologies.<\/jats:p>\n               <jats:p>Availability and Implementation: BlindCall is implemented as a set of Matlab scripts available for download at http:\/\/cbcb.umd.edu\/\u223chcorrada\/secgen.<\/jats:p>\n               <jats:p>Contact: \u00a0hcorrada@umiacs.umd.edu<\/jats:p>","DOI":"10.1093\/bioinformatics\/btu010","type":"journal-article","created":{"date-parts":[[2014,1,11]],"date-time":"2014-01-11T02:06:09Z","timestamp":1389405969000},"page":"1214-1219","source":"Crossref","is-referenced-by-count":8,"title":["BlindCall: ultra-fast base-calling of high-throughput sequencing data by blind deconvolution"],"prefix":"10.1093","volume":"30","author":[{"given":"Chengxi","family":"Ye","sequence":"first","affiliation":[{"name":"1 Department of Computer Science, 2Center for Bioinformatics and Computational Biology and 3Applied Mathematics and Scientific Computing, University of Maryland, College Park, USA"},{"name":"1 Department of Computer Science, 2Center for Bioinformatics and Computational Biology and 3Applied Mathematics and Scientific Computing, University of Maryland, College Park, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chiaowen","family":"Hsiao","sequence":"additional","affiliation":[{"name":"1 Department of Computer Science, 2Center for Bioinformatics and Computational Biology and 3Applied Mathematics and Scientific Computing, University of Maryland, College Park, USA"},{"name":"1 Department of Computer Science, 2Center for Bioinformatics and Computational Biology and 3Applied Mathematics and Scientific Computing, University of Maryland, College Park, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H\u00e9ctor","family":"Corrada Bravo","sequence":"additional","affiliation":[{"name":"1 Department of Computer Science, 2Center for Bioinformatics and Computational Biology and 3Applied Mathematics and Scientific Computing, University of Maryland, College Park, USA"},{"name":"1 Department of Computer Science, 2Center for Bioinformatics and Computational Biology and 3Applied Mathematics and Scientific Computing, University of Maryland, College Park, USA"},{"name":"1 Department of Computer Science, 2Center for Bioinformatics and Computational Biology and 3Applied Mathematics and Scientific Computing, University of Maryland, College Park, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2014,1,9]]},"reference":[{"key":"2023012710521979700_btu010-B1","doi-asserted-by":"crossref","first-page":"R18","DOI":"10.1186\/gb-2011-12-2-r18","article-title":"Analyzing and minimizing PCR amplification bias in Illumina sequencing libraries","volume":"12","author":"Aird","year":"2011","journal-title":"Genome Biol."},{"key":"2023012710521979700_btu010-B2","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1038\/nmeth.1527","article-title":"Limitations of next-generation genome sequence assembly","volume":"8","author":"Alkan","year":"2011","journal-title":"Nat. Methods"},{"key":"2023012710521979700_btu010-B3","first-page":"585","article-title":"Laplacian eigenmaps and spectral techniques for embedding and clustering","volume":"14","author":"Belkin","year":"2001","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"2023012710521979700_btu010-B4","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1038\/nature07517","article-title":"Accurate whole human genome sequencing using reversible terminator chemistry","volume":"456","author":"Bentley","year":"2008","journal-title":"Nature"},{"key":"2023012710521979700_btu010-B5","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1111\/j.1541-0420.2009.01353.x","article-title":"Model-based quality assessment and base-calling for second-generation sequencing data","volume":"66","author":"Bravo","year":"2010","journal-title":"Biometrics"},{"key":"2023012710521979700_btu010-B6","doi-asserted-by":"crossref","first-page":"e105","DOI":"10.1093\/nar\/gkn425","article-title":"Substantial biases in ultra-short read data sets from high-throughput DNA sequencing","volume":"36","author":"Dohm","year":"2008","journal-title":"Nucleic Acids Res."},{"key":"2023012710521979700_btu010-B7","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1038\/nmeth.1230","article-title":"Alta-Cyclic: a self-optimizing base caller for next-generation sequencing","volume":"5","author":"Erlich","year":"2008","journal-title":"Nat. Methods"},{"key":"2023012710521979700_btu010-B8","author":"Illumina","year":"2013"},{"key":"2023012710521979700_btu010-B9","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1089\/cmb.2010.0247","article-title":"naiveBayesCall: an efficient model-based base-calling algorithm for high-throughput sequencing","volume":"18","author":"Kao","year":"2011","journal-title":"J. Comput. Biol. A J. Comput. Mol. Cell Biol."},{"key":"2023012710521979700_btu010-B10","doi-asserted-by":"crossref","first-page":"1884","DOI":"10.1101\/gr.095299.109","article-title":"BayesCall: A model-based base-calling algorithm for high-throughput short-read sequencing","volume":"19","author":"Kao","year":"2009","journal-title":"Genome Res."},{"key":"2023012710521979700_btu010-B11","doi-asserted-by":"crossref","first-page":"R83","DOI":"10.1186\/gb-2009-10-8-r83","article-title":"Improved base calling for the Illumina Genome Analyzer using machine learning strategies","volume":"10","author":"Kircher","year":"2009","journal-title":"Genome Biol."},{"key":"2023012710521979700_btu010-B12","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":"2023012710521979700_btu010-B13","doi-asserted-by":"crossref","first-page":"2354","DOI":"10.1109\/TPAMI.2011.148","article-title":"Understanding blind deconvolution algorithms","volume":"33","author":"Levin","year":"2011","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"2023012710521979700_btu010-B14","volume-title":"A Wavelet Tour of Signal Processing : the Sparse Way","author":"Mallat","year":"2009"},{"key":"2023012710521979700_btu010-B15","doi-asserted-by":"crossref","first-page":"R13","DOI":"10.1186\/gb-2012-13-2-r13","article-title":"All Your Base: a fast and accurate probabilistic approach to base calling","volume":"13","author":"Massingham","year":"2012","journal-title":"Genome Biol."},{"key":"2023012710521979700_btu010-B16","author":"Page","year":"1999"},{"key":"2023012710521979700_btu010-B17","doi-asserted-by":"crossref","first-page":"1208","DOI":"10.1093\/bioinformatics\/btt117","article-title":"freeIbis: an efficient basecaller with calibrated quality scores for Illumina sequencers","volume":"29","author":"Renaud","year":"2013","journal-title":"Bioinformatics"},{"key":"2023012710521979700_btu010-B18","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1109\/34.868688","article-title":"Normalized cuts and image segmentation","volume":"22","author":"Shi","year":"2000","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell"},{"key":"2023012710521979700_btu010-B19","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1137\/090772447","article-title":"Sparse signal reconstruction via iterative support detection","volume":"3","author":"Wang","year":"2010","journal-title":"SIAM J. Imaging Sci."},{"key":"2023012710521979700_btu010-B20","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1137\/080724265","article-title":"A new alternating minimization algorithm for total variation image reconstruction","volume":"1","author":"Wang","year":"2008","journal-title":"SIAM J. Imaging Sci."},{"key":"2023012710521979700_btu010-B21","first-page":"1107","article-title":"Unnatural L 0 sparse representation for natural image deblurring","author":"Xu","year":"2013","journal-title":"IEEE Conference on Computer Vision and Pattern Recognition (CVPR '13)"},{"key":"2023012710521979700_btu010-B22","doi-asserted-by":"crossref","first-page":"S1","DOI":"10.1186\/1471-2105-13-S6-S1","article-title":"Exploiting sparseness in de novo genome assembly","volume":"13","author":"Ye","year":"2012","journal-title":"BMC Bioinform."}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/30\/9\/1214\/48923304\/bioinformatics_30_9_1214.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/30\/9\/1214\/48923304\/bioinformatics_30_9_1214.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T11:32:42Z","timestamp":1674819162000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/30\/9\/1214\/235827"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,9]]},"references-count":22,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2014,5,1]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btu010","relation":{},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2014,5,1]]},"published":{"date-parts":[[2014,1,9]]}}}