乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T19:39:31Z","timestamp":1730317171529,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,2,7]]},"DOI":"10.1145\/2578948.2560690","type":"proceedings-article","created":{"date-parts":[[2014,2,7]],"date-time":"2014-02-07T09:23:08Z","timestamp":1391764988000},"page":"92-102","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Fast Longest Common Subsequence with General Integer Scoring Support on GPUs"],"prefix":"10.1145","author":[{"given":"Adnan","family":"Ozsoy","sequence":"first","affiliation":[{"name":"Indiana University, Bloomington"}]},{"given":"Arun","family":"Chauhan","sequence":"additional","affiliation":[{"name":"Indiana University, Bloomington"}]},{"given":"Martin","family":"Swany","sequence":"additional","affiliation":[{"name":"Indiana University, Bloomington"}]}],"member":"320","published-online":{"date-parts":[[2014,2,7]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"CUDA Dynamic Parallelism Programming Guide. Retrieved October 20 2013 from http:\/\/docs.nvidia.com\/cuda\/pdf\/CUDA_C_Programming_Guide.pdf. CUDA Dynamic Parallelism Programming Guide. Retrieved October 20 2013 from http:\/\/docs.nvidia.com\/cuda\/pdf\/CUDA_C_Programming_Guide.pdf."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/8871.8877"},{"key":"e_1_3_2_1_3_1","volume-title":"Algorithms and Theory of Computation Handbook","author":"Atallah M. J.","year":"1998","unstructured":"M. J. Atallah and S. Fox , editors . Algorithms and Theory of Computation Handbook . CRC Press, Inc. , Boca Raton, FL, USA , 1 st edition, 1998 . M. J. Atallah and S. Fox, editors. Algorithms and Theory of Computation Handbook. CRC Press, Inc., Boca Raton, FL, USA, 1st edition, 1998.","edition":"1"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38905-4_7"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/829519.830817"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(01)00182-X"},{"key":"e_1_3_2_1_7_1","volume-title":"Text Algorithms","author":"Crochemore M.","year":"1994","unstructured":"M. Crochemore and W. Rytter . Text Algorithms . Oxford University Press , 1994 . M. Crochemore and W. Rytter. Text Algorithms. Oxford University Press, 1994."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02427852"},{"key":"e_1_3_2_1_9_1","first-page":"258","volume-title":"Time-Warped Longest Common Subsequence Algorithm for Music Retrieval","author":"Guo A.","year":"2004","unstructured":"A. Guo and H. Siegelmann . Time-Warped Longest Common Subsequence Algorithm for Music Retrieval . pages 258 -- 261 . Universitat Pompeu Fabra , Oct. 2004 . A. Guo and H. Siegelmann. Time-Warped Longest Common Subsequence Algorithm for Music Retrieval. pages 258--261. Universitat Pompeu Fabra, Oct. 2004."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology","author":"Gusfield D.","year":"1997","unstructured":"D. Gusfield . Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology . Cambridge University Press , 1997 . D. Gusfield. Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, 1997."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2011.182"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73499-4_44"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(78)90037-6"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/360825.360861"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/322033.322044"},{"key":"e_1_3_2_1_16_1","volume-title":"A bit-vector algorithm for computing levenshtein and damerau edit distances. Nordic Journal of Computing, page","author":"Hyyro H.","year":"2003","unstructured":"H. Hyyro . A bit-vector algorithm for computing levenshtein and damerau edit distances. Nordic Journal of Computing, page 2003 , 2003. H. Hyyro. A bit-vector algorithm for computing levenshtein and damerau edit distances. Nordic Journal of Computing, page 2003, 2003."},{"key":"e_1_3_2_1_17_1","first-page":"16","volume-title":"In Proc. 15th Australasian Workshop on Combinatorial Algorithms (AWOCA","author":"Hyyro H.","year":"2004","unstructured":"H. Hyyro . Bit-parallel lcs-length computation revisited . In In Proc. 15th Australasian Workshop on Combinatorial Algorithms (AWOCA , pages 16 -- 27 , 2004 . H. Hyyro. Bit-parallel lcs-length computation revisited. In In Proc. 15th Australasian Workshop on Combinatorial Algorithms (AWOCA, pages 16--27, 2004."},{"key":"e_1_3_2_1_18_1","volume-title":"Yun Xu. An Efficient Parallel Algorithm for Longest Common Subsequence Problem on GPUs. Proceedings of the World Congress on Engineering, 1","author":"Jiaoyun Yang Y. S.","year":"2010","unstructured":"Y. S. Jiaoyun Yang , Yun Xu. An Efficient Parallel Algorithm for Longest Common Subsequence Problem on GPUs. Proceedings of the World Congress on Engineering, 1 , 2010 . Y. S. Jiaoyun Yang, Yun Xu. An Efficient Parallel Algorithm for Longest Common Subsequence Problem on GPUs. Proceedings of the World Congress on Engineering, 1, 2010."},{"key":"e_1_3_2_1_19_1","volume-title":"An Introduction to Bioinformatics Algorithms (Computational Molecular Biology)","author":"Jones N. C.","year":"2004","unstructured":"N. C. Jones and P. A. Pevzner . An Introduction to Bioinformatics Algorithms (Computational Molecular Biology) . The MIT Press , Aug. 2004 . N. C. Jones and P. A. Pevzner. An Introduction to Bioinformatics Algorithms (Computational Molecular Biology). The MIT Press, Aug. 2004."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/2340646.2340658"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcp.2010.02.009"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/2386173.2386184"},{"issue":"8","key":"e_1_3_2_1_23_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 . Binary codes capable of correcting deletions, insertions, and reversals . Soviet Physics Doklady , 10 ( 8 ): 707 -- 710 , 1966 . V. I. Levenshtein. Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics Doklady, 10(8):707--710, 1966.","journal-title":"Soviet Physics Doklady"},{"key":"e_1_3_2_1_24_1","volume-title":"CUDASW++: Optimizing Smith-Waterman sequence database searches for CUDA-enabled graphics processing units. BMC research notes, 2(1)","author":"Liu Y.","year":"2009","unstructured":"Y. Liu , D. Maskell , and B. Schmidt . CUDASW++: Optimizing Smith-Waterman sequence database searches for CUDA-enabled graphics processing units. BMC research notes, 2(1) , 2009 . Y. Liu, D. Maskell, and B. Schmidt. CUDASW++: Optimizing Smith-Waterman sequence database searches for CUDA-enabled graphics processing units. BMC research notes, 2(1), 2009."},{"key":"e_1_3_2_1_25_1","volume-title":"CUDASW++2.0: Enhanced Smith-Waterman protein database search on CUDA-enabled GPUs based on SIMT and virtualized SIMD abstractions. BMC research notes, 3(1)","author":"Liu Y.","year":"2010","unstructured":"Y. Liu , B. Schmidt , and D. L. Maskell . CUDASW++2.0: Enhanced Smith-Waterman protein database search on CUDA-enabled GPUs based on SIMT and virtualized SIMD abstractions. BMC research notes, 3(1) , 2010 . Y. Liu, B. Schmidt, and D. L. Maskell. CUDASW++2.0: Enhanced Smith-Waterman protein database search on CUDA-enabled GPUs based on SIMT and virtualized SIMD abstractions. BMC research notes, 3(1), 2010."},{"issue":"5","key":"e_1_3_2_1_26_1","first-page":"381","article-title":"A sentence-to-sentence clustering procedure for pattern analysis. Systems, Man and Cybernetics","volume":"8","author":"Lu S.-y.","year":"1978","unstructured":"S.-y. Lu and K.-S. Fu . A sentence-to-sentence clustering procedure for pattern analysis. Systems, Man and Cybernetics , IEEE Transactions on , 8 ( 5 ): 381 -- 389 , 1978 . S.-y. Lu and K.-S. Fu. A sentence-to-sentence clustering procedure for pattern analysis. Systems, Man and Cybernetics, IEEE Transactions on, 8(5):381--389, 1978.","journal-title":"IEEE Transactions on"},{"key":"e_1_3_2_1_27_1","first-page":"9","article-title":"CUDA compatible GPU cards as efficient hardware accelerators for Smith-Waterman sequence alignment","author":"Manavski S. A.","year":"2008","unstructured":"S. A. Manavski and G. Valle . CUDA compatible GPU cards as efficient hardware accelerators for Smith-Waterman sequence alignment . BMC Bioinformatics , 9 , 2008 . S. A. Manavski and G. Valle. CUDA compatible GPU cards as efficient hardware accelerators for Smith-Waterman sequence alignment. BMC Bioinformatics, 9, 2008.","journal-title":"BMC Bioinformatics"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840446"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/316542.316550"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2836(70)90057-4"},{"key":"e_1_3_2_1_31_1","volume-title":"CUDA C Programming Guide","author":"NVIDIA.","year":"2013","unstructured":"NVIDIA. CUDA C Programming Guide , 2013 . NVIDIA. CUDA C Programming Guide, 2013."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPADS.2013.22"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/42201.42203"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2836(81)90087-5"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGC.2012.106"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/GCE.2010.5676126"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/321796.321811"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(90)90035-V"}],"event":{"name":"PPoPP '14: ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Orlando FL USA","acronym":"PPoPP '14"},"container-title":["Proceedings of Programming Models and Applications on Multicores and Manycores"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2578948.2560690","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T10:06:24Z","timestamp":1673431584000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2578948.2560690"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,7]]},"references-count":38,"alternative-id":["10.1145\/2578948.2560690","10.1145\/2578948"],"URL":"https:\/\/doi.org\/10.1145\/2578948.2560690","relation":{},"subject":[],"published":{"date-parts":[[2014,2,7]]},"assertion":[{"value":"2014-02-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}