{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T03:30:07Z","timestamp":1725507007571},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540787723"},{"type":"electronic","value":"9783540787730"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78773-0_7","type":"book-chapter","created":{"date-parts":[[2008,4,3]],"date-time":"2008-04-03T04:38:35Z","timestamp":1207197515000},"page":"72-83","source":"Crossref","is-referenced-by-count":2,"title":["Comparing and Aggregating Partially Resolved Trees"],"prefix":"10.1007","author":[{"given":"Mukul S.","family":"Bansal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianrong","family":"Dong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Fern\u00e1ndez-Baca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"7_CR1","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/BF01894192","volume":"3","author":"E.N. Adams III","year":"1986","unstructured":"Adams III, E.N.: N-trees as nestings: Complexity, similarity, and consensus. J. Classification\u00a03(2), 299\u2013317 (1986)","journal-title":"J. Classification"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00026-001-8006-8","volume":"5","author":"B. Allen","year":"2001","unstructured":"Allen, B., Steel, M.: Subtree transfer operations and their induced metrics on evolutionary trees. Annals of Combinatorics\u00a05, 1\u201313 (2001)","journal-title":"Annals of Combinatorics"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/BF01894194","volume":"3","author":"J.P. Barth\u00e9lemy","year":"1986","unstructured":"Barth\u00e9lemy, J.P., McMorris, F.R.: The median procedure for n-trees. Journal of Classification\u00a03, 329\u2013334 (1986)","journal-title":"Journal of Classification"},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00303169","volume":"6","author":"J.J. Bartholdi","year":"1989","unstructured":"Bartholdi, J.J., Tovey, C.A., Trick, M.A.: Voting schemes for which it can be difficult to tell who won the election. Social Choice and Welfare\u00a06, 157\u2013165 (1989)","journal-title":"Social Choice and Welfare"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/3-540-48481-7_28","volume-title":"Algorithms - ESA\u201999","author":"V. Berry","year":"1999","unstructured":"Berry, V., Jiang, T., Kearney, P.E., Li, M., Wareham, H.T.: Quartet cleaning: Improved algorithms and simulations. In: Ne\u0161et\u0159il, J. (ed.) ESA 1999. LNCS, vol.\u00a01643, pp. 313\u2013324. Springer, Heidelberg (1999)"},{"key":"7_CR6","series-title":"Computational Biology Series","volume-title":"Phylogenetic supertrees: Combining Information to Reveal the Tree of Life","year":"2004","unstructured":"Bininda-Emonds, O.R.P. (ed.): Phylogenetic supertrees: Combining Information to Reveal the Tree of Life. Computational Biology Series, vol.\u00a04. Springer, Heidelberg (2004)"},{"issue":"2","key":"7_CR7","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/s00453-003-1065-y","volume":"38","author":"G.S. Brodal","year":"2003","unstructured":"Brodal, G.S., Fagerberg, R., Pedersen, C.N.S.: Computing the quartet distance in time O(n logn). Algorithmica\u00a038(2), 377\u2013395 (2003)","journal-title":"Algorithmica"},{"key":"7_CR8","unstructured":"Bryant, D.: Building trees, hunting for trees, and comparing trees: Theory and methods in phylogenetic analysis. PhD thesis, Department of Mathematics, University of Canterbury, New Zealand (1997)"},{"key":"7_CR9","series-title":"Discrete Mathematics and Theoretical Computer Science","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1090\/dimacs\/061\/11","volume-title":"Bioconsensus","author":"D. Bryant","year":"2003","unstructured":"Bryant, D.: A classification of consensus methods for phylogenetics. In: Janowitz, M., Lapointe, F.-J., McMorris, F., Mirkin, B.B., Roberts, F. (eds.) Bioconsensus. Discrete Mathematics and Theoretical Computer Science, vol.\u00a061, pp. 163\u2013185. American Mathematical Society, Providence (2003)"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Christiansen, C., Mailund, T., Pedersen, C.N., Randers, M., Stissing, M.S.: Fast calculation of the quartet distance between trees of arbitrary degrees. Algorithms for Molecular Biology\u00a01(16) (2006)","DOI":"10.1186\/1748-7188-1-16"},{"issue":"2","key":"7_CR11","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1080\/10635150500481556","volume":"55","author":"J.A. Cotton","year":"2006","unstructured":"Cotton, J.A., Slater, C.S., Wilkinson, M.: Discriminating supported and unsupported relationships in supertrees using triplets. Systematic Biology\u00a055(2), 345\u2013350 (2006)","journal-title":"Systematic Biology"},{"key":"7_CR12","series-title":"Lecture Notes in Statist","volume-title":"Metric Methods for Analyzing Partially Ranked Data","author":"D.E. Critchlow","year":"1980","unstructured":"Critchlow, D.E.: Metric Methods for Analyzing Partially Ranked Data. Lecture Notes in Statist, vol.\u00a034. Springer, Berlin (1980)"},{"issue":"3","key":"7_CR13","doi-asserted-by":"publisher","first-page":"325","DOI":"10.2307\/2413385","volume":"35","author":"W.H.E. Day","year":"1986","unstructured":"Day, W.H.E.: Analysis of quartet dissimilarity measures between undirected phylogenetic trees. Systematic Zoology\u00a035(3), 325\u2013333 (1986)","journal-title":"Systematic Zoology"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank aggregation methods for the web. In: Tenth International World Wide Web Conference, Hong Kong, May 2001, pp. 613\u2013622 (2001)","DOI":"10.1145\/371920.372165"},{"issue":"3","key":"7_CR15","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1137\/05063088X","volume":"20","author":"R. Fagin","year":"2006","unstructured":"Fagin, R., Kumar, R., Mahdian, M., Sivakumar, D., Vee, E.: Comparing partial rankings. SIAM J. Discrete Math.\u00a020(3), 628\u2013648 (2006)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"7_CR16","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BF01908078","volume":"2","author":"C.R. Finden","year":"1985","unstructured":"Finden, C.R., Gordon, A.D.: Obtaining common pruned trees. J. Classification\u00a02(1), 225\u2013276 (1985)","journal-title":"J. Classification"},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1111\/j.1096-0031.1989.tb00569.x","volume":"5","author":"W.P. Maddison","year":"1989","unstructured":"Maddison, W.P.: Reconstructing character evolution on polytomous cladograms. Cladistics\u00a05, 365\u2013377 (1989)","journal-title":"Cladistics"},{"key":"7_CR18","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1007\/978-3-642-69024-2_18","volume-title":"Numerical Taxonomy","author":"F.R. McMorris","year":"1983","unstructured":"McMorris, F.R., Meronk, D.B., Neumann, D.A.: A view of some consensus methods for trees. In: Felsenstein, J. (ed.) Numerical Taxonomy, pp. 122\u2013125. Springer, Heidelberg (1983)"},{"key":"7_CR19","unstructured":"Piel, W., Sanderson, M., Donoghue, M., Walsh, M.: Treebase (last accessed, February 2, 2007), http:\/\/www.treebase.org"},{"key":"7_CR20","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0025-5564(81)90043-2","volume":"53","author":"D.F. Robinson","year":"1981","unstructured":"Robinson, D.F., Foulds, L.R.: Comparison of phylogenetic trees. Mathematical Biosciences\u00a053, 131\u2013147 (1981)","journal-title":"Mathematical Biosciences"},{"key":"7_CR21","series-title":"Oxford Lecture Series in Mathematics","volume-title":"Phylogenetics","author":"C. Semple","year":"2003","unstructured":"Semple, C., Steel, M.: Phylogenetics. Oxford Lecture Series in Mathematics. Oxford University Press, Oxford (2003)"},{"issue":"4","key":"7_CR22","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1109\/TCBB.2006.58","volume":"3","author":"S. Snir","year":"2006","unstructured":"Snir, S., Rao, S.: Using max cut to enhance rooted trees consistency. IEEE\/ACM Trans. Comput. Biol. Bioinformatics\u00a03(4), 323\u2013333 (2006)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinformatics"},{"issue":"2","key":"7_CR23","doi-asserted-by":"publisher","first-page":"126","DOI":"10.2307\/2992536","volume":"42","author":"M. Steel","year":"1993","unstructured":"Steel, M., Penny, D.: Distributions of tree comparison metrics \u2014 some new results. Systematic Biology\u00a042(2), 126\u2013141 (1993)","journal-title":"Systematic Biology"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Stissing, M., Pedersen, C.N.S., Mailund, T., Brodal, G.S., Fagerberg, R.: Computing the quartet distance between evolutionary trees of bounded degree. In: Sankoff, D., Wang, L., Chin, F. (eds.) APBC. Advances in Bioinformatics and Computational Biology, vol.\u00a05, pp. 101\u2013110. Imperial College Press (2007)","DOI":"10.1142\/9781860947995_0013"},{"key":"7_CR25","doi-asserted-by":"crossref","unstructured":"Stockham, C., Wang, L.-S., Warnow, T.: Statistically based postprocessing of phylogenetic analysis by clustering. In: ISMB, pp. 285\u2013293 (2002)","DOI":"10.1093\/bioinformatics\/18.suppl_1.S285"},{"key":"7_CR26","volume-title":"Approximation Algorithms","author":"V.V. Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Berlin (2001)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2008: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78773-0_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:21:50Z","timestamp":1619508110000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78773-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540787723","9783540787730"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78773-0_7","relation":{},"subject":[]}}