{"created":"2025-01-18T22:50:22.720074+00:00","updated":"2025-01-22T23:23:04.497882+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00017355","sets":["934:989:1019:1020"]},"path":["1020"],"owner":"1","recid":"17355","title":["アミノ酸配列のマルチプルアライメントにおける反復改善過程の並列化とA*アルゴリズムの適用"],"pubdate":{"attribute_name":"公開日","attribute_value":"1999-12-15"},"_buckets":{"deposit":"9557544a-3530-4769-9a0e-e73fa8ffbcac"},"_deposit":{"id":"17355","pid":{"type":"depid","value":"17355","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"アミノ酸配列のマルチプルアライメントにおける反復改善過程の並列化とA*アルゴリズムの適用","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"アミノ酸配列のマルチプルアライメントにおける反復改善過程の並列化とA*アルゴリズムの適用"},{"subitem_title":"Multiple Protein Sequence Alignment Using Parallel Iterative Algorithm and A* Algorithm","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"オリジナル論文","subitem_subject_scheme":"Other"}]},"item_type_id":"3","publish_date":"1999-12-15","item_3_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"株式会社情報数理研究所（現 理化学研究所ゲノム科学総合研究センター）"},{"subitem_text_value":"技術研究組合新情報処理開発機構"},{"subitem_text_value":"技術研究組合新情報処理開発機構"},{"subitem_text_value":"技術研究組合新情報処理開発機構"},{"subitem_text_value":"弘前大学理工学部"},{"subitem_text_value":"技術研究組合新情報処理開発機構"}]},"item_3_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Information and Mathematical Science Laboratory, Inc / Presently with RIKEN Genomic Sciences Center","subitem_text_language":"en"},{"subitem_text_value":"Real World Computing Partnership","subitem_text_language":"en"},{"subitem_text_value":"Real World Computing Partnership","subitem_text_language":"en"},{"subitem_text_value":"Real World Computing Partnership","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Science and Engineering, Hirosaki University","subitem_text_language":"en"},{"subitem_text_value":"Real World Computing Partnership","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/17355/files/IPSJ-TOM4009016.pdf"},"date":[{"dateType":"Available","dateValue":"2001-12-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-TOM4009016.pdf","filesize":[{"value":"2.4 MB"}],"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":"fe3b4b43-7d78-444a-9dd0-9ee4335b2b32","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1999 by the Information Processing Society of Japan"}]},"item_3_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"十時, 泰"},{"creatorName":"秋山, 泰"},{"creatorName":"鬼塚健太郎"},{"creatorName":"野口, 保"},{"creatorName":"斎藤, 稔"},{"creatorName":"安藤, 誠"}],"nameIdentifiers":[{}]}]},"item_3_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yasushi, Totoki","creatorNameLang":"en"},{"creatorName":"Yutaka, Akiyama","creatorNameLang":"en"},{"creatorName":"Kentaro, Onizuka","creatorNameLang":"en"},{"creatorName":"Tamotsu, Noguchi","creatorNameLang":"en"},{"creatorName":"Minoru, Saito","creatorNameLang":"en"},{"creatorName":"Makoto, Ando","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_3_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11464803","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_3_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7780","subitem_source_identifier_type":"ISSN"}]},"item_3_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"タンパク質のアミノ酸配列のマルチプルアライメントの問題は，アミノ酸残基の保存や置換,欠失や挿入に一定の指標を与え，その総和（sum-ofLpairs）が最大となるものが最も確からしいアライメントであるというモデル化が現在主流になっている．このモデルは,総和の最大化に関する組み合わせ最適化問題を解くこととなる．大規模の問題を計算機で高精度に解くには,組み合わせの数が爆発するため，ヒューリステイクスの導入が必要となり，アライメントの精度と計算時間との間にトレードオフの関係が存在している．そのため実用的には従来から近似的な解法がとられてきた代表的な近似解法は，ツリーベース法であるが,解の精度は必ずしも十分ではなかった．我々は新しい戦略として反復改善法を拡張し，最良優先探索の効率的な近似化を図った上で,最良優先探索における近傍探索を並列実装した．さらに,Ａ*アルゴリズムを適用して探索空間の効率的な刈り込みを実現した．これらの改良の結果,大規模のマルチプルアライメントの問題を高精度に，現実的な計算時間内で得ることを可能とした．","subitem_description_type":"Other"}]},"item_3_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Since the multiple sequence alignment problem requires enormous calculation time, one is faced with a trade-off between computation time and the quality of alignment. To date, although several approximation methods have been proposed, the quality of alignments produced by previous methods is limited. As a new strategy, we employed an iterative scheme with best-first search, and parallelized its search step. Furthermore we implemented the A* pruning algorithm instead of dynamic programming, to drastically reduce the search space. As a result, our new parallel system enables biologically accurate multiple sequence alignment to be performed within reasonable calculation time.","subitem_description_type":"Other"}]},"item_3_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"149","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌数理モデル化と応用（TOM）"}],"bibliographicPageStart":"138","bibliographicIssueDates":{"bibliographicIssueDate":"1999-12-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"SIG09(TOM2)","bibliographicVolumeNumber":"40"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"id":17355,"links":{}}