{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:09:15Z","timestamp":1742400555464},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212584"},{"type":"electronic","value":"9783540246985"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24698-5_53","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T22:28:22Z","timestamp":1294439302000},"page":"499-508","source":"Crossref","is-referenced-by-count":4,"title":["Rooted Maximum Agreement Supertrees"],"prefix":"10.1007","author":[{"given":"Jesper","family":"Jansson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph H. -K.","family":"Ng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kunihiko","family":"Sadakane","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wing-Kin","family":"Sung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"53_CR1","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 Journal on Computing\u00a010(3), 405\u2013421 (1981)","journal-title":"SIAM Journal on Computing"},{"issue":"1\u20132","key":"53_CR2","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0304-3975(97)00278-8","volume":"233","author":"T. Akutsu","year":"2000","unstructured":"Akutsu, T., Halld\u00f3rsson, M.M.: On the approximation of largest common subtrees and largest common point sets. Theoretical Computer Science\u00a0233(1\u20132), 33\u201350 (2000)","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"53_CR3","doi-asserted-by":"publisher","first-page":"1656","DOI":"10.1137\/S0097539794269461","volume":"26","author":"A. Amir","year":"1997","unstructured":"Amir, A., Keselman, D.: Maximum agreement subtree in a set of evolutionary trees: Metrics and efficient algorithms. SIAM Journal on Computing\u00a026(6), 1656\u20131669 (1997)","journal-title":"SIAM Journal on Computing"},{"key":"53_CR4","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1146\/annurev.ecolsys.33.010802.150511","volume":"33","author":"O. Bininda-Emonds","year":"2002","unstructured":"Bininda-Emonds, O., Gittleman, J., Steel, M.: The (super)tree of life: Procedures, problems, and prospects. Annual Review of Ecology and Systematics\u00a033, 265\u2013289 (2002)","journal-title":"Annual Review of Ecology and Systematics"},{"key":"53_CR5","unstructured":"Bryant, D.: Building Trees, Hunting for Trees, and Comparing Trees: Theory and Methods in Phylogenetic Analysis. PhD thesis, Univ. of Canterbury, N.Z. (1997)"},{"key":"53_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/3-540-45727-5_3","volume-title":"Computational Biology","author":"D. Bryant","year":"2001","unstructured":"Bryant, D.: Optimal agreement supertrees. In: Gascuel, O., Sagot, M.-F. (eds.) JOBIM 2000. LNCS, vol.\u00a02066, pp. 24\u201331. Springer, Heidelberg (2001)"},{"key":"53_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/3-540-44696-6_16","volume-title":"Algorithms in Bioinformatics","author":"B. Chor","year":"2001","unstructured":"Chor, B., Hendy, M., Penny, D.: Analytic solutions for three-taxon ML\n                    MC\n                   trees with variable rates across sites. In: Gascuel, O., Moret, B.M.E. (eds.) WABI 2001. LNCS, vol.\u00a02149, pp. 204\u2013213. Springer, Heidelberg (2001)"},{"issue":"5","key":"53_CR8","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(n log n) algorithm for the maximum agreement subtree problem for binary trees. SIAM Journal on Computing\u00a030(5), 1385\u20131404 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"53_CR9","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0020-0190(95)00110-X","volume":"55","author":"M. Farach","year":"1995","unstructured":"Farach, M., Przytycka, T., Thorup, M.: On the agreement of many trees. Information Processing Letters\u00a055, 297\u2013301 (1995)","journal-title":"Information Processing Letters"},{"issue":"1","key":"53_CR10","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/S0097539794262422","volume":"26","author":"M. Farach","year":"1997","unstructured":"Farach, M., Thorup, M.: Sparse dynamic programming for evolutionary-tree comparison. SIAM Journal on Computing\u00a026(1), 210\u2013230 (1997)","journal-title":"SIAM Journal on Computing"},{"key":"53_CR11","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF01908078","volume":"2","author":"C.R. Finden","year":"1985","unstructured":"Finden, C.R., Gordon, A.D.: Obtaining common pruned trees. Journal of Classification\u00a02, 255\u2013276 (1985)","journal-title":"Journal of Classification"},{"key":"53_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/3-540-44696-6_12","volume-title":"Algorithms in Bioinformatics","author":"G. Ganapathysaravanabavan","year":"2001","unstructured":"Ganapathysaravanabavan, G., Warnow, T.: Finding a maximum compatible tree for a bounded number of trees with bounded degree is solvable in polynomial time. In: Gascuel, O., Moret, B.M.E. (eds.) WABI 2001. LNCS, vol.\u00a02149, pp. 156\u2013163. Springer, Heidelberg (2001)"},{"key":"53_CR13","volume-title":"Computers and Intractability \u2013 A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability \u2013 A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)"},{"key":"53_CR14","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1023\/A:1009833626004","volume":"3","author":"L. G\u0105sieniec","year":"1999","unstructured":"G\u0105sieniec, L., Jansson, J., Lingas, A., \u00d6stlin, A.: On the complexity of constructing evolutionary trees. Journal of Combinatorial Optimization\u00a03, 183\u2013197 (1999)","journal-title":"Journal of Combinatorial Optimization"},{"key":"53_CR15","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/S0166-218X(96)00062-5","volume":"71","author":"J. Hein","year":"1996","unstructured":"Hein, J., Jiang, T., Wang, L., Zhang, K.: On the complexity of comparing evolutionary trees. Discrete Applied Mathematics\u00a071, 153\u2013169 (1996)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"53_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/PL00009268","volume":"24","author":"M.R. Henzinger","year":"1999","unstructured":"Henzinger, M.R., King, V., Warnow, T.: Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology. Algorithmica\u00a024(1), 1\u201313 (1999)","journal-title":"Algorithmica"},{"issue":"4","key":"53_CR17","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1145\/502090.502095","volume":"48","author":"J. Holm","year":"2001","unstructured":"Holm, J., de Lichtenberg, K., Thorup, M.: Poly-logarithmic deterministic fullydynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. Journal of the ACM\u00a048(4), 723\u2013760 (2001)","journal-title":"Journal of the ACM"},{"key":"53_CR18","series-title":"Electronic Notes in Discrete Mathematics","first-page":"121","volume-title":"Proc. of the Brazilian Symp. on Graphs, Algorithms, and Combinatorics (GRACO 2001)","author":"J. Jansson","year":"2001","unstructured":"Jansson, J.: On the complexity of inferring rooted evolutionary trees. In: Proc. of the Brazilian Symp. on Graphs, Algorithms, and Combinatorics (GRACO 2001). Electronic Notes in Discrete Mathematics, vol.\u00a07, pp. 121\u2013125. Elsevier, Amsterdam (2001)"},{"issue":"2","key":"53_CR19","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1006\/jagm.2001.1163","volume":"40","author":"M.-Y. Kao","year":"2001","unstructured":"Kao, M.-Y., Lam, T.-W., Sung, W.-K., Ting, H.-F.: An even faster and more unifying algorithm for comparing trees via unbalanced bipartite matchings. Journal of Algorithms\u00a040(2), 212\u2013233 (2001)","journal-title":"Journal of Algorithms"},{"key":"53_CR20","first-page":"111","volume-title":"Current Topics in Computational Molecular Biology","author":"P. Kearney","year":"2002","unstructured":"Kearney, P.: Phylogenetics and the quartet method. In: Jiang, T., Xu, Y., Zhang, M.Q. (eds.) Current Topics in Computational Molecular Biology, pp. 111\u2013133. The MIT Press, Massachusetts (2002)"},{"key":"53_CR21","doi-asserted-by":"crossref","unstructured":"Meyers, A., Yangarber, R., Grishman, R.: Alignment of shared forests for bilingual corpora. In: Proc. of the 16th International Conference on Computational Linguistics (COLING 1996), pp. 460\u2013465 (1996)","DOI":"10.3115\/992628.992708"},{"issue":"3","key":"53_CR22","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/S0169-5347(97)01242-1","volume":"13","author":"M.J. Sanderson","year":"1998","unstructured":"Sanderson, M.J., Purvis, A., Henze, C.: Phylogenetic supertrees: assembling the trees of life. TRENDS in Ecology & Evolution\u00a013(3), 105\u2013109 (1998)","journal-title":"TRENDS in Ecology & Evolution"},{"issue":"1","key":"53_CR23","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. Journal of Classification\u00a09(1), 91\u2013116 (1992)","journal-title":"Journal of Classification"},{"key":"53_CR24","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0020-0190(93)90181-8","volume":"48","author":"M. Steel","year":"1993","unstructured":"Steel, M., Warnow, T.: Kaikoura tree theorems: Computing the maximum agreement subtree. Information Processing Letters\u00a048, 77\u201382 (1993)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","LATIN 2004: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24698-5_53","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T13:14:41Z","timestamp":1553346881000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24698-5_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212584","9783540246985"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24698-5_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}