{"created":"2023-05-15T09:58:37.711102+00:00","id":2615,"links":{},"metadata":{"_buckets":{"deposit":"e82cf409-e677-4965-a90e-619250b38c53"},"_deposit":{"created_by":5,"id":"2615","owner":"5","owners":[5],"pid":{"revision_id":0,"type":"depid","value":"2615"},"status":"published"},"_oai":{"id":"oai:miyazaki-u.repo.nii.ac.jp:00002615","sets":["73","73:36","73:36:330","73:36:330:322"]},"author_link":["11805","13482","11807","12201","13486"],"item_10002_alternative_title_1":{"attribute_name":"その他（別言語等）のタイトル","attribute_value_mlt":[{"subitem_alternative_title":"GPGPU オ モチイタ ヘイレツ DP マッチング ニヨル タイイキ アラインメント ノ コウソクカ","subitem_alternative_title_language":"ja-Kana"}]},"item_10002_biblio_info_7":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2012-07-30","bibliographicIssueDateType":"Issued"},"bibliographicPageEnd":"326","bibliographicPageStart":"323","bibliographicVolumeNumber":"41","bibliographic_titles":[{"bibliographic_title":"宮崎大学工学部紀要","bibliographic_titleLang":"ja"},{"bibliographic_title":"Memoirs of Faculty of Engineering, University of Miyazaki","bibliographic_titleLang":"en"}]}]},"item_10002_description_5":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"Recent advance of genomic analysis technologies gives us a lot of DNA sequence data. Many researchers apply these data for post-genomic investigation. To find the optimum global alignment is investigated as one of the most important tasks of post-genomic investigation because it is the first step of there researches. Dynamic Programming (DP) matching is a major way to find the optimum alignment between sequences. However, DP matching requires O(N^2) memory space to align the sequences consisting of N bases. To reduce memory space, divide and conquer algorithm is used with DP matching, but it leads longer computation time. In this paper, we propose a high-speed method to obtain the optimum global alignment by parallel DP maching assisted with GPGPU(General Purpose computing on Graphics Processing Unit). In this method, we utilize many stream processors like an arithmetic pipeline. Experimental results showed that our method achieved about five times faster than that by CPU.","subitem_description_language":"en","subitem_description_type":"Abstract"}]},"item_10002_publisher_8":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"宮崎大学工学部","subitem_publisher_language":"ja"},{"subitem_publisher":"Faculty of Engineering, University of Miyazaki","subitem_publisher_language":"en"}]},"item_10002_source_id_11":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA00732558","subitem_source_identifier_type":"NCID"}]},"item_10002_source_id_9":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"05404924","subitem_source_identifier_type":"ISSN"}]},"item_10002_version_type_20":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"山森, 一人","creatorNameLang":"ja"},{"creatorName":"ヤマモリ, クニヒト","creatorNameLang":"ja-Kana"},{"creatorName":"Yamamori, Kunihito","creatorNameLang":"en"}],"nameIdentifiers":[{},{}]},{"creatorNames":[{"creatorName":"河野, 忠明"},{"creatorName":"カワノ, タダアキ","creatorNameLang":"ja-Kana"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"吉原, 郁夫","creatorNameLang":"ja"},{"creatorName":"ヨシハラ, イクオ","creatorNameLang":"ja-Kana"},{"creatorName":"Yoshihara, Ikuo","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"相川, 勝","creatorNameLang":"ja"},{"creatorName":"アイカワ, マサル","creatorNameLang":"ja-Kana"},{"creatorName":"Aikawa, Masaru","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Kawano, Tadaaki","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2020-06-21"}],"displaytype":"detail","filename":"engineering41_323-326.pdf","filesize":[{"value":"801.6 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"engineering41_323-326.pdf","url":"https://miyazaki-u.repo.nii.ac.jp/record/2615/files/engineering41_323-326.pdf"},"version_id":"9b2eb82a-5123-439e-a146-813b7569a9d4"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"Dynamic Programming, global alignment, DNA sequence, Graphical Processing Unit, GPU, Compute Unified Device Architecture, CUDA","subitem_subject_language":"en","subitem_subject_scheme":"Other"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"departmental bulletin paper","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"GPGPUを用いた並列DPマッチングによる大域アラインメントの高速化","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"GPGPUを用いた並列DPマッチングによる大域アラインメントの高速化","subitem_title_language":"ja"},{"subitem_title":"High-speed Global Alignment by Parallel DP Matching assisted with GPGPU","subitem_title_language":"en"}]},"item_type_id":"10002","owner":"5","path":["73","36","330","322"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2012-11-02"},"publish_date":"2012-11-02","publish_status":"0","recid":"2615","relation_version_is_last":true,"title":["GPGPUを用いた並列DPマッチングによる大域アラインメントの高速化"],"weko_creator_id":"5","weko_shared_id":2},"updated":"2023-07-29T23:39:48.133923+00:00"}