{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T01:34:41Z","timestamp":1755221681809,"version":"3.43.0"},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Ministry of Science and Technology of the Republic of China","award":["MOST-112-2221-E-007 -047 -MY3"],"award-info":[{"award-number":["MOST-112-2221-E-007 -047 -MY3"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput. Biol. Bioinform."],"published-print":{"date-parts":[[2025,7]]},"DOI":"10.1109\/tcbbio.2025.3545871","type":"journal-article","created":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T13:49:58Z","timestamp":1740577798000},"page":"1358-1368","source":"Crossref","is-referenced-by-count":0,"title":["Faster Algorithms for Constructing Frequency Difference Consensus Trees"],"prefix":"10.1109","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8109-1914","authenticated-orcid":false,"given":"Biing-Feng","family":"Wang","sequence":"first","affiliation":[{"name":"Department of Computer Science, National Tsing Hua University Hsinchu, Hsinchu, Republic of China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2805-8960","authenticated-orcid":false,"given":"Chih-Yu","family":"Li","sequence":"additional","affiliation":[{"name":"Department of Computer Science, National Tsing Hua University Hsinchu, Hsinchu, Republic of China"}]},{"given":"Wen-Horng","family":"Sheu","sequence":"additional","affiliation":[{"name":"Department of Computer Science, National Tsing Hua University Hsinchu, Hsinchu, Republic of China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1126\/science.289.5483.1343"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1093\/sysbio\/21.4.390"},{"key":"ref3","article-title":"Optimal preprocessing for answering on-line product queries","volume-title":"Inst. Comput. Sci.","author":"Alon","year":"1987"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45022-X_8"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF02458841"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/10719839_9"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1086\/344319"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1111\/j.1096-0031.1990.tb00551.x"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/061\/11"},{"volume-title":"Introduction to Algorithms","year":"2009","author":"Cormen","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1080\/10635150701416682"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/BF01908061"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.mbs.2010.08.002"},{"volume-title":"Inferring Phylogenies","year":"2004","author":"Felsenstein","key":"ref14"},{"article-title":"PHYLIP: Phylogenetic inference (version 3.6) [Computer software]","year":"2002","author":"Felsenstein","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/28869.28874"},{"key":"ref17","first-page":"63:1","article-title":"A faster construction of greedy consensus trees","volume-title":"Proc. 45th Int. Colloq. Automata Lang. Program.","author":"Gawrychowski"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1111\/j.1096-0031.2003.tb00376.x"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1111\/j.1096-0031.2008.00217.x"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230210104"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/0213024"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/0144075"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2016.2609923"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2925985"},{"key":"ref25","first-page":"43:1","article-title":"A faster algorithm for constructing the frequency difference consensus tree","volume-title":"Proc. 41st Int. Symp. Theor. Aspects Comput. Sci.","author":"Jansson"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/BF02459446"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-69024-2_18"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/S1055-7903(02)00027-1"},{"key":"ref29","article-title":"COMPONENT: Tree comparison software for Microsoft Windows (version 2.0), [Computer software]","volume-title":"Natural Hist. Museum","author":"Page","year":"1993"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1038\/415784a"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/0025-5564(82)90112-2"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1186\/s13015-021-00202-8"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.2307\/2413252"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1093\/sysbio\/syu043"},{"volume-title":"Algorithms in Bioinformatics: A Practical Introduction","year":"2010","author":"Sung","key":"ref35"},{"volume-title":"PAUP: Phylogenetic Analysis Using Parsimony (version 4) [Computer Software]","year":"2003","author":"Swofford","key":"ref36"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/359460.359478"},{"article-title":"An efficient algorithm for computing Ml consensus trees","year":"1985","author":"Wareham","key":"ref38"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1994.1018"},{"key":"ref40","first-page":"105:1","article-title":"Near-optimal algorithm for constructing greedy consensus tree","volume-title":"Proc. 47th Int. Colloq. Automata Lang. Program.","author":"Wu"}],"container-title":["IEEE Transactions on Computational Biology and Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10723156\/11121392\/10904336.pdf?arnumber=10904336","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,9]],"date-time":"2025-08-09T04:42:43Z","timestamp":1754714563000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10904336\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7]]},"references-count":40,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tcbbio.2025.3545871","relation":{},"ISSN":["2998-4165"],"issn-type":[{"type":"electronic","value":"2998-4165"}],"subject":[],"published":{"date-parts":[[2025,7]]}}}