{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T17:12:29Z","timestamp":1779297149554,"version":"3.51.4"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,11,4]],"date-time":"2016-11-04T00:00:00Z","timestamp":1478217600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2016,11,4]],"date-time":"2016-11-04T00:00:00Z","timestamp":1478217600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1337131"],"award-info":[{"award-number":["CCF-1337131"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1247693"],"award-info":[{"award-number":["IIS-1247693"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1337131"],"award-info":[{"award-number":["CCF-1337131"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1247693"],"award-info":[{"award-number":["IIS-1247693"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1337131"],"award-info":[{"award-number":["CCF-1337131"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1247693"],"award-info":[{"award-number":["IIS-1247693"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"abstract":"<jats:title>Abstract<\/jats:title><jats:sec>\n                <jats:title>Background<\/jats:title>\n                <jats:p>The Basic Local Alignment Search Tool (BLAST) is a fundamental program in the life sciences that searches databases for sequences that are most similar to a query sequence. Currently, the BLAST algorithm utilizes a query-indexed approach. Although many approaches suggest that sequence search with a database index can achieve much higher throughput (e.g., BLAT, SSAHA, and CAFE), they cannot deliver the same level of sensitivity as the query-indexed BLAST, i.e., NCBI BLAST, or they can only support nucleotide sequence search, e.g., MegaBLAST. Due to different challenges and characteristics between query indexing and database indexing, the existing techniques for query-indexed search cannot be used into database indexed search.<\/jats:p>\n              <\/jats:sec><jats:sec>\n                <jats:title>Results<\/jats:title>\n                <jats:p>muBLASTP, a novel database-indexed BLAST for protein sequence search, delivers identical hits returned to NCBI BLAST. On Intel Haswell multicore CPUs, for a single query, the single-threaded muBLASTP achieves up to a 4.41-fold speedup for alignment stages, and up to a 1.75-fold end-to-end speedup over single-threaded NCBI BLAST. For a batch of queries, the multithreaded muBLASTP achieves up to a 5.7-fold speedups for alignment stages, and up to a 4.56-fold end-to-end speedup over multithreaded NCBI BLAST.<\/jats:p>\n              <\/jats:sec><jats:sec>\n                <jats:title>Conclusions<\/jats:title>\n                <jats:p>With a newly designed index structure for protein database and associated optimizations in BLASTP algorithm, we re-factored BLASTP algorithm for modern multicore processors that achieves much higher throughput with acceptable memory footprint for the database index.<\/jats:p>\n              <\/jats:sec>","DOI":"10.1186\/s12859-016-1302-4","type":"journal-article","created":{"date-parts":[[2016,11,4]],"date-time":"2016-11-04T02:57:38Z","timestamp":1478228258000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["muBLASTP: database-indexed protein sequence search on multicore CPUs"],"prefix":"10.1186","volume":"17","author":[{"given":"Jing","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanchit","family":"Misra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wu-chun","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,4]]},"reference":[{"key":"1302_CR1","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/S0022-2836(05)80360-2","volume":"215","author":"SF Altschul","year":"1990","unstructured":"Altschul SF, Gish W, Miller W, Myers EW, Lipman DJ. Basic Local Alignment Search Tool. J Mol Biol. 1990; 215:403\u201310.","journal-title":"J Mol Biol"},{"key":"1302_CR2","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1186\/1471-2105-10-421","volume":"10","author":"C Camacho","year":"2009","unstructured":"Camacho C, Coulouris G, Avagyan V, Ma N, Papadopoulos J, Bealer K, Madden TL. BLAST+ Architecture and Applications. BMC Bioinforma. 2009; 10:421.","journal-title":"BMC Bioinforma"},{"key":"1302_CR3","volume-title":"16th IEEE Int\u2019l Parallel & Distrib. Processing Symp","author":"RD Bjornson","year":"2002","unstructured":"Bjornson RD, Sherman AH, Weston SB, Willard N, Wing J. TurboBLAST(r): A Parallel Implementation of BLAST Built on the TurboHub. In: 16th IEEE Int\u2019l Parallel & Distrib. Processing Symp. Washington: IEEE Computer Society: 2002. p. 8."},{"issue":"6","key":"1302_CR4","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1093\/bioinformatics\/btt013","volume":"29","author":"CS Oehmen","year":"2013","unstructured":"Oehmen CS, Baxter DJ. ScalaBLAST 2.0: Rapid and Robust BLAST Calculations on Multiprocessor Systems. Bioinformatics. 2013; 29(6):797\u20138.","journal-title":"Bioinformatics"},{"key":"1302_CR5","unstructured":"Darling AE, Carey L, Feng W. The Design, Implementation, and Evaluation of mpiBLAST; 2003."},{"issue":"2","key":"1302_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1371579.1371581","volume":"1","author":"A Jacob","year":"2008","unstructured":"Jacob A, Lancaster J, Buhler J, Harris B, Chamberlain RD. Mercury BLASTP: Accelerating Protein Sequence Alignment. ACM Trans Reconfig Tech Syst. 2008; 1(2):1\u201344.","journal-title":"ACM Trans Reconfig Tech Syst"},{"key":"1302_CR7","doi-asserted-by":"crossref","unstructured":"Mahram A, Herbordt MC. Fast and Accurate NCBI BLASTP: Acceleration with Multiphase FPGA-based Prefiltering. In: 24th ACM Int\u2019l Conf. on Supercomputing: 2010. p. 73\u201382.","DOI":"10.1145\/1810085.1810099"},{"key":"1302_CR8","doi-asserted-by":"crossref","unstructured":"Zhang J, Lin H, Wang H, Feng W. cuBLASTP: Fine-Grained Parallelization of Protein Sequence Search on a GPU. In: 29th IEEE Int\u2019l Parallel & Distrib. Processing Symp: 2014. p. 251\u201360.","DOI":"10.1109\/IPDPS.2014.36"},{"key":"1302_CR9","doi-asserted-by":"crossref","unstructured":"Xiao S, Lin H, Feng W. Accelerating Protein Sequence Search in a Heterogeneous Computing System. In: 25th IEEE Int\u2019l Parallel & Distrib. Processing Symp: 2011. p. 1212\u201322.","DOI":"10.1109\/IPDPS.2011.115"},{"issue":"99","key":"1302_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TCBB.2015.2465951","volume":"PP","author":"J Zhang","year":"2015","unstructured":"Zhang J, Wang H, Feng W. cuBLASTP: Fine-Grained Parallelization of Protein Sequence Search on CPU+GPU. IEEE\/ACM Trans Comput Biol Bioinf. 2015; PP(99):1\u20131.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinf"},{"key":"1302_CR11","first-page":"98","volume":"31","author":"N Wan","year":"2009","unstructured":"Wan N, Xie H, Zhang Q, Zhao K, Zuo X, Yu J. A Preliminary Exploration on Parallelized BLAST Algorithm Using GPU. Comput Eng Sci. 2009; 31:98\u2013112.","journal-title":"Comput Eng Sci"},{"key":"1302_CR12","doi-asserted-by":"publisher","first-page":"1678","DOI":"10.1109\/TCBB.2011.33","volume":"8","author":"W Liu","year":"2011","unstructured":"Liu W, Schmidt B, M\u00fcller-Wittig W. CUDA-BLASTP: Accelerating BLASTP on CUDA-enabled Graphics Hardware. IEEE\/ACM Trans Comput Biol Bioinf. 2011; 8:1678\u201384.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinf"},{"key":"1302_CR13","doi-asserted-by":"publisher","first-page":"1384","DOI":"10.1093\/bioinformatics\/btu047","volume":"30","author":"K Zhao","year":"2014","unstructured":"Zhao K, Chu X. G-BLASTN: Accelerating Nucleotide Alignment by Graphics Processors. Bioinformatics. 2014; 30:1384\u201391.","journal-title":"Bioinformatics"},{"key":"1302_CR14","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1109\/TCBB.2004.32","volume":"1","author":"M Cameron","year":"2004","unstructured":"Cameron M, Williams H, Cannane A. Improved Gapped Alignment in BLAST. IEEE\/ACM Trans Comput Biol Bioinforma. 2004; 1:116\u201329.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinforma"},{"key":"1302_CR15","doi-asserted-by":"publisher","first-page":"3389","DOI":"10.1093\/nar\/25.17.3389","volume":"25","author":"SF Altschul","year":"1997","unstructured":"Altschul SF, Madden TL, Sch\u00e4ffer AA, Zhang J, Zhang Z, Miller W, Lipman DJ. Gapped BLAST and PSI-BLAST: A New Generation of Protein Database Search Programs. Nucleic Acids Res. 1997; 25:3389\u2013402.","journal-title":"Nucleic Acids Res"},{"key":"1302_CR16","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s11227-006-0041-0","volume":"40","author":"X Jiang","year":"2007","unstructured":"Jiang X, Zhang P, Liu X. Survey on Index Based Homology Search Algorithms. J Supercomput. 2007; 40:185\u2013212.","journal-title":"J Supercomput"},{"key":"1302_CR17","unstructured":"Cameron M. Efficient Homology Search for Genomic Sequence Databases. School of Computer Science and Information Technology: RMIT University; 2006."},{"key":"1302_CR18","doi-asserted-by":"publisher","first-page":"1725","DOI":"10.1101\/gr.194201","volume":"11","author":"Z Ning","year":"2001","unstructured":"Ning Z, Cox AJ, Mullikin JC. SSAHA: a Fast Search Method for Large DNA Databases. Genome Res. 2001; 11:1725\u20139.","journal-title":"Genome Res"},{"key":"1302_CR19","doi-asserted-by":"publisher","first-page":"1757","DOI":"10.1093\/bioinformatics\/btn322","volume":"24","author":"A Morgulis","year":"2008","unstructured":"Morgulis A, Coulouris G, Raytselis Y, Madden TL, Agarwala R, Sch\u00e4ffer AA. Database Indexing for Production MegaBLAST Searches. Bioinformatics. 2008; 24:1757\u201364.","journal-title":"Bioinformatics"},{"key":"1302_CR20","volume-title":"21st Int\u2019l ACM SIGIR Conf. on Research and Development in Information Retrieval","author":"HE Williams","year":"1998","unstructured":"Williams HE. Cafe: An Indexed Approach to Searching Genomic Databases. In: 21st Int\u2019l ACM SIGIR Conf. on Research and Development in Information Retrieval. New York: ACM: 1998. p. 389."},{"key":"1302_CR21","volume-title":"Improving the Performance and Precision of Bioinformatics Algorithms","author":"X Wu","year":"2008","unstructured":"Wu X. Improving the Performance and Precision of Bioinformatics Algorithms. College Park: University of Maryland; 2008."},{"key":"1302_CR22","unstructured":"Chen X. A Framework for Comparing Homology Search Techniques. School of Computer Science and Information Technology: RMIT University; 2004."},{"issue":"Suppl 5","key":"1302_CR23","doi-asserted-by":"publisher","first-page":"S21","DOI":"10.1186\/1471-2105-7-S5-S21","volume":"7","author":"S For\u00eat","year":"2006","unstructured":"For\u00eat S, Kantorovitz MR, Burden CJ. Asymptotic Behaviour and Optimal Word Size for Exact and Approximate Word Matches between Random Sequences. BMC Bioinforma. 2006; 7(Suppl 5):S21. doi:10.1186\/1471-2105-7-S5-S21.","journal-title":"BMC Bioinforma"},{"issue":"22","key":"1302_CR24","doi-asserted-by":"publisher","first-page":"4125","DOI":"10.1093\/bioinformatics\/bti658","volume":"21","author":"TJ Wu","year":"2005","unstructured":"Wu TJ, Huang YH, Li LA. Optimal Word Sizes for Dissimilarity Measures and Estimation of the Degree of Dissimilarity between DNA Sequences. Bioinformatics. 2005; 21(22):4125\u201332.","journal-title":"Bioinformatics"},{"issue":"23","key":"1302_CR25","doi-asserted-by":"publisher","first-page":"6935","DOI":"10.1093\/nar\/gkg886","volume":"31","author":"V Gotea","year":"2003","unstructured":"Gotea V, Veeramachaneni V, Makalowski W. Mastering Seeds for Genomic Size Nucleotide BLAST Searches. Nucleic Acids Res. 2003; 31(23):6935\u201341.","journal-title":"Nucleic Acids Res"},{"key":"1302_CR26","unstructured":"The Developer\u2019s Guide to BLAST. 2014. https:\/\/github.com\/elucify\/blast-docs\/wiki\/The-Developer\u2019s-Guide-to-BLAST. Accessed 26 Oct 2016."},{"issue":"7","key":"1302_CR27","doi-asserted-by":"publisher","first-page":"902","DOI":"10.1093\/bioinformatics\/bti070","volume":"21","author":"YK Yu","year":"2005","unstructured":"Yu YK, Altschul SF. The Construction of Amino Acid Substitution Matrices for the Comparison of Proteins with Non-standard Compositions. Bioinformatics. 2005; 21(7):902\u201311.","journal-title":"Bioinformatics"},{"issue":"14","key":"1302_CR28","doi-asserted-by":"publisher","first-page":"2994","DOI":"10.1093\/nar\/29.14.2994","volume":"29","author":"AA Sch\u00e4ffer","year":"2001","unstructured":"Sch\u00e4ffer AA, Aravind L, Madden TL, Shavirin S, Spouge JL, Wolf YI, Koonin EV, Altschul SF. Improving the Accuracy of PSI-BLAST Protein Database Searches with Composition-based Statistics and Other Refinements. Nucleic Acids Res. 2001; 29(14):2994\u20133005.","journal-title":"Nucleic Acids Res"},{"key":"1302_CR29","doi-asserted-by":"publisher","first-page":"D36","DOI":"10.1093\/nar\/gks1195","volume":"41","author":"DA Benson","year":"2013","unstructured":"Benson DA, Cavanaugh M, Clark K, Karsch-Mizrachi I, Lipman DJ, Ostell J, Sayers EW. GenBank. Nucleic Acids Res. 2013; 41:D36\u201342.","journal-title":"Nucleic Acids Res"},{"key":"1302_CR30","first-page":"107","volume":"16","author":"J Zhang","year":"2000","unstructured":"Zhang J. Protein-Length Distributions for the Three Domains of Life. Genome Anal. 2000; 16:107\u20139.","journal-title":"Genome Anal"},{"key":"1302_CR31","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1186\/1756-0500-5-85","volume":"5","author":"A Tiessen","year":"2012","unstructured":"Tiessen A, P\u00e9rez-Rodr\u00edguez P, Delaye-Arredondo LJ. Mathematical Modeling and Comparison of Protein Size Distribution in Different Plant, Animal, Fungal and Microbial Species Reveals a Negative Correlation between Protein Size and Protein Number, thus Providing Insight into the Evolution of Proteomes. BMC Res Notes. 2012; 5:85.","journal-title":"BMC Res Notes"}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-016-1302-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s12859-016-1302-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-016-1302-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T18:08:00Z","timestamp":1706810880000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/s12859-016-1302-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,4]]},"references-count":31,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2016,12]]}},"alternative-id":["1302"],"URL":"https:\/\/doi.org\/10.1186\/s12859-016-1302-4","relation":{},"ISSN":["1471-2105"],"issn-type":[{"value":"1471-2105","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,11,4]]},"assertion":[{"value":"9 February 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 October 2016","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 November 2016","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"443"}}