{"created":"2023-07-25T10:23:52.707229+00:00","id":1177,"links":{},"metadata":{"_buckets":{"deposit":"4204c73d-4c2e-4b76-9818-d2f45e405982"},"_deposit":{"created_by":1,"id":"1177","owners":[1],"pid":{"revision_id":0,"type":"depid","value":"1177"},"status":"published"},"_oai":{"id":"oai:hiroshima-cu.repo.nii.ac.jp:00001177","sets":["1:189"]},"author_link":["3640","3635","3638","3637","3636","3639"],"item_10001_biblio_info_7":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2008-03-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"SIG_4(TOM_20)","bibliographicPageEnd":"116","bibliographicPageStart":"105","bibliographicVolumeNumber":"49","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌. 数理モデル化と応用"}]}]},"item_10001_description_19":{"attribute_name":"フォーマット","attribute_value_mlt":[{"subitem_description":"application/pdf","subitem_description_type":"Other"}]},"item_10001_description_5":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"系統樹を比較する手法の1つとして調停が提案されている.調停では,系統樹を順序木と見なし,2つの順序木を向き合わせた調停グラフを作成する.調停を潤滑に進めるためには,順序木の葉節点間に交差がないか,もしくはできるだけ交差が少ない調停グラフを作成する必要がある.本論文では,Extremal Optimization (EO)による調停グラフの交差減少を提案する.EOを適用するにあたり,EOに対して,(1)ルーレット選択により状態遷移の候補となる構成要素を選択する,(2)複数の近傍解中の最良解を次世代の解とする,という2つの改良を加えた.評価実験の結果,提案手法による調停グラフの交差数減少の方がEOと比較して優れていることを確認した.また,タブーサーチ,SAや遺伝的プログラミングを使用した手法よりも良い結果を求めることができることを確認できた. ","subitem_description_type":"Abstract"},{"subitem_description":"The reconciliation is a one of techniques for comparing phylogenetic trees. In the reconciliation, a phylogenetic tree is considered to be an ordered tree, order trees are made to be opposite, and the reconciliation graph is made. There is no intersection between leaf nodes to advance reconciliation to lubrication or it is necessary to make reconciliation graph where intersection is a little. This paper proposes the reducing crossovers in reconciliation graphs with Extremal Optimization (EO). There are two characteristics in the proposed method. The construct which serves as a candidate of a change state by roulette selecting is chosen. The best solution in two or more neighborhoods is chosen as the next solution. The experimental results show that the proposed method is excellent as compared with EO, tabu search, SA and GP.","subitem_description_type":"Abstract"}]},"item_10001_publisher_8":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"社団法人情報処理学会"}]},"item_10001_relation_12":{"attribute_name":"論文ID（NAID）","attribute_value_mlt":[{"subitem_relation_type":"isIdenticalTo","subitem_relation_type_id":{"subitem_relation_type_id_text":"110006684622","subitem_relation_type_select":"NAID"}}]},"item_10001_relation_17":{"attribute_name":"関連サイト","attribute_value_mlt":[{"subitem_relation_name":[{"subitem_relation_name_text":"CiNii Research"}],"subitem_relation_type_id":{"subitem_relation_type_id_text":"https://cir.nii.ac.jp/crid/1050001337430745600","subitem_relation_type_select":"URI"}},{"subitem_relation_name":[{"subitem_relation_name_text":"情報処理学会電子図書館"}],"subitem_relation_type_id":{"subitem_relation_type_id_text":"https://ipsj.ixsq.nii.ac.jp/ej/?action=pages_view_main&active_action=repository_view_main_item_detail&item_id=17075&item_no=1&page_id=13&block_id=8","subitem_relation_type_select":"URI"}},{"subitem_relation_name":[{"subitem_relation_name_text":"情報処理学会"}],"subitem_relation_type_id":{"subitem_relation_type_id_text":"http://www.ipsj.or.jp/","subitem_relation_type_select":"URI"}}]},"item_10001_rights_15":{"attribute_name":"権利","attribute_value_mlt":[{"subitem_rights":"本著作物の著作権は（社）情報処理学会に帰属します。本著作物は著作権者である情報処理学会の許可のもとに掲載するものです。ご利用に当たっては「著作権法」ならびに「情報処理学会倫理綱領」に従うことをお願いいたします。"},{"subitem_rights":"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."},{"subitem_rights":"本文データは学協会の許諾に基づきCiNiiから複製したものである。"}]},"item_10001_source_id_11":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11464803","subitem_source_identifier_type":"NCID"}]},"item_10001_source_id_9":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"0387-5806","subitem_source_identifier_type":"ISSN"}]},"item_10001_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":"田村, 慶一"},{"creatorName":"タムラ, ケイイチ","creatorNameLang":"ja-Kana"}],"nameIdentifiers":[{"nameIdentifier":"3635","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"森, 康真"},{"creatorName":"モリ, ヤスマ","creatorNameLang":"ja-Kana"}],"nameIdentifiers":[{"nameIdentifier":"3636","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"北上, 始"},{"creatorName":"キタカミ, ハジメ","creatorNameLang":"ja-Kana"}],"nameIdentifiers":[{"nameIdentifier":"3637","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"TAMURA, Keiichi","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"3638","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"MORI, Yasuma","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"3639","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"KITAKAMI, Hajime","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"3640","nameIdentifierScheme":"WEKO"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2023-02-28"}],"displaytype":"detail","filename":"110006684622.pdf","filesize":[{"value":"1.2 MB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"110006684622.pdf","url":"https://hiroshima-cu.repo.nii.ac.jp/record/1177/files/110006684622.pdf"},"version_id":"0f9926c7-9832-45a2-a6cc-70cc81496a55"}]},"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":"Extremal Optimizationによる調停グラフの交差数減少","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Extremal Optimizationによる調停グラフの交差数減少"},{"subitem_title":"Reducing Crossovers in Reconciliation Graphs with Extremal Optimization","subitem_title_language":"en"}]},"item_type_id":"10001","owner":"1","path":["189"],"pubdate":{"attribute_name":"公開日","attribute_value":"2023-02-28"},"publish_date":"2023-02-28","publish_status":"0","recid":"1177","relation_version_is_last":true,"title":["Extremal Optimizationによる調停グラフの交差数減少"],"weko_creator_id":"1","weko_shared_id":1},"updated":"2023-07-25T10:36:19.276074+00:00"}