{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:51:58Z","timestamp":1750308718985,"version":"3.41.0"},"publisher-location":"New York, New York, USA","reference-count":7,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1145\/2676585.2676616","type":"proceedings-article","created":{"date-parts":[[2015,1,16]],"date-time":"2015-01-16T19:18:59Z","timestamp":1421435939000},"page":"256-262","source":"Crossref","is-referenced-by-count":0,"title":["Exploring the problem of GPU programming for data-intensive applications"],"prefix":"10.1145","author":[{"given":"Yuki","family":"Kitsukawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manato","family":"Hirabayashi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shinpei","family":"Kato","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masato","family":"Edahiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"key-10.1145\/2676585.2676616-1","doi-asserted-by":"crossref","unstructured":"Pi nar Muyan-Özçelik, John D. Owens, Junyi Xia, and Sanjiv S. Samant. Fast deformable registration on the gpu: A cuda implementation of demons. InICCSA Workshops, pages 223--233. IEEE Computer Society, 2008.","DOI":"10.1109\/ICCSA.2008.22"},{"key":"key-10.1145\/2676585.2676616-2","unstructured":"Wenbin Fang, Bingsheng He, Qiong Luo, and Naga K. Govindaraju. Mars: Accelerating mapreduce with graphics processors.IEEE Transactions on Parallel and Distributed Systems, 22(4): 608--620, 2011."},{"key":"key-10.1145\/2676585.2676616-3","unstructured":"Timothy L. Bailey, Nadya Williams, Chris Misleh, and Wilfred W. Li. Meme: discovering and analyzing dna and protein sequence motifs.Nucleic Acids Research, 34(Web-Server-Issue): 369--373, 2006."},{"key":"key-10.1145\/2676585.2676616-4","unstructured":"Timothy L. Bailey, Mikael Bodén, Fabian A. Buske, Martin C. Frith, Charles E. Grant, Luca Clementi, Jingyuan Ren, Wilfred W. Li, and William Stafford Noble. Meme suite: tools for motif discovery and searching.Nucleic Acids Research, 37(Web-Server-Issue): 202--208, 2009."},{"key":"key-10.1145\/2676585.2676616-5","unstructured":"Yongchao Liu, Bertil Schmidt, Weiguo Liu, and Douglas L Maskell. Cuda--meme: Accelerating motif discovery in biological sequences using cuda-enabled graphics processing units.Pattern Recognition Letters, 31(14): 2170--2177, 2010."},{"key":"key-10.1145\/2676585.2676616-6","unstructured":"William N. Grundy, Timothy L. Bailey, and Charles P. Elkan. Parameme: A parallel implementation and a web interface for a dna and protein motif discovery tool.Computer Applications in the Biosciences, 12: 303--310, 1996."},{"key":"key-10.1145\/2676585.2676616-7","doi-asserted-by":"crossref","unstructured":"Chen Chen, Bertil Schmidt, Weiguo Liu, and Wolfgang MÃijller-Wittig. Gpu-meme: Using graphics hardware to accelerate motif finding in dna sequences. InPRIB'08, pages 448--459, 2008.","DOI":"10.1007\/978-3-540-88436-1_38"}],"event":{"name":"the Fifth Symposium","start":{"date-parts":[[2014,12,4]]},"number":"5","location":"Hanoi, Viet Nam","end":{"date-parts":[[2014,12,5]]},"acronym":"SoICT '14"},"container-title":["Proceedings of the Fifth Symposium on Information and Communication Technology - SoICT '14"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2676585.2676616","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=2676616&ftid=1529184&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:14:30Z","timestamp":1750277670000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=2676585.2676616"}},"subtitle":["a case study of multiple expectation maximization for motif elicitation"],"proceedings-subject":"Information and Communication Technology","short-title":[],"issued":{"date-parts":[[2014]]},"references-count":7,"URL":"https:\/\/doi.org\/10.1145\/2676585.2676616","relation":{},"subject":[],"published":{"date-parts":[[2014]]}}}