{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:24:06Z","timestamp":1740140646509,"version":"3.37.3"},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"National Science Council of the Republic of China","award":["MOST-106-2221-E-007-022-MY3"],"award-info":[{"award-number":["MOST-106-2221-E-007-022-MY3"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Comput. Biol. and Bioinf."],"published-print":{"date-parts":[[2021,3,1]]},"DOI":"10.1109\/tcbb.2019.2922955","type":"journal-article","created":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T19:55:40Z","timestamp":1560542140000},"page":"416-430","source":"Crossref","is-referenced-by-count":1,"title":["A Faster Algorithm for Computing the Kernel of Maximum Agreement Subtrees"],"prefix":"10.1109","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8109-1914","authenticated-orcid":false,"given":"Biing-Feng","family":"Wang","sequence":"first","affiliation":[]},{"given":"Krister M.","family":"Swenson","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/0025-5564(81)90043-2"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2011.28"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2011.157"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2005.02.005"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0062510"},{"key":"ref30","first-page":"217","article-title":"On agreement subtrees of two binary trees","volume":"88","author":"kubicka","year":"1992","journal-title":"Congressus Numerantium"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.syapm.2011.03.001"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-69024-2_18"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0027731"},{"key":"ref34","article-title":"Multiple sequence alignment: A major challenge to large-scale phylogenetics","volume":"2","author":"liu","year":"2010","journal-title":"PLoS Currents"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2001.1163"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795283504"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/BF01202269"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"390","DOI":"10.2307\/2412432","article-title":"Consensus techniques and the comparison of taxonomic trees","volume":"21","author":"adams","year":"1972","journal-title":"Systematic Zoology"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/BIBM.2011.70"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1995.1155"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1126\/science.aaf5036"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794262422"},{"journal-title":"Inferring Phylogenies","year":"2004","author":"felsenstein","key":"ref24"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/BF01734359"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1093\/gbe\/evt028"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/BF01908078"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1093\/molbev\/msx302"},{"key":"ref10","article-title":"The comparative RNA web (CRW) site: An online database of comparative sequence and structure information for ribosomal, intron, and other RNAs","volume":"3","author":"cannone","year":"2002","journal-title":"BMC Bioinf"},{"key":"ref11","first-page":"233","article-title":"Phylogenetic analysis: Models and estimation procedures","volume":"19","author":"cavallip-sforza","year":"1967","journal-title":"Amer J Hum Genetics"},{"key":"ref40","first-page":"406","article-title":"The neighbor-joining method: A new method for reconstructing phylogenetic trees","volume":"4","author":"saitou","year":"1987","journal-title":"Mol Biol Evol"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0910803106"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796313477"},{"key":"ref14","first-page":"125","article-title":"On computing the nearest neighbor interchange distance","author":"dasgupta","year":"1997","journal-title":"Proc DIMACS Workshop Discrete Problems Med Appl"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/BF01908061"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1128\/AEM.03006-05"},{"key":"ref17","first-page":"262","article-title":"Atlas of protein sequence and structure","volume":"3","author":"eck","year":"1966","journal-title":"Systematic Biol"},{"key":"ref18","first-page":"381","article-title":"The maximum agreement subtree problem for binary trees","author":"farach","year":"1995","journal-title":"Proc 2nd Eur Symp Algorithms"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(95)00110-X"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1093\/sysbio\/syr010"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794269461"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1002\/9780470253441.ch7"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1038\/nature05634"},{"key":"ref8","article-title":"Computing the quartet distance between evolutionary trees","volume":"9","author":"bryant","year":"2000","journal-title":"Proc 11th Annu ACM-SIAM Symp Discrete Algorithms"},{"key":"ref7","first-page":"174","author":"bryant","year":"1997","journal-title":"Hunting for Trees Building Trees and Comparing Trees Theory and Method in Phylogenetic Analysis"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1093\/sysbio\/43.3.343"},{"key":"ref9","first-page":"163","article-title":"A classification of consensus methods for phylogenetics","volume":"61","author":"bryant","year":"2002","journal-title":"Theoretical Comput Sci"},{"journal-title":"PAUP* Phylogenetic Analysis Using Parsimony (*and Other Methods)","year":"2002","author":"swofford","key":"ref46"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2012.11"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/0022-5193(78)90137-6"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2018.2790957"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btu033"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.2307\/1217208"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(93)90181-8"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.2307\/2992536"}],"container-title":["IEEE\/ACM Transactions on Computational Biology and Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8857\/9391749\/08736781.pdf?arnumber=8736781","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T12:30:46Z","timestamp":1643286646000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8736781\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,1]]},"references-count":50,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tcbb.2019.2922955","relation":{},"ISSN":["1545-5963","1557-9964","2374-0043"],"issn-type":[{"type":"print","value":"1545-5963"},{"type":"electronic","value":"1557-9964"},{"type":"electronic","value":"2374-0043"}],"subject":[],"published":{"date-parts":[[2021,3,1]]}}}