{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T00:55:11Z","timestamp":1773276911870,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540442110","type":"print"},{"value":"9783540457848","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45784-4_41","type":"book-chapter","created":{"date-parts":[[2007,10,16]],"date-time":"2007-10-16T14:33:38Z","timestamp":1192545218000},"page":"537-551","source":"Crossref","is-referenced-by-count":63,"title":["Modified Mincut Supertrees"],"prefix":"10.1007","author":[{"given":"Roderic D.M.","family":"Page","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,10,10]]},"reference":[{"key":"41_CR1","first-page":"105","volume":"13","author":"M. J. Sanderson","year":"1998","unstructured":"Sanderson, M. J., Purvis, A., Henze, C.: Phylogenetic supertrees: assembling the trees of life Trends Ecol. Evol. 13 (1998) 105\u2013109","journal-title":"Evol."},{"key":"41_CR2","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1080\/10635159950173870","volume":"49","author":"M. Steel","year":"2000","unstructured":"Steel, M., Dress, A., B\u00f6cker, S.: Simple but fundamental limitations on supertree and consensus tree methods. Syst. Biol 49 (2000) 363\u2013368","journal-title":"Syst. Biol"},{"key":"41_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.2307\/1222480","volume":"41","author":"B.R. Baum","year":"1992","unstructured":"Baum, B.R.: Combining trees as a way of combining data sets for phylogenetic inference, and the desirability of combining gene trees. Taxon 41 (1992) 3\u201310","journal-title":"Taxon"},{"key":"41_CR4","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/1055-7903(92)90035-F","volume":"1","author":"M.A. Ragan","year":"1992","unstructured":"Ragan, M.A.: Phylogenetic inference based on matrix representation of trees. Mol. Phylogen. Evol. 1 (1992) 53\u201358","journal-title":"Mol. Phylogen. Evol."},{"key":"41_CR5","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0025-5564(82)90125-0","volume":"60","author":"R.L. Graham","year":"1982","unstructured":"Graham, R.L., Foulds, L.R.: Unlikelihood that minimal phylogenies for a realistic biological study can be constructed in reasonable computational time. Math. Biosci. 60 (1982) 133\u2013142","journal-title":"Math. Biosci."},{"key":"41_CR6","doi-asserted-by":"crossref","unstructured":"Chen, D., Eulenstein, O., Fern\u00e1ndez-Baca, D., Sanderson, M.: Supertrees by flipping. Technical Report TR02-01, Department of Computer Science, Iowa State University (2001)","DOI":"10.1007\/3-540-45655-4_42"},{"key":"41_CR7","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0166-218X(00)00202-X","volume":"105","author":"C. Semple","year":"2000","unstructured":"Semple, C., Steel, M.: A supertree method for rooted trees. Disc. Appl. Math. 105 (2000) 147\u2013158","journal-title":"Disc. Appl. Math."},{"key":"41_CR8","unstructured":"Piel, W.: Phyloinformatics and tree networks In:Wu, C.H., Wang, P., Wang, J.T.L. (eds.): Computational Biology and Genome Informatics. World Scientific Press (2001)"},{"key":"41_CR9","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/BF01894192","volume":"3","author":"E.N. Adams","year":"1986","unstructured":"Adams, E.N.: N-trees as nestings: complexity, similarity, and consensus. J. Classif. 3 (1986) 299\u2013317","journal-title":"J. Classif."},{"key":"41_CR10","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1137\/0210030","volume":"10","author":"A.V. Aho","year":"1981","unstructured":"Aho, A.V., Sagiv, Y., Szymanski, T.G., Ullman, J.D.: Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions. SIAM J. Comput. 10 (1981) 405\u2013421","journal-title":"SIAM J. Comput."},{"key":"41_CR11","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1006\/aama.1995.1020","volume":"16","author":"D. Bryant","year":"1995","unstructured":"Bryant, D., Steel, M.: Extension operations on sets of leaf-labelled trees. Adv. Appl. Math. 16 (1995) 425\u2013453","journal-title":"Adv. Appl. Math."},{"key":"41_CR12","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0166-218X(95)00074-2","volume":"69","author":"M. P. Ng","year":"1996","unstructured":"Ng, M. P., Wormald, N. C.: Reconstruction of rooted trees from subtrees. Disc. Appl. Math. 69 (1996) 19\u201331","journal-title":"Disc. Appl. Math."},{"key":"41_CR13","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1007\/BFb0120902","volume":"13","author":"J.-C. Picard","year":"1980","unstructured":"Picard, J.-C., Queyranne, M.: On the structure of all minimum cuts in a network and applications. Math. Prog. Study 13 (1980) 8\u201316","journal-title":"Math. Prog. Study"},{"key":"41_CR14","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1145\/263867.263872","volume":"44","author":"M. Stoer","year":"1997","unstructured":"Stoer, M., Wagner, F.: A simple min cut algorithm. J. ACM 44 (1997) 585\u2013591","journal-title":"J. ACM"},{"key":"41_CR15","doi-asserted-by":"crossref","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 5 (1989) 365\u2013377","journal-title":"Cladistics"},{"key":"41_CR16","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1006\/mpev.2000.0897","volume":"19","author":"J.B. Slowinski","year":"2001","unstructured":"Slowinski, J.B. Molecular polytomies. Mol. Phylogen.Evol. 19 (2001) 114\u2013120","journal-title":"Mol. Phylogen.Evol."},{"key":"41_CR17","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BF02618470","volume":"9","author":"M. Steel","year":"1992","unstructured":"Steel, M.: The complexity of reconstructing trees from qualitative characters and subtrees. J. Classif. 9 (1992) 91\u2013116","journal-title":"J. Classif."},{"key":"41_CR18","doi-asserted-by":"publisher","first-page":"86","DOI":"10.2307\/2412630","volume":"29","author":"G. Nelson","year":"1980","unstructured":"Nelson, G., Platnick, N.I. Multiple branching in cladograms: two interpretations. Syst. Zool. 29 (1980) 86\u201391","journal-title":"Syst. Zool."},{"key":"41_CR19","first-page":"292","volume-title":"Interrelationships of the Platyhelminthes","author":"M. Wilkinson","year":"2001","unstructured":"Wilkinson, M., Thorley, J.L., Littlewood, D.T.J., Bray, R.A.: Towards a phylogenetic supertree of Platyhelminthes? In: Littlewood, D.T.J., Bray, R.A. (eds.): Interrelationships of the Platyhelminthes. Taylor and Francis, London (2001) 292\u2013301"},{"key":"41_CR20","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1075\/z.35.07jos","volume-title":"Mathematics of Language","author":"A.K. Joshi","year":"1987","unstructured":"Joshi, A.K.: An introduction to tree adjoining grammars In: Manaster-Ramer, A. (ed.): Mathematics of Language. John Benjamins Publishing Co., Amsterdam (1987) 87\u2013115"},{"key":"41_CR21","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1146\/annurev.es.23.110192.002313","volume":"23","author":"K. Queiroz de","year":"1992","unstructured":"de Queiroz, K., Gauthier, J.: Phylogenetic taxonomy. Ann. Rev. Ecol. Syst. 23 (1992) 449\u2013480","journal-title":"Ann. Rev. Ecol. Syst."},{"key":"41_CR22","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1006\/mpev.1999.0676","volume":"14","author":"R.D.M. Page","year":"2000","unstructured":"Page, R.D.M.: Extracting species trees from complex gene trees: reconciled trees and vertebrate phylogeny. Mol. Phylogen. Evol. 14 (2000) 89\u2013106","journal-title":"Mol. Phylogen. Evol."},{"key":"41_CR23","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF01894196","volume":"3","author":"M. Constantinescu","year":"1986","unstructured":"Constantinescu, M., Sanko., D.: Tree enumeration modulo a consensus. J. Classif. 3 (1986) 349\u2013356","journal-title":"J. Classif."},{"key":"41_CR24","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0025-5564(83)90080-9","volume":"66","author":"W.H.E. Day","year":"1983","unstructured":"Day, W.H.E.: The role of complexity in comparing classifications. Math. Biosci. 66 (1983) 97\u2013114","journal-title":"Math. Biosci."},{"key":"41_CR25","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0020-0190(93)90181-8","volume":"48","author":"M.A. Steel","year":"1993","unstructured":"Steel, M.A., Warnow, T.: Kaikoura tree theorems: Computing the maximum agreement subtree. Info. Proc. Letters 48 (1993) 77\u201382","journal-title":"Info. Proc. Letters"},{"key":"41_CR26","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0020-0190(95)00110-X","volume":"55","author":"M. Farach","year":"1995","unstructured":"Farach, M., Przytycka, T.M. and Thorup, M.: On the agreement of many trees. Info. Proc. Letters 55 (1995) 297\u2013301","journal-title":"Info. Proc. Letters"},{"key":"41_CR27","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1093\/oso\/9780195066982.003.0014","volume-title":"Phylogenetic analysis of DNA sequences","author":"D.L. Swofford","year":"1991","unstructured":"Swofford, D.L.: When are phylogeny estimates from molecular and morphological data incongruent? In: Miyamoto, M. M., Cracraft, J. (eds.): Phylogenetic analysis of DNA sequences. Oxford University Press, New York (1991) 295\u2013333"},{"key":"41_CR28","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1007\/3-540-44696-6_12","volume-title":"Finding a maximum compatible tree for a bounded number of trees with bounded degree is solvable in polynomial time","author":"G. Ganapathysaravanabavan","year":"2001","unstructured":"Ganapathysaravanabavan, G. and Warnow, T.: Finding a maximum compatible tree for a bounded number of trees with bounded degree is solvable in polynomial time. In: Gascuel, O., and Moret, B.M.E. Moret (eds.): Proceedings of the First International Workshop on Algorithms in Bioinformatics (WABI 2001) (Lecture Notes in Computer Science 2149) (2001) 156\u2013163"},{"key":"41_CR29","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. Syst. Zool. 35 (1986) 325\u2013333","journal-title":"Syst. Zool."},{"key":"41_CR30","unstructured":"Douchette, C.R.: An efficient algorithm to compute quartet dissimilarity measures. BSc(Hons) dissertation. Department of Computer Science, Memorial University, Newfoundland, Canada (1985)"}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45784-4_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,18]],"date-time":"2024-02-18T14:08:36Z","timestamp":1708265316000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45784-4_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540442110","9783540457848"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/3-540-45784-4_41","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}