{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:26:55Z","timestamp":1742930815885,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319788241"},{"type":"electronic","value":"9783319788258"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-78825-8_29","type":"book-chapter","created":{"date-parts":[[2018,4,16]],"date-time":"2018-04-16T18:59:07Z","timestamp":1523905147000},"page":"356-367","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Computing Asymmetric Median Tree of Two Trees via Better Bipartite Matching Algorithm"],"prefix":"10.1007","author":[{"given":"Ramesh","family":"Rajaby","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wing-Kin","family":"Sung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,17]]},"reference":[{"issue":"4","key":"29_CR1","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1093\/sysbio\/21.4.390","volume":"21","author":"E. N. Adams","year":"1972","unstructured":"Adams III, E.N.: Consensus techniques and the comparison of taxonomic trees. Syst. Biol. 21(4), 390\u2013397 (1972)","journal-title":"Systematic Biology"},{"issue":"4","key":"29_CR2","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1111\/j.1096-0031.1990.tb00551.x","volume":"6","author":"K\u00e5re Bremer","year":"1990","unstructured":"Bremer, K.: Combinable component consensus. Cladistics 6(4), 369\u2013372 (1990)","journal-title":"Cladistics"},{"key":"29_CR3","unstructured":"Bryant, D.: A classification of consensus methods for phylogenetics. In: Janowitz, M.F., Lapointe, F.-J., McMorris, F.R., Mirkin, B., Roberts, F.S. (eds.) Bioconsensus. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 61, pp. 163\u2013184. American Mathematical Society (2003)"},{"issue":"5","key":"29_CR4","doi-asserted-by":"publisher","first-page":"1385","DOI":"10.1137\/S0097539796313477","volume":"30","author":"R Cole","year":"2000","unstructured":"Cole, R., Farach-Colton, M., Hariharan, R., Przytycka, T., Thorup, M.: An o(nlog n) algorithm for the maximum agreement subtree problem for binary trees. SIAM J. Comput. 30(5), 1385\u20131404 (2000)","journal-title":"SIAM J. Comput."},{"key":"29_CR5","volume-title":"Inferring Phylogenies","author":"J Felsenstein","year":"2004","unstructured":"Felsenstein, J.: Inferring Phylogenies. Sinauer Associates Inc., Sunderland (2004)"},{"key":"29_CR6","unstructured":"Felsenstein, J.: PHYLIP, version 3.6. Software package, Department of Genome Sciences, University of Washington, Seattle, U.S.A. (2005)"},{"issue":"4","key":"29_CR7","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"JE Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An $$n^{5\/2}$$ algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2(4), 225\u2013231 (1973)","journal-title":"SIAM J. Comput."},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Jansson, J., Shen, C., Sung, W.-K.: Improved algorithms for constructing consensus trees. J. ACM 63(3), 1\u201324 (2016)","DOI":"10.1145\/2925985"},{"issue":"2","key":"29_CR9","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1137\/S0097539797332275","volume":"30","author":"M-Y Kao","year":"2000","unstructured":"Kao, M.-Y., Lam, T.W., Sung, W.-K., Ting, H.-F.: Cavity matchings, label compressions, and unrooted evolutionary trees. SIAM J. Comput. 30(2), 602\u2013624 (2000)","journal-title":"SIAM J. Comput."},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Margush, T., McMorris, F.R.: Consensus $$n$$-trees. Bull. Math. Biol. 43(2), 239\u2013244 (1981)","DOI":"10.1016\/S0092-8240(81)90019-7"},{"issue":"1\u20133","key":"29_CR11","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0166-218X(96)00071-6","volume":"71","author":"C Phillips","year":"1996","unstructured":"Phillips, C., Warnow, T.J.: The asymmetric median tree\u2014a new model for building consensus trees. Discrete Appl. Math. 71(1\u20133), 311\u2013335 (1996)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"29_CR12","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1093\/sysbio\/30.3.309","volume":"30","author":"R. R. Sokal","year":"1981","unstructured":"Sokal, R.R., Rohlf, F.J.: Taxonomic congruence in the Leptopodomorpha re-examined. Syst. Zool. 30(3), 309\u2013325 (1981)","journal-title":"Systematic Biology"},{"key":"29_CR13","volume-title":"Algorithms in Bioinformatics: A Practical Introduction","author":"W-K Sung","year":"2010","unstructured":"Sung, W.-K.: Algorithms in Bioinformatics: A Practical Introduction. Chapman & Hall\/CRC, Boca Raton (2010)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-78825-8_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:09:14Z","timestamp":1709809754000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-78825-8_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319788241","9783319788258"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-78825-8_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"17 April 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Newcastle","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 July 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 July 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/carma.newcastle.edu.au\/meetings\/iwoca\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}