{"links":{},"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00238565","sets":["1164:5352:11553:11747"]},"path":["11747"],"owner":"44499","recid":"238565","title":["AUTOEB: A software for systematically evaluating bipartitions in a phylogenetic tree employing an approximately unbiased test"],"pubdate":{"attribute_name":"公開日","attribute_value":"2024-08-30"},"_buckets":{"deposit":"288848f5-d3a4-49a8-bfb7-be383142189c"},"_deposit":{"id":"238565","pid":{"type":"depid","value":"238565","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"AUTOEB: A software for systematically evaluating bipartitions in a phylogenetic tree employing an approximately unbiased test","author_link":["653356","653358","653359","653354","653357","653355"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"AUTOEB: A software for systematically evaluating bipartitions in a phylogenetic tree employing an approximately unbiased test"},{"subitem_title":"AUTOEB: A software for systematically evaluating bipartitions in a phylogenetic tree employing an approximately unbiased test","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2024-08-30","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Science and Technology, University of Tsukuba"},{"subitem_text_value":"Faculty of Medicine, Dalhousie University"},{"subitem_text_value":"Graduate School of Science and Technology, University of Tsukuba／Center for Computational Sciences, University of Tsukuba"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Science and Technology, University of Tsukuba","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Medicine, Dalhousie University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Science and Technology, University of Tsukuba / Center for Computational Sciences, University of Tsukuba","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"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/238565/files/IPSJ-BIO24079001.pdf","label":"IPSJ-BIO24079001.pdf"},"date":[{"dateType":"Available","dateValue":"2026-08-30"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-BIO24079001.pdf","filesize":[{"value":"1.2 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":"41"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"e65db620-6757-48d3-aa05-76a0a4744f14","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2024 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Kohei, Bamba"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Ryo, Harada"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Yuji, Inagaki"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Kohei, Bamba","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Ryo, Harada","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Yuji, Inagaki","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA12055912","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_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8590","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"Both inference of a tree diagram and evaluating the credibility of the inferred tree are indispensable in molecular phylogeny. To evaluate the credibility of bipartitions in a phylogenetic tree in the maximum-likelihood framework, bootstrap, UFBoot2, and SH-aLRT are available. In this study, we propose a new software ”AUTOEB,” which evaluates bipartitions in a given tree employing an approximately unbiased (AU) test. For each bipartition, the software generates two alternative trees from a given tree by disrupting the bipartition of interest with the minimum changes in tree topology and compares them by the AU test. In the case of either or both alternative trees failing to be rejected, the software calls the particular bipartition ”unresolved” and otherwise “unresolved.” We here compare the credibility of bipartitions calculated from multiple empirical sequence data by bootstrap, UFBoot2, SH-aLRT, and AUTOEB, and demonstrate that the new method can complement the preexisting ones.","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Both inference of a tree diagram and evaluating the credibility of the inferred tree are indispensable in molecular phylogeny. To evaluate the credibility of bipartitions in a phylogenetic tree in the maximum-likelihood framework, bootstrap, UFBoot2, and SH-aLRT are available. In this study, we propose a new software ”AUTOEB,” which evaluates bipartitions in a given tree employing an approximately unbiased (AU) test. For each bipartition, the software generates two alternative trees from a given tree by disrupting the bipartition of interest with the minimum changes in tree topology and compares them by the AU test. In the case of either or both alternative trees failing to be rejected, the software calls the particular bipartition ”unresolved” and otherwise “unresolved.” We here compare the credibility of bipartitions calculated from multiple empirical sequence data by bootstrap, UFBoot2, SH-aLRT, and AUTOEB, and demonstrate that the new method can complement the preexisting ones.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"7","bibliographic_titles":[{"bibliographic_title":"研究報告バイオ情報学（BIO）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2024-08-30","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"2024-BIO-79"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"created":"2025-01-19T01:41:52.272168+00:00","updated":"2025-01-19T08:31:39.721404+00:00","id":238565}