{"created":"2021-03-01T06:34:56.645919+00:00","id":26981,"links":{},"metadata":{"_buckets":{"deposit":"3a52bb6e-d049-4537-929b-c97a0b1dd0d4"},"_deposit":{"id":"26981","owners":[],"pid":{"revision_id":0,"type":"depid","value":"26981"},"status":"published"},"_oai":{"id":"oai:nagoya.repo.nii.ac.jp:00026981","sets":["336:695:696"]},"author_link":["88398","88399","88409","88410","88411","88401","88403","88404","88412","88413","88414","88406"],"item_10_alternative_title_19":{"attribute_name":"その他のタイトル","attribute_value_mlt":[{"subitem_alternative_title":"Energy Minimization of Protein Tertiary Structure by Parallel Simulated Annealing Using Genetic Crossover","subitem_alternative_title_language":"en"}]},"item_10_biblio_info_6":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2003-08","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"SIG11(ACS3)","bibliographicPageEnd":"285","bibliographicPageStart":"277","bibliographicVolumeNumber":"44","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌コンピューティングシステム（ACS）","bibliographic_titleLang":"ja"}]}]},"item_10_description_4":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"これまでの研究で，遺伝的交叉を用いた並列シミュレーテッドアニーリング（PSA/GAc）が小規模なタンパク質であるMet-enkephalinの立体構造エネルギー最小化において高い解探索能力を示すことが明らかになっている．PSA/GAcは，並列に実行しているシミュレーテッドアニーリング間で，一定間隔のアニーリングごとに遺伝的アルゴリズムのオペレータである遺伝的交叉を用いて情報交換を行う最適化手法である．本稿では，PSA/GAcをMet-enkephalinよりも大規模なタンパク質であるC-peptideとPTH（1-34）の立体構造エネルギー最小化に適用し，その探索性能について検討する．また，PSA/GAcの持ついくつかのパラメータのうち，特に探索性能に影響を与えていると考えられる交叉間隔，個体数，および総ステップ数について，いくつかの値を適用した数値実験を行い，その結果を検討し，考察を行った．その結果，独立型並列SA（PSA）と比較してPSA/GAcは対象タンパク質に対して高い探索性能を示した．また，本稿において用いたパラメータでは，交叉を行う頻度が高いほど，総ステップ数は長いほど，より高い精度の立体構造が得られた．このことより，PSA/GAcは大規模なタンパク質のエネルギー最小化にも有効であることが明らかとなった．","subitem_description_language":"ja","subitem_description_type":"Abstract"},{"subitem_description":"From our recent research, it has been clari fied that Parallel Simulated Annealing using Genetic Crossover (PSA/GAc) has a high searching ability on a minimization of an energy of small protein called Met-enkephalin. PSA/GAc performs genetic crossover, one of the operations of Genetic Algorithm (GA), among the Parallel SAs (PSAs) to exchange their informations. In this paper, PSA/GAc is applied to the minimization of the energy of C-peptide and Parathyroid Hormone Fragment (1-34). Also, among the parameters of PSA/GAc, crossover interval and total number of searching steps, which are supposed to have the high influences on the searching ability, are modified to some values in order to examine and study their influences. The result shows that PSA/GAc provides lower energy of the target proteins than Parallel SA. Furthermore, among the parameters used in this article, higher frequency of crossover and longer searching steps are con firmed to derive the lower energies. From the results we conclude that PSA/GAc is also effective on the energy minimization of larger proteins.","subitem_description_language":"en","subitem_description_type":"Abstract"}]},"item_10_publisher_32":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"一般社団法人情報処理学会","subitem_publisher_language":"ja"}]},"item_10_relation_43":{"attribute_name":"関連情報","attribute_value_mlt":[{"subitem_relation_type":"isVersionOf","subitem_relation_type_id":{"subitem_relation_type_id_text":"http://id.nii.ac.jp/1001/00018552/","subitem_relation_type_select":"URI"}}]},"item_10_rights_12":{"attribute_name":"権利","attribute_value_mlt":[{"subitem_rights":"ここに掲載した著作物の利用に関する注意 本著作物の著作権は情報処理学会に帰属します。本著作物は著作権者である情報処理学会の許可のもとに掲載するものです。ご利用に当たっては「著作権法」ならびに「情報処理学会倫理綱領」に従うことをお願いいたします。Notice for the use of this material The copyright of this material is retained by the Information Processing Society of Japan (IPSJ). This material is published on this web site with the agreement of the author (s) and the IPSJ. Please be complied with Copyright Law of Japan and the Code of Ethics of the IPSJ if any users wish to reproduce, make derivative work, distribute or make available to the public any part or whole thereof. All Rights Reserved, Copyright (C) Information Processing Society of Japan. Comments are welcome. Mail to address editj＠ipsj.or.jp, please.","subitem_rights_language":"ja"}]},"item_10_select_15":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_select_item":"publisher"}]},"item_10_source_id_61":{"attribute_name":"ISSN（print）","attribute_value_mlt":[{"subitem_source_identifier":"1882-7829","subitem_source_identifier_type":"PISSN"}]},"item_1615787544753":{"attribute_name":"出版タイプ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_access_right":{"attribute_name":"アクセス権","attribute_value_mlt":[{"subitem_access_right":"open access","subitem_access_right_uri":"http://purl.org/coar/access_right/c_abf2"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"廣安, 知之","creatorNameLang":"ja"}],"nameIdentifiers":[{"nameIdentifier":"88398","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"三木, 光範","creatorNameLang":"ja"}],"nameIdentifiers":[{"nameIdentifier":"88399","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"小椋, 信弥","creatorNameLang":"ja"}],"nameIdentifiers":[{"nameIdentifier":"88409","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"青井, 桂子","creatorNameLang":"ja"}],"nameIdentifiers":[{"nameIdentifier":"88410","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"吉田, 武史","creatorNameLang":"ja"}],"nameIdentifiers":[{"nameIdentifier":"88411","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"岡本, 祐幸","creatorNameLang":"ja"}],"nameIdentifiers":[{"nameIdentifier":"88401","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"HIROYASU, Tomoyuki","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"88403","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"MIKI, Mitsunori","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"88404","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"OGURA, Shinya","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"88412","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"AOI, Keiko","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"88413","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"YOSHIDA, Takeshi","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"88414","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"OKAMOTO, Yuko","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"88406","nameIdentifierScheme":"WEKO"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2018-12-28"}],"displaytype":"detail","filename":"IPSJ-TACS4411027.pdf","filesize":[{"value":"490.2 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"IPSJ-TACS4411027","objectType":"fulltext","url":"https://nagoya.repo.nii.ac.jp/record/26981/files/IPSJ-TACS4411027.pdf"},"version_id":"e9cc60fd-47cf-44ea-a959-b549d3c02b2e"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"journal article","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"遺伝的交叉を用いた並列SAによるタンパク質立体構造のエネルギー最小化","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"遺伝的交叉を用いた並列SAによるタンパク質立体構造のエネルギー最小化","subitem_title_language":"ja"}]},"item_type_id":"10","owner":"1","path":["696"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2018-12-28"},"publish_date":"2018-12-28","publish_status":"0","recid":"26981","relation_version_is_last":true,"title":["遺伝的交叉を用いた並列SAによるタンパク質立体構造のエネルギー最小化"],"weko_creator_id":"1","weko_shared_id":-1},"updated":"2023-01-16T04:17:43.246845+00:00"}