{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T23:33:41Z","timestamp":1773272021834,"version":"3.50.1"},"reference-count":80,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2016,3,18]],"date-time":"2016-03-18T00:00:00Z","timestamp":1458259200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Capes\/Brazil","award":["PVE-02\/2012"],"award-info":[{"award-number":["PVE-02\/2012"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Comput. Surv."],"published-print":{"date-parts":[[2016,5,2]]},"abstract":"<jats:p>Many bioinformatics applications, such as the optimal pairwise biological sequence comparison, demand a great quantity of computing resource, thus are excellent candidates to run in high-performance computing (HPC) platforms. In the last two decades, a large number of HPC-based solutions were proposed for this problem that run in different platforms, targeting different types of comparisons with slightly different algorithms and making the comparative analysis of these approaches very difficult. This article proposes a classification of parallel optimal pairwise sequence comparison solutions, in order to highlight their main characteristics in a unified way. We then discuss several HPC-based solutions, including clusters of multicores and accelerators such as Cell Broadband Engines (CellBEs), Field-Programmable Gate Arrays (FPGAs), Graphics Processing Units (GPUs) and Intel Xeon Phi, as well as hybrid solutions, which combine two or more platforms, providing the actual landscape of the main proposals in this area. Finally, we present open questions and perspectives in this research field.<\/jats:p>","DOI":"10.1145\/2893488","type":"journal-article","created":{"date-parts":[[2016,3,18]],"date-time":"2016-03-18T13:50:44Z","timestamp":1458309044000},"page":"1-36","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Parallel Optimal Pairwise Biological Sequence Comparison"],"prefix":"10.1145","volume":"48","author":[{"given":"Edans Flavius De Oliveira","family":"Sandes","sequence":"first","affiliation":[{"name":"University of Brasilia, Brasilia-DF, Brazil"}]},{"given":"Azzedine","family":"Boukerche","sequence":"additional","affiliation":[{"name":"University of Ottawa, Ontario, Canada"}]},{"given":"Alba Cristina Magalhaes Alves De","family":"Melo","sequence":"additional","affiliation":[{"name":"University of Brasilia, Brazil"}]}],"member":"320","published-online":{"date-parts":[[2016,3,18]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"IEEE International Conference on BioInformatics and BioEngineering.","author":"Aji A.","unstructured":"A. Aji and W. Feng . 2008. Optimizing performance, cost and sensitivity in pairwise sequence search on a cluster of playstation . In IEEE International Conference on BioInformatics and BioEngineering. A. Aji and W. Feng. 2008. Optimizing performance, cost and sensitivity in pairwise sequence search on a cluster of playstation. In IEEE International Conference on BioInformatics and BioEngineering."},{"key":"e_1_2_1_2_1","volume-title":"Proceedings of the 5th Conference on Computing Frontiers (CF\u201908)","author":"Aji A. M.","unstructured":"A. M. Aji , W. Feng , F. Blagojevic , and D. S. Nikolopoulos . 2008. Cell-SWAT: Modeling and scheduling wavefront computations on the cell broadband engine . In Proceedings of the 5th Conference on Computing Frontiers (CF\u201908) . 13--22. A. M. Aji, W. Feng, F. Blagojevic, and D. S. Nikolopoulos. 2008. Cell-SWAT: Modeling and scheduling wavefront computations on the cell broadband engine. In Proceedings of the 5th Conference on Computing Frontiers (CF\u201908). 13--22."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-2836(05)80360-2"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/MDAT.2013.2293757"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2007.08.007"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2008.2005314"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1941487.1941507"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054112400205"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2010.42"},{"key":"e_1_2_1_10_1","first-page":"245","article-title":"FPGA acceleration for DNA sequence alignment","volume":"16","author":"Caffarena G.","year":"2007","unstructured":"G. Caffarena , C. Pedrera , C. Carreras , S. Bojanic , and O. Nieto-Taladriz . 2007 . FPGA acceleration for DNA sequence alignment . Journal of Systems and Software 16 , 2, 245 -- 266 . G. Caffarena, C. Pedrera, C. Carreras, S. Bojanic, and O. Nieto-Taladriz. 2007. FPGA acceleration for DNA sequence alignment. Journal of Systems and Software 16, 2, 245--266.","journal-title":"Journal of Systems and Software"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1088377.1708261"},{"key":"e_1_2_1_12_1","unstructured":"V. Chvatal and D. Sankoff. 1975. Longest common subsequences of two random sequences. Technicial Report. STAN-CS-75-477 Stanford University Stanford CA. V. Chvatal and D. Sankoff. 1975. Longest common subsequences of two random sequences. Technicial Report. STAN-CS-75-477 Stanford University Stanford CA."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/508352.508353"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1165166.1165171"},{"key":"e_1_2_1_15_1","volume-title":"Biological Sequence Analysis","author":"Durbin R.","unstructured":"R. Durbin , S. Eddy , A. Krogh , and G. Mitchison 1998. Biological Sequence Analysis . Cambridge University Press , New York, NY . R. Durbin, S. Eddy, A. Krogh, and G. Mitchison 1998. Biological Sequence Analysis. Cambridge University Press, New York, NY."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/14.9.755"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2012.03.018"},{"key":"e_1_2_1_18_1","unstructured":"ExPASy. 2014a. UniProtKBSwissProt protein knowledgebase guideline. http:\/\/web.expasy.org\/docs\/swiss-prot_guideline.html. ExPASy. 2014a. UniProtKBSwissProt protein knowledgebase guideline. http:\/\/web.expasy.org\/docs\/swiss-prot_guideline.html."},{"key":"e_1_2_1_19_1","unstructured":"ExPASy. 2014b. UniProtKBSwissProt protein knowledgebase release 2015_04 statistics. ftp:\/\/ftp.uniprot.org\/pub\/databases\/uniprot\/previous_major_releases\/release-2015_04\/knowledgebase\/UniProtKB_SwissProt-relstat.html. ExPASy. 2014b. UniProtKBSwissProt protein knowledgebase release 2015_04 statistics. ftp:\/\/ftp.uniprot.org\/pub\/databases\/uniprot\/previous_major_releases\/release-2015_04\/knowledgebase\/UniProtKB_SwissProt-relstat.html."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl582"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/12.1Part1.175"},{"key":"e_1_2_1_22_1","unstructured":"A. R. Galper and E. C. Brutlag. 1990. Parallel similarity search and alignment with the dynamic programming method. Technical Report. KSL-90-74 Stanford University Stanford CA. A. R. Galper and E. C. Brutlag. 1990. Parallel similarity search and alignment with the dynamic programming method. Technical Report. KSL-90-74 Stanford University Stanford CA."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2836(82)90398-9"},{"key":"e_1_2_1_24_1","volume-title":"Retrieved","author":"Green P.","year":"1993","unstructured":"P. Green . 1993 . SWAT Optimization. (1993) . Retrieved February 26, 2016 from http:\/\/www.phrap.org\/phredphrap\/swat.html. P. Green. 1993. SWAT Optimization. (1993). Retrieved February 26, 2016 from http:\/\/www.phrap.org\/phredphrap\/swat.html."},{"key":"e_1_2_1_25_1","doi-asserted-by":"crossref","unstructured":"X. Guan and D. L. Uberbacher. 1994. A multiple divide-and-conquer (MDC) algorithm for optimal alignments in linear space. Technical Report. ORNL\/TM-12764 Oak Ridge National Laboratory Oak Ridge TN. X. Guan and D. L. Uberbacher. 1994. A multiple divide-and-conquer (MDC) algorithm for optimal alignments in linear space. Technical Report. ORNL\/TM-12764 Oak Ridge National Laboratory Oak Ridge TN.","DOI":"10.2172\/10168027"},{"key":"e_1_2_1_26_1","volume-title":"Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology","author":"Gusfield D.","unstructured":"D. Gusfield . 1997. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology . Cambridge University Press , New York, NY . D. Gusfield. 1997. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, New York, NY."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/360825.360861"},{"key":"e_1_2_1_28_1","volume-title":"International Workshop on Field-Programmable Logic and Applications, Field-Programmable Gate Arrays: Architectures and Tools for Rapid Prototyping. 183--191","author":"Hoang D. T.","unstructured":"D. T. Hoang and D. P. Lopresti . 1992. FPL implementation of systolic sequence alignment . In International Workshop on Field-Programmable Logic and Applications, Field-Programmable Gate Arrays: Architectures and Tools for Rapid Prototyping. 183--191 . D. T. Hoang and D. P. Lopresti. 1992. FPL implementation of systolic sequence alignment. In International Workshop on Field-Programmable Logic and Applications, Field-Programmable Gate Arrays: Architectures and Tools for Rapid Prototyping. 183--191."},{"key":"e_1_2_1_29_1","volume-title":"The NCBI Handbook","author":"Hoeppner M.","unstructured":"M. Hoeppner , M. Latterner , and K. Siyan 2013. The NCBI Handbook . National Center for Biotechnology Information , Bethesda, MD . M. Hoeppner, M. Latterner, and K. Siyan 2013. The NCBI Handbook. National Center for Biotechnology Information, Bethesda, MD."},{"key":"e_1_2_1_30_1","unstructured":"IBM. 2007. Cell broadband engine architecture. (2007). http:\/\/www.ibm.com\/developerworks\/library\/pa-cellperf\/. IBM. 2007. Cell broadband engine architecture. (2007). http:\/\/www.ibm.com\/developerworks\/library\/pa-cellperf\/."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626409000390"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2011.239"},{"key":"e_1_2_1_33_1","doi-asserted-by":"crossref","unstructured":"J. Jeffers and J. Reinders. 2013. Intel Xeon Phi Coprocessor High-Performance Programming. Morgan Kaufmann Burlington MA. J. Jeffers and J. Reinders. 2013. Intel Xeon Phi Coprocessor High-Performance Programming. Morgan Kaufmann Burlington MA.","DOI":"10.1016\/B978-0-12-410414-3.00010-4"},{"key":"e_1_2_1_34_1","unstructured":"D. Kirk and W. Hwu. 2010. Programming Massively Parallel Processors: A Hands-on Approach. Morgan Kaufmann Burlington MA. D. Kirk and W. Hwu. 2010. Programming Massively Parallel Processors: A Hands-on Approach. Morgan Kaufmann Burlington MA."},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btt410"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.1982.1653825"},{"key":"e_1_2_1_37_1","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions, and reversals","volume":"10","author":"Levenshtein V. I.","year":"1966","unstructured":"V. I. Levenshtein . 1966 . Binary codes capable of correcting deletions, insertions, and reversals . Soviet Physics Doklady 10 , 8, 707 -- 710 . V. I. Levenshtein. 1966. Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics Doklady 10, 8, 707--710.","journal-title":"Soviet Physics Doklady"},{"key":"e_1_2_1_38_1","volume-title":"Chapel Hill Conference on VLSI","volume":"3994","author":"Lipton R. J.","unstructured":"R. J. Lipton and D. Lopresti . 1985. A systolic array for rapid string comparison . In Chapel Hill Conference on VLSI , Vol. 3994 . 363--376. R. J. Lipton and D. Lopresti. 1985. A systolic array for rapid string comparison. In Chapel Hill Conference on VLSI, Vol. 3994. 363--376."},{"key":"e_1_2_1_39_1","volume-title":"ICCS 2006 (LNCS)","volume":"3994","author":"Liu Y.","unstructured":"Y. Liu , W. Huang , J. Johnson , and S. Vaidya . 2006. GPU accelerated Smith-Waterman . In ICCS 2006 (LNCS) , Vol. 3994 . Springer, 188--195. Y. Liu, W. Huang, J. Johnson, and S. Vaidya. 2006. GPU accelerated Smith-Waterman. In ICCS 2006 (LNCS), Vol. 3994. Springer, 188--195."},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1186\/1756-0500-2-73"},{"key":"e_1_2_1_41_1","volume-title":"GSWABE: Faster GPU-accelerated sequence alignment with optimal alignment retrieval for short DNA sequences. Concurrency and Computation: Practice and Experience\u2014early view","author":"Liu Y.","year":"2014","unstructured":"Y. Liu and B. Schmidt . 2014 a. GSWABE: Faster GPU-accelerated sequence alignment with optimal alignment retrieval for short DNA sequences. Concurrency and Computation: Practice and Experience\u2014early view (2014). Y. Liu and B. Schmidt. 2014a. GSWABE: Faster GPU-accelerated sequence alignment with optimal alignment retrieval for short DNA sequences. Concurrency and Computation: Practice and Experience\u2014early view (2014)."},{"key":"e_1_2_1_42_1","volume-title":"SWAPHI: Smith-Waterman protein database search on Xeon Phi coprocessors","author":"Liu Y.","year":"2014","unstructured":"Y. Liu and B. Schmidt . 2014 b. SWAPHI: Smith-Waterman protein database search on Xeon Phi coprocessors . In IEEE ASAP. 184--185. Y. Liu and B. Schmidt. 2014b. SWAPHI: Smith-Waterman protein database search on Xeon Phi coprocessors. In IEEE ASAP. 184--185."},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1186\/1756-0500-3-93"},{"key":"e_1_2_1_44_1","doi-asserted-by":"crossref","unstructured":"Y. Liu T. Tam F. Lauenroth and B. Schmidt. 2014. SWAPHI-LS: Smith-Waterman algorithm on Xeon Phi coprocessors for long DNA sequences. In IEEE CLUSTER. 257--265. Y. Liu T. Tam F. Lauenroth and B. Schmidt. 2014. SWAPHI-LS: Smith-Waterman algorithm on Xeon Phi coprocessors for long DNA sequences. In IEEE CLUSTER. 257--265.","DOI":"10.1109\/CLUSTER.2014.6968772"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-14-117"},{"key":"e_1_2_1_46_1","doi-asserted-by":"crossref","unstructured":"S. Maleki M. Musuvathi and T. Mytcowicz. 2014. Parallelizing dynamic programming through rank convergence. In ACM SIGPLAN PPoPP. ACM New York NY 219--232. S. Maleki M. Musuvathi and T. Mytcowicz. 2014. Parallelizing dynamic programming through rank convergence. In ACM SIGPLAN PPoPP. ACM New York NY 219--232.","DOI":"10.1145\/2692916.2555264"},{"key":"e_1_2_1_47_1","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1186\/1471-2105-9-S2-S10","article-title":"CUDA compatible GPU cards as efficient hardware accelerators for Smith-Waterman sequence alignment","volume":"9","author":"Manavski S.","year":"2008","unstructured":"S. Manavski and G. Valle . 2008 . CUDA compatible GPU cards as efficient hardware accelerators for Smith-Waterman sequence alignment . BMC Bioinformatics 9, Suppl 2 . S. Manavski and G. Valle. 2008. CUDA compatible GPU cards as efficient hardware accelerators for Smith-Waterman sequence alignment. BMC Bioinformatics 9, Suppl 2.","journal-title":"BMC Bioinformatics"},{"key":"e_1_2_1_48_1","first-page":"6194","article-title":"A chromosome-based draft sequence of the hexaploid bread wheat (triticum aestivum) genome","volume":"345","author":"Mayer K. X.","year":"2014","unstructured":"K. X. Mayer 2014 . A chromosome-based draft sequence of the hexaploid bread wheat (triticum aestivum) genome . Science 345 , 6194 . K. X. Mayer et al. 2014. A chromosome-based draft sequence of the hexaploid bread wheat (triticum aestivum) genome. Science 345, 6194.","journal-title":"Science"},{"key":"e_1_2_1_49_1","volume-title":"Biological sequence comparison on hybrid platforms with dynamic workload adjustment","author":"Mendonca F.","unstructured":"F. Mendonca and A. C. M. A. Melo . 2013. Biological sequence comparison on hybrid platforms with dynamic workload adjustment . In IEEE IPDPSW - HiCOMB. 501--509. F. Mendonca and A. C. M. A. Melo. 2013. Biological sequence comparison on hybrid platforms with dynamic workload adjustment. In IEEE IPDPSW - HiCOMB. 501--509."},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2009.165"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/14.3.290"},{"key":"e_1_2_1_52_1","volume-title":"Bioinformatics: Sequence and Genome Analysis","author":"Mount D. W.","unstructured":"D. W. Mount . 2004. Bioinformatics: Sequence and Genome Analysis . Cold Spring Harbor Laboratory Press , Cold Spring Harbor, NY. D. W. Mount. 2004. Bioinformatics: Sequence and Genome Analysis. Cold Spring Harbor Laboratory Press, Cold Spring Harbor, NY."},{"key":"e_1_2_1_53_1","unstructured":"A. Munshi B. Gaster T. G. Mattson J. Fung and D. Ginsburg. 2011. OpenCL Programming Guide. Addison-Wesley Professional New York NY. A. Munshi B. Gaster T. G. Mattson J. Fung and D. Ginsburg. 2011. OpenCL Programming Guide. Addison-Wesley Professional New York NY."},{"key":"e_1_2_1_54_1","first-page":"11","article-title":"Optimal alignments in linear space","volume":"4","author":"Myers E. W.","year":"1988","unstructured":"E. W. Myers and W. Miller . 1988 . Optimal alignments in linear space . Computer Applications in the Biosciences 4 , 1, 11 -- 17 . E. W. Myers and W. Miller. 1988. Optimal alignments in linear space. Computer Applications in the Biosciences 4, 1, 11--17.","journal-title":"Computer Applications in the Biosciences"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2836(70)90057-4"},{"key":"e_1_2_1_56_1","volume-title":"Retrieved","year":"2014","unstructured":"nuccore. 2014 . NCBI Nucleotide Database. (2014) . Retrieved February 26, 2016 from http:\/\/www.ncbi.nlm. nih.gov\/nuccore\/. nuccore. 2014. NCBI Nucleotide Database. (2014). Retrieved February 26, 2016 from http:\/\/www.ncbi.nlm. nih.gov\/nuccore\/."},{"key":"e_1_2_1_57_1","unstructured":"NVIDIA. 2015. CUDA C Progamming Guide. https:\/\/docs.nvidia.com\/cuda\/pdf\/CUDA_C_Programming_Guide.pdf. NVIDIA. 2015. CUDA C Progamming Guide. https:\/\/docs.nvidia.com\/cuda\/pdf\/CUDA_C_Programming_Guide.pdf."},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2005.853340"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2004.86"},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-12-221"},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/16.8.699"},{"key":"e_1_2_1_62_1","doi-asserted-by":"crossref","unstructured":"E. Rucci A. Giusti M. Naioufi G. Botella and C. Garcia. 2014. Smith-Waterman algorithm on heterogeneous systems: A case study. In IEEE CLUSTER. 323--330. E. Rucci A. Giusti M. Naioufi G. Botella and C. Garcia. 2014. Smith-Waterman algorithm on heterogeneous systems: A case study. In IEEE CLUSTER. 323--330.","DOI":"10.1109\/CLUSTER.2014.6968784"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.1753"},{"key":"e_1_2_1_64_1","volume-title":"Smith-Waterman alignment of huge sequences with GPU in linear space","author":"Sandes E. F.","unstructured":"E. F. de O. Sandes and A. C. M. A. Melo . 2011. Smith-Waterman alignment of huge sequences with GPU in linear space . In IEEE IPDPS. 1199--1211. E. F. de O. Sandes and A. C. M. A. Melo. 2011. Smith-Waterman alignment of huge sequences with GPU in linear space. In IEEE IPDPS. 1199--1211."},{"key":"e_1_2_1_65_1","doi-asserted-by":"crossref","unstructured":"E. F. de O. Sandes G. Miranda A. C. M. A. Melo X. Martorell and E. Ayguade. 2014. CUDAlign 3.0: Parallel biological sequence comparison in large GPU clusters. In IEEE\/ACM CCGrid. 160--169. E. F. de O. Sandes G. Miranda A. C. M. A. Melo X. Martorell and E. Ayguade. 2014. CUDAlign 3.0: Parallel biological sequence comparison in large GPU clusters. In IEEE\/ACM CCGrid. 160--169.","DOI":"10.1109\/CCGrid.2014.18"},{"key":"e_1_2_1_66_1","volume-title":"ACM SIGPLAN PPoPP","author":"Sandes E. F. O.","unstructured":"E. F. O. Sandes and A. C. M. A. Melo . 2010. CUDAlign: Using GPU to accelerate the comparison of megabase genomic sequences . In ACM SIGPLAN PPoPP . ACM , New York, NY , 137--146. E. F. O. Sandes and A. C. M. A. Melo. 2010. CUDAlign: Using GPU to accelerate the comparison of megabase genomic sequences. In ACM SIGPLAN PPoPP. ACM, New York, NY, 137--146."},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2012.194"},{"key":"e_1_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2008.254"},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2009.133"},{"key":"e_1_2_1_70_1","volume-title":"IEEE International Symposium on Circuits and Systems (ISCAS\u201910)","author":"Sarkar S.","unstructured":"S. Sarkar , T. Majumder , A. Kalyanaraman , and P. P. Pande . 2010b. Hardware accelerators for biocomputing: A survey . In IEEE International Symposium on Circuits and Systems (ISCAS\u201910) . IEEE, 3789--3792. S. Sarkar, T. Majumder, A. Kalyanaraman, and P. P. Pande. 2010b. Hardware accelerators for biocomputing: A survey. In IEEE International Symposium on Circuits and Systems (ISCAS\u201910). IEEE, 3789--3792."},{"key":"e_1_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSPEC.2013.6545119"},{"key":"e_1_2_1_72_1","volume-title":"5th International Conference on Bioinformatics and Biomedical Engineering (ICBBE\u201911)","author":"Singh J.","unstructured":"J. Singh and I. Aruni . 2011. Accelerating Smith-Waterman on heterogeneous CPU-GPU systems . In 5th International Conference on Bioinformatics and Biomedical Engineering (ICBBE\u201911) . J. Singh and I. Aruni. 2011. Accelerating Smith-Waterman on heterogeneous CPU-GPU systems. In 5th International Conference on Bioinformatics and Biomedical Engineering (ICBBE\u201911)."},{"key":"e_1_2_1_73_1","unstructured":"S. F. Smith and J. F. Frenzel. 2003. Bioinformatics application of a scalable supercomputer-on-chip architecture. In PDPTA. 385--391. S. F. Smith and J. F. Frenzel. 2003. Bioinformatics application of a scalable supercomputer-on-chip architecture. In PDPTA. 385--391."},{"key":"e_1_2_1_74_1","doi-asserted-by":"crossref","unstructured":"T. F. Smith and M. S. Waterman. 1981. Journal of Molecular Biology 147 1 195--197. T. F. Smith and M. S. Waterman. 1981. Journal of Molecular Biology 147 1 195--197.","DOI":"10.1016\/0022-2836(81)90087-5"},{"key":"e_1_2_1_75_1","doi-asserted-by":"crossref","unstructured":"A. Szalkowski C. Ledergerber P. Krahenbuhl and C. Dessimoz. 2008. Swps3\u2014fast multi-threaded vectorized Smith-Waterman for IBM CellBE. and x86 SSE2. BMC Research Notes 107--110. A. Szalkowski C. Ledergerber P. Krahenbuhl and C. Dessimoz. 2008. Swps3\u2014fast multi-threaded vectorized Smith-Waterman for IBM CellBE. and x86 SSE2. BMC Research Notes 107--110.","DOI":"10.1186\/1756-0500-1-107"},{"key":"e_1_2_1_76_1","volume-title":"XSW: Accelerating biological database search on Xeon Phi","author":"Wang L.","year":"2014","unstructured":"L. Wang , Y. Chan , X. Duan , H. Lan , X. Meng , and W. Liu . 2014 . XSW: Accelerating biological database search on Xeon Phi . In IEEE IPDPSW\u2014AsHES. 950--957. L. Wang, Y. Chan, X. Duan, H. Lan, X. Meng, and W. Liu. 2014. XSW: Accelerating biological database search on Xeon Phi. In IEEE IPDPSW\u2014AsHES. 950--957."},{"key":"e_1_2_1_77_1","volume-title":"High-Performance Computing Using FPGAs","author":"Wienbrandt L.","unstructured":"L. Wienbrandt . 2013. Bioinformatics applications on the FPGA-based high-performance computer RIVYERA . In High-Performance Computing Using FPGAs . Springer , 81--103. L. Wienbrandt. 2013. Bioinformatics applications on the FPGA-based high-performance computer RIVYERA. In High-Performance Computing Using FPGAs. Springer, 81--103."},{"key":"e_1_2_1_78_1","volume-title":"FPGA-Based System Design","author":"Wolf W.","unstructured":"W. Wolf . 2004. FPGA-Based System Design . Prentice-Hall , Upper Saddle River, NJ. W. Wolf. 2004. FPGA-Based System Design. Prentice-Hall, Upper Saddle River, NJ."},{"key":"e_1_2_1_79_1","first-page":"145","article-title":"Using video-oriented instructions to speed up sequence comparison","volume":"13","author":"Wozniak A.","year":"1997","unstructured":"A. Wozniak . 1997 . Using video-oriented instructions to speed up sequence comparison . Computer Applications in the Biosciences 13 , 2, 145 -- 150 . A. Wozniak. 1997. Using video-oriented instructions to speed up sequence comparison. Computer Applications in the Biosciences 13, 2, 145--150.","journal-title":"Computer Applications in the Biosciences"},{"key":"e_1_2_1_80_1","doi-asserted-by":"crossref","unstructured":"P. Zhang G. Tan and G. R. Gao. 2007. Implementation of the Smith-Waterman algorithm on a reconfigurable supercomputing platform. In ACM HPRCTA. ACM New York NY 39--48. P. Zhang G. Tan and G. R. Gao. 2007. Implementation of the Smith-Waterman algorithm on a reconfigurable supercomputing platform. In ACM HPRCTA. ACM New York NY 39--48.","DOI":"10.1145\/1328554.1328565"}],"container-title":["ACM Computing Surveys"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2893488","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2893488","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:56:13Z","timestamp":1750222573000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2893488"}},"subtitle":["Algorithms, Platforms, and Classification"],"short-title":[],"issued":{"date-parts":[[2016,3,18]]},"references-count":80,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,5,2]]}},"alternative-id":["10.1145\/2893488"],"URL":"https:\/\/doi.org\/10.1145\/2893488","relation":{},"ISSN":["0360-0300","1557-7341"],"issn-type":[{"value":"0360-0300","type":"print"},{"value":"1557-7341","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3,18]]},"assertion":[{"value":"2015-04-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-01-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-03-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}