{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:15:18Z","timestamp":1743102918869,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030105631"},{"type":"electronic","value":"9783030105648"}],"license":[{"start":{"date-parts":[[2018,12,21]],"date-time":"2018-12-21T00:00:00Z","timestamp":1545350400000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-10564-8_24","type":"book-chapter","created":{"date-parts":[[2018,12,20]],"date-time":"2018-12-20T12:40:07Z","timestamp":1545309607000},"page":"305-316","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Greedy Consensus Tree and Maximum Greedy Consensus Tree Problems"],"prefix":"10.1007","author":[{"given":"Wing-Kin","family":"Sung","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,12,21]]},"reference":[{"issue":"4","key":"24_CR1","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1093\/sysbio\/21.4.390","volume":"21","author":"EN Adams III","year":"1972","unstructured":"Adams III, E.N.: Consensus techniques and the comparison of taxonomic trees. Syst. Biol. 21(4), 390\u2013397 (1972)","journal-title":"Syst. Biol."},{"issue":"4","key":"24_CR2","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1111\/j.1096-0031.1990.tb00551.x","volume":"6","author":"K Bremer","year":"1990","unstructured":"Bremer, K.: Combinable component consensus. Cladistics 6(4), 369\u2013372 (1990)","journal-title":"Cladistics"},{"key":"24_CR3","unstructured":"Bryantm, 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)"},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/BF01908061","volume":"2","author":"WHE Day","year":"1985","unstructured":"Day, W.H.E.: Optimal algorithms for comparing trees with labeled leaves. J. Classif. 2, 7\u201328 (1985)","journal-title":"J. Classif."},{"key":"24_CR5","volume-title":"Inferring Phylogenies","author":"J Felsenstein","year":"2004","unstructured":"Felsenstein, J.: Inferring Phylogenies. Sinauer Associates, Inc., Sunderland (2004)"},{"key":"24_CR6","unstructured":"Felsenstein, J.: PHYLIP, version 3.6. Software package, Department of Genome Sciences, University of Washington, Seattle, USA (2005)"},{"key":"24_CR7","unstructured":"Gawrychowski, P., Landau, G.M., Sung, W.-K., Weimann, O.: A faster construction of greedy consensus trees. In: 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, Prague, Czech Republic, pp. 63:1\u201363:14, 9\u201313 July 2018"},{"key":"24_CR8","unstructured":"Jansson, J., Rajaby, R., Shen, C., Sung, W.-K.: Algorithms for the majority rule (+) consensus tree and the frequency difference consensus tree. IEEE\/ACM Trans. Comput. Biol. Bioinform. September 2016"},{"key":"24_CR9","unstructured":"Jansson, J., Shen, C., Sung, W.-K.: Fast algorithms for consensus trees (FACT) (2013). http:\/\/compbio.ddns.comp.nus.edu.sg\/~consensus.tree"},{"issue":"3","key":"24_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2925985","volume":"63","author":"J Jansson","year":"2016","unstructured":"Jansson, J., Shen, C., Sung, W.-K.: Improved algorithms for constructing consensus trees. J. ACM 63(3), 1\u201324 (2016)","journal-title":"J. ACM"},{"key":"24_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/978-3-319-13075-0_33","volume-title":"Algorithms and Computation","author":"J Jansson","year":"2014","unstructured":"Jansson, J., Sung, W.-K., Vu, H., Yiu, S.-M.: Faster algorithms for computing the\u00a0R*\u00a0consensus\u00a0tree. In: Ahn, H.-K., Shin, C.-S. (eds.) ISAAC 2014. LNCS, vol. 8889, pp. 414\u2013425. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13075-0_33"},{"issue":"2","key":"24_CR12","first-page":"239","volume":"43","author":"T Margush","year":"1981","unstructured":"Margush, T., McMorris, F.R.: Consensus $$n$$-trees. Bull. Math. Biol. 43(2), 239\u2013244 (1981)","journal-title":"Bull. Math. Biol."},{"issue":"1\u20133","key":"24_CR13","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 \u2014 a new model for building consensus trees. Discrete Appl. Math. 71(1\u20133), 311\u2013335 (1996)","journal-title":"Discrete Appl. Math."},{"key":"24_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/3-540-61258-0_18","volume-title":"Combinatorial Pattern Matching","author":"C Phillips","year":"1996","unstructured":"Phillips, C., Warnow, T.J.: The asymmetric median tree \u2014 a new model for building consensus trees. In: Hirschberg, D., Myers, G. (eds.) CPM 1996. LNCS, vol. 1075, pp. 234\u2013252. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61258-0_18"},{"key":"24_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/978-3-319-78825-8_29","volume-title":"Combinatorial Algorithms","author":"R Rajaby","year":"2018","unstructured":"Rajaby, R., Sung, W.-K.: Computing asymmetric median tree of two trees via better bipartite matching algorithm. In: Brankovic, L., Ryan, J., Smyth, W.F. (eds.) IWOCA 2017. LNCS, vol. 10765, pp. 356\u2013367. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78825-8_29"},{"issue":"12","key":"24_CR16","doi-asserted-by":"publisher","first-page":"1572","DOI":"10.1093\/bioinformatics\/btg180","volume":"19","author":"F Ronquist","year":"2003","unstructured":"Ronquist, F., Huelsenbeck, J.P.: MrBayes 3: Bayesian phylogenetic inference under mixed models. Bioinformatics 19(12), 1572\u20131574 (2003)","journal-title":"Bioinformatics"},{"issue":"3","key":"24_CR17","doi-asserted-by":"publisher","first-page":"309","DOI":"10.2307\/2413252","volume":"30","author":"RR 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":"Syst. Zool."},{"key":"24_CR18","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)"},{"key":"24_CR19","volume-title":"PAUP*, Version 4.0. Software Package","author":"DL Swofford","year":"2003","unstructured":"Swofford, D.L.: PAUP*, Version 4.0. Software Package. Sinauer Associates Inc., Sunderland (2003)"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-10564-8_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T14:51:37Z","timestamp":1709823097000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-10564-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,21]]},"ISBN":["9783030105631","9783030105648"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-10564-8_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018,12,21]]},"assertion":[{"value":"21 December 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guwahati","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 February 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 March 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iitg.ac.in\/walcom2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"100","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9.8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}