{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:33:37Z","timestamp":1743075217183,"version":"3.28.0"},"reference-count":11,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1109\/sasp.2011.5941082","type":"proceedings-article","created":{"date-parts":[[2011,7,8]],"date-time":"2011-07-08T17:47:26Z","timestamp":1310147246000},"page":"74-77","source":"Crossref","is-referenced-by-count":11,"title":["A fast CUDA implementation of agrep algorithm for approximate nucleotide sequence matching"],"prefix":"10.1109","author":[{"given":"Hongjian","family":"Li","sequence":"first","affiliation":[]},{"given":"Bing","family":"Ni","sequence":"additional","affiliation":[]},{"given":"Man-Hon","family":"Wong","sequence":"additional","affiliation":[]},{"given":"Kwong-Sak","family":"Leung","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74450-4_25"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69068-9_14"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1186\/gb-2009-10-3-r25"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559931"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btp324"},{"key":"ref5","first-page":"2592","article-title":"N-SAMSAM: A simple and faster algorithm for solving approximate matching in DNA sequences","author":"ni","year":"0","journal-title":"IEEE Congress on Evolutionary Computation"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"414i","DOI":"10.1093\/bioinformatics\/btq364","article-title":"A fast algorithm for exact sequence search in biological sequences using polyphase decomposition","volume":"26","author":"abhilash","year":"2010","journal-title":"Bioinformatics"},{"key":"ref7","first-page":"si0","article-title":"Improved algorithms for approximate string matching","volume":"10","author":"papamichail","year":"2009","journal-title":"(extended abstract) BMC Bioinformat-ics"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/135239.135244"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CSE.2010.29"},{"key":"ref1","first-page":"153","article-title":"Agrep - A Fast Approximate Pattern-Matching Tool","author":"wu","year":"0","journal-title":"Proceedings of USENIX Technical Conference"}],"event":{"name":"2011 IEEE 9th Symposium on Application Specific Processors (SASP)","start":{"date-parts":[[2011,6,5]]},"location":"San Diego, CA, USA","end":{"date-parts":[[2011,6,6]]}},"container-title":["2011 IEEE 9th Symposium on Application Specific Processors (SASP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5934629\/5941068\/05941082.pdf?arnumber=5941082","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T23:00:12Z","timestamp":1497913212000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5941082\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/sasp.2011.5941082","relation":{},"subject":[],"published":{"date-parts":[[2011,6]]}}}