{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T21:17:42Z","timestamp":1720473462346},"reference-count":27,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2017,3,1]],"date-time":"2017-03-01T00:00:00Z","timestamp":1488326400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001824","name":"Czech Science Foundation","doi-asserted-by":"crossref","award":["P103-14-14292P"],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100007543","name":"Charles University Grant Agency","doi-asserted-by":"crossref","award":["122214"],"id":[{"id":"10.13039\/100007543","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Systems"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1016\/j.is.2016.06.001","type":"journal-article","created":{"date-parts":[[2016,6,19]],"date-time":"2016-06-19T12:45:38Z","timestamp":1466340338000},"page":"175-193","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"special_numbering":"C","title":["Improving matrix-based dynamic programming on massively parallel accelerators"],"prefix":"10.1016","volume":"64","author":[{"given":"David","family":"Bedn\u00e1rek","sequence":"first","affiliation":[]},{"given":"Michal","family":"Brabec","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Kruli\u0161","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.is.2016.06.001_bib1","unstructured":"D. Bedn\u00e1rek, M. Brabec, M. Kruli\u0161, On parallel evaluation of matrix-based dynamic programming algorithms."},{"key":"10.1016\/j.is.2016.06.001_bib2","doi-asserted-by":"crossref","unstructured":"M. Kruli\u0161, D. Bedn\u00e1rek, M. Brabec, Improving parallel processing of matrix-based similarity measures on modern gpus, in: Similarity Search and Applications, Springer, 2015, pp. 283\u2013294.","DOI":"10.1007\/978-3-319-25087-8_27"},{"issue":"1","key":"10.1016\/j.is.2016.06.001_bib3","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/321796.321811","article-title":"The string-to-string correction problem","volume":"21","author":"Wagner","year":"1974","journal-title":"J. ACM (JACM)"},{"key":"10.1016\/j.is.2016.06.001_bib4","unstructured":"V.I. Levenshtein, Binary codes capable of correcting deletions, insertions and reversals, Sov. Phys. Dokl. 10 (1966) 707."},{"key":"10.1016\/j.is.2016.06.001_bib5","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/978-3-540-74048-3_4","article-title":"Dynamic time warping","author":"M\u00fcller","year":"2007","journal-title":"Inf. Retr. Music Motion"},{"issue":"1","key":"10.1016\/j.is.2016.06.001_bib6","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0022-2836(81)90087-5","article-title":"Identification of common molecular subsequences","volume":"147","author":"Smith","year":"1981","journal-title":"J. Mol. Biol."},{"issue":"3","key":"10.1016\/j.is.2016.06.001_bib7","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1145\/316542.316550","article-title":"A fast bit-vector algorithm for approximate string matching based on dynamic programming","volume":"46","author":"Myers","year":"1999","journal-title":"J. ACM (JACM)"},{"key":"10.1016\/j.is.2016.06.001_bib8","doi-asserted-by":"crossref","unstructured":"A. Tomiyama, R. Suda, Automatic parameter optimization for edit distance algorithm on gpu, in: High Performance Computing for Computational Science-VECPAR 2012, Springer, 2013, pp. 420\u2013434.","DOI":"10.1007\/978-3-642-38718-0_38"},{"key":"10.1016\/j.is.2016.06.001_bib9","unstructured":"T.R. Mathies, A fast parallel algorithm to determine edit distance."},{"key":"10.1016\/j.is.2016.06.001_bib10","doi-asserted-by":"crossref","unstructured":"G. Delgado, C. Aporntewan, Data dependency reduction in dynamic programming matrix, in: 2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE), IEEE, 2011, pp. 234\u2013236.","DOI":"10.1109\/JCSSE.2011.5930126"},{"key":"10.1016\/j.is.2016.06.001_bib11","doi-asserted-by":"crossref","unstructured":"A. Chac\u00f3n, S. Marco-Sola, A. Espinosa, P. Ribeca, J.C. Moure, Thread-cooperative, bit-parallel computation of Levenshtein distance on GPU, in: Proceedings of the 28th ACM International Conference on Supercomputing, ACM, 2014, pp. 103\u2013112.","DOI":"10.1145\/2597652.2597677"},{"issue":"1","key":"10.1016\/j.is.2016.06.001_bib12","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/0196-6774(85)90023-9","article-title":"Finding approximate patterns in strings","volume":"6","author":"Ukkonen","year":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/j.is.2016.06.001_bib13","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1016\/j.procs.2013.05.067","article-title":"Bit-parallel multiple approximate string matching based on gpu","volume":"17","author":"Xu","year":"2013","journal-title":"Proc. Comput. Sci."},{"key":"10.1016\/j.is.2016.06.001_bib14","doi-asserted-by":"crossref","unstructured":"D. Sart, A. Mueen, W. Najjar, E. Keogh, V. Niennattrakul, Accelerating dynamic time warping subsequence search with gpus and fpgas, in: 2010 IEEE 10th International Conference on Data Mining (ICDM), IEEE, 2010, pp. 1001\u20131006.","DOI":"10.1109\/ICDM.2010.21"},{"issue":"8","key":"10.1016\/j.is.2016.06.001_bib15","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1109\/TC.1983.1676311","article-title":"Dynamic time warp pattern matching using an integrated multiprocessing array","volume":"32","author":"Weste","year":"1983","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/j.is.2016.06.001_bib16","doi-asserted-by":"crossref","unstructured":"M. Zymbler, Best-match time series subsequence search on the intel many integrated core architecture, in: Advances in Databases and Information Systems, Springer, 2015, pp. 275\u2013286.","DOI":"10.1007\/978-3-319-23135-8_19"},{"issue":"2","key":"10.1016\/j.is.2016.06.001_bib17","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1093\/bioinformatics\/btl582","article-title":"Striped Smith\u2013Waterman speeds database searches six times over other SIMD implementations","volume":"23","author":"Farrar","year":"2007","journal-title":"Bioinformatics"},{"key":"10.1016\/j.is.2016.06.001_bib18","doi-asserted-by":"crossref","unstructured":"Y. Liu, W. Huang, J. Johnson, S. Vaidya, Gpu accelerated Smith\u2013Waterman, in: Computational Science\u2014ICCS 2006, Springer, 2006, pp. 188\u2013195.","DOI":"10.1007\/11758549_29"},{"key":"10.1016\/j.is.2016.06.001_bib19","doi-asserted-by":"crossref","unstructured":"J.D. Owens, D. Luebke, N. Govindaraju, M. Harris, J. Kr\u00fcger, A.E. Lefohn, T.J. Purcell, A survey of general-purpose computation on graphics hardware, in: Computer Graphics Forum, vol. 26, Wiley Online Library, 2007, pp. 80\u2013113.","DOI":"10.1111\/j.1467-8659.2007.01012.x"},{"issue":"Suppl 2","key":"10.1016\/j.is.2016.06.001_bib20","doi-asserted-by":"crossref","first-page":"S10","DOI":"10.1186\/1471-2105-9-S2-S10","article-title":"Cuda compatible gpu cards as efficient hardware accelerators for Smith\u2013Waterman sequence alignment","volume":"9","author":"Manavski","year":"2008","journal-title":"BMC Bioinform."},{"key":"10.1016\/j.is.2016.06.001_bib21","doi-asserted-by":"crossref","unstructured":"L. Ligowski, W. Rudnicki, An efficient implementation of smith waterman algorithm on gpu using cuda, for massively parallel scanning of sequence databases, in: IEEE International Symposium on Parallel & Distributed Processing, 2009, IPDPS 2009, IEEE, 2009, pp. 1\u20138.","DOI":"10.1109\/IPDPS.2009.5160931"},{"issue":"11","key":"10.1016\/j.is.2016.06.001_bib22","doi-asserted-by":"crossref","first-page":"4247","DOI":"10.1016\/j.jcp.2010.02.009","article-title":"Acceleration of the Smith\u2013Waterman algorithm using single and multiple graphics processors","volume":"229","author":"Khajeh-Saeed","year":"2010","journal-title":"J. Comput. Phys."},{"issue":"1","key":"10.1016\/j.is.2016.06.001_bib23","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1186\/1471-2105-14-117","article-title":"Cudasw++ 3.0","volume":"14","author":"Liu","year":"2013","journal-title":"BMC Bioinform."},{"key":"10.1016\/j.is.2016.06.001_bib24","unstructured":"Intel, Xeon Phi Coprocessor, \u3008http:\/\/www.intel.com\/content\/www\/us\/en\/high-performance-computing\/high-performance-xeon-phi-coprocessor-brief.html\u3009."},{"key":"10.1016\/j.is.2016.06.001_bib25","unstructured":"NVIDIA, Kepler GPU Architecture. URL \u3008http:\/\/www.nvidia.com\/object\/nvidia-kepler.html\u3009."},{"key":"10.1016\/j.is.2016.06.001_bib26","unstructured":"NVIDIA, Maxwell GPU architecture. URL \u3008http:\/\/developer.nvidia.com\/maxwell-compute-architecture\u3009."},{"key":"10.1016\/j.is.2016.06.001_bib27","series-title":"Intel Threading Building Blocks: Outfitting C++ for Multi-core Processor Parallelism","author":"Reinders","year":"2007"}],"container-title":["Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0306437915301897?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0306437915301897?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,11,2]],"date-time":"2019-11-02T13:59:16Z","timestamp":1572703156000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0306437915301897"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3]]},"references-count":27,"alternative-id":["S0306437915301897"],"URL":"https:\/\/doi.org\/10.1016\/j.is.2016.06.001","relation":{},"ISSN":["0306-4379"],"issn-type":[{"value":"0306-4379","type":"print"}],"subject":[],"published":{"date-parts":[[2017,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Improving matrix-based dynamic programming on massively parallel accelerators","name":"articletitle","label":"Article Title"},{"value":"Information Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.is.2016.06.001","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2016 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}]}}