{"created":"2025-01-18T23:30:20.057277+00:00","updated":"2025-01-21T23:02:24.646345+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00071508","sets":["1164:2735:6033:6232"]},"path":["6232"],"owner":"10","recid":"71508","title":["FM-indexを用いた高速な配列相同性検索ツールの開発"],"pubdate":{"attribute_name":"公開日","attribute_value":"2010-12-09"},"_buckets":{"deposit":"c2e548f9-c919-425e-bd54-ec62a8081558"},"_deposit":{"id":"71508","pid":{"type":"depid","value":"71508","revision_id":0},"owners":[10],"status":"published","created_by":10},"item_title":"FM-indexを用いた高速な配列相同性検索ツールの開発","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"FM-indexを用いた高速な配列相同性検索ツールの開発"},{"subitem_title":"Development of a fast homology search tool based on FM-index","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2010-12-09","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東京工業大学大学院情報理工学研究科計算工学専攻"},{"subitem_text_value":"東京工業大学大学院情報理工学研究科計算工学専攻"},{"subitem_text_value":"東京工業大学大学院情報理工学研究科計算工学専攻"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Information Science and Engineering, Tokyo Institute of Technology","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science and Engineering, Tokyo Institute of Technology","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science and Engineering, Tokyo Institute of Technology","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/71508/files/IPSJ-MPS10081020.pdf"},"date":[{"dateType":"Available","dateValue":"2012-12-09"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-MPS10081020.pdf","filesize":[{"value":"247.8 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"17"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"9484f243-07e1-4c94-a43a-a32c9c2e16aa","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2010 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"鈴木, 脩司"},{"creatorName":"石田, 貴士"},{"creatorName":"秋山, 泰"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Shuji, Suzuki","creatorNameLang":"en"},{"creatorName":"Takashi, Ishida","creatorNameLang":"en"},{"creatorName":"Yutaka, Akiyama","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10505667","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"近年，DNA 配列等の配列決定技術の向上により高速に配列データを得ることが可能となった．これにより DNA 配列及びタンパク質配列のデータベースのデータ量が爆発的に増加している．このため大量の配列データに対して巨大な DB への相同性検索を行う機会が多くなってきてる．しかし，大規模なデータを用いた相同性検索では，BLAST など従来のツールでは解析が間に合わないという問題がある．本研究では Suffix Array を用いてクエリのインデックスを，FM-index を用いて DB のインデックスを構築し，これらのインデックスを用いてミスマッチをある程度許して短い領域で高いスコアとなる部分を見つけ，その部分の周辺をアラインメントするアルゴリズムを提案した．その結果，従来用いられてきた BLAST 以上の精度を保ったまま，約 10 倍の高速化を達成した．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In recent years, a lot of biological sequence data can be determined easily and the size of DNA/protein sequence databases is increasing explosively because of the improvement of sequencing technologies. However, such a huge sequence data causes a problem that even general homology search analyses by using BLAST become difficult in terms of the computation cost. Therefore, we designed a new homology search algorithm that finds alignment candidates based on the suffix array of queries and the FM-index of a database. As results, the proposed method achieved about 10-fold speed up than BLAST.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"6","bibliographic_titles":[{"bibliographic_title":"研究報告数理モデル化と問題解決（MPS）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2010-12-09","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"20","bibliographicVolumeNumber":"2010-MPS-81"}]},"relation_version_is_last":true,"weko_creator_id":"10"},"id":71508,"links":{}}