{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T23:30:40Z","timestamp":1729639840630,"version":"3.28.0"},"reference-count":23,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1109\/pccc.2014.7017064","type":"proceedings-article","created":{"date-parts":[[2015,1,24]],"date-time":"2015-01-24T02:24:09Z","timestamp":1422066249000},"page":"1-8","source":"Crossref","is-referenced-by-count":1,"title":["GPU acceleration of finding LPRs in DNA sequence based on SUA index"],"prefix":"10.1109","author":[{"given":"Shufang","family":"Du","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Longjiang","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunyu","family":"Ai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meirui","family":"Ren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hao","family":"Qu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinbao","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","article-title":"Parallel algorithm for long sequences maximal tandem repeats on the cluster computing","volume":"8","year":"2010","journal-title":"Microelectronic and Computer"},{"journal-title":"Optimizing Parallel Reduction in CUDA","year":"2013","author":"harris","key":"22"},{"key":"17","first-page":"472","article-title":"A fast algorithm combining fp-tree and tid-list for frequent pattern mining","year":"2011","journal-title":"Proceedings of IEEE Conference on Information and Knowledge Engineering"},{"journal-title":"ICPADS","article-title":"Data transfer matters for gpu computing","year":"2013","key":"23"},{"key":"18","article-title":"Parallel algorithm for mining frequent item sets based on fp-growth","author":"zhigang","year":"2014","journal-title":"Computer Engineering and Applications"},{"key":"15","first-page":"135","article-title":"A new lightweight index sua for biological sequence analysis","volume":"33","author":"di","year":"2005","journal-title":"Journal of Huazhong University of Science"},{"key":"16","first-page":"243","article-title":"Balanced parallel fp-growth with mapreduce","year":"2011","journal-title":"Proceedings of 2011 IEEE Youth Conference on Information Computing and Telecommunications"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/29.22.4633"},{"key":"14","article-title":"Finding lprs in dna sequences based on a new index sua","author":"di","year":"2005","journal-title":"Proc 6th IEEE Symposium on Bioinformatics and BioEngineering"},{"key":"11","first-page":"162","article-title":"Finding maximal repetions in a word in linear time","year":"2000","journal-title":"Computer Society"},{"key":"12","article-title":"Optimal exact string matching based on suffix arrays","author":"abouelhoda","year":"2002","journal-title":"ISSPIR"},{"journal-title":"Thrust Quick Start Guid","year":"2014","author":"technology","key":"21"},{"key":"3","first-page":"136","article-title":"Improved approximation algorithms for the capacitated multicast routing problem","author":"cai","year":"2005","journal-title":"Proceedings of 11th Annual International Conference on Computing and Combinatorics 2005(COCOON) (Kunming China)"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/DCABES.2012.57"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2013.2297121"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1360\/jos182766"},{"key":"10","first-page":"140","article-title":"Simple and flexible detection of contiguous repeats using a suffix tree","author":"stoye","year":"1998","journal-title":"CPM98"},{"key":"7","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1017\/S1464793104006657","article-title":"Why repetitive dna is essential to genome function","volume":"80","author":"ja","year":"2005","journal-title":"Biological Reviews"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1038\/35057062"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.05.013"},{"key":"4","article-title":"O(?)-approximation to physical world by sensor networks","author":"cheng","year":"2013","journal-title":"INFOCOM"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1089\/106652701300099038"},{"key":"8","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1093\/nar\/27.2.573","article-title":"An algorithm for finding tandem repeats of unspecified pattern size","volume":"27","author":"benson","year":"1998","journal-title":"Nucleic Acid Research"}],"event":{"name":"2014 IEEE International Performance Computing and Communications Conference (IPCCC)","start":{"date-parts":[[2014,12,5]]},"location":"Austin, TX, USA","end":{"date-parts":[[2014,12,7]]}},"container-title":["2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7001444\/7017012\/07017064.pdf?arnumber=7017064","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,23]],"date-time":"2017-06-23T04:16:22Z","timestamp":1498191382000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7017064\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/pccc.2014.7017064","relation":{},"subject":[],"published":{"date-parts":[[2014,12]]}}}