{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:59:00Z","timestamp":1725559140379},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241317"},{"type":"electronic","value":"9783540305514"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30551-4_51","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T18:15:37Z","timestamp":1279044937000},"page":"581-593","source":"Crossref","is-referenced-by-count":8,"title":["The Maximum Agreement of Two Nested Phylogenetic Networks"],"prefix":"10.1007","author":[{"given":"Jesper","family":"Jansson","sequence":"first","affiliation":[]},{"given":"Wing-Kin","family":"Sung","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"51_CR1","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 J. on Computing\u00a026, 1656\u20131669 (1997)","journal-title":"SIAM J. on Computing"},{"key":"51_CR2","unstructured":"Bryant, D.: Building trees, hunting for trees, and comparing trees: theory and methods in phylogenetic analysis. PhD thesis, Univ. of Canterbury, New Zealand (1997)"},{"key":"51_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/3-540-45784-4_28","volume-title":"Algorithms in Bioinformatics","author":"D. Bryant","year":"2002","unstructured":"Bryant, D., Moulton, V.: NeighborNet: An agglomerative method for the construction of planar phylogenetic networks. In: Guig\u00f3, R., Gusfield, D. (eds.) WABI 2002. LNCS, vol.\u00a02452, pp. 375\u2013391. Springer, Heidelberg (2002)"},{"key":"51_CR4","series-title":"ENTCS","first-page":"134","volume-title":"Proc. of Computing: the 10 th Australasian Theory Symposium (CATS\u00a02004)","author":"C. Choy","year":"2004","unstructured":"Choy, C., Jansson, J., Sadakane, K., Sung, W.-K.: Computing the maximum agreement of phylogenetic networks. In: Proc. of Computing: the 10 th Australasian Theory Symposium (CATS\u00a02004). ENTCS, vol.\u00a091, pp. 134\u2013147. Elsevier, Amsterdam (2004)"},{"issue":"5","key":"51_CR5","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 logn) algorithm for the maximum agreement subtree problem for binary trees. SIAM J. on Computing\u00a030(5), 1385\u20131404 (2000)","journal-title":"SIAM J. on Computing"},{"key":"51_CR6","volume-title":"Introduction to algorithms","author":"T. Cormen","year":"1990","unstructured":"Cormen, T., Leiserson, C., Rivest, R.: Introduction to algorithms. MIT Press, Cambridge (1990)"},{"key":"51_CR7","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"},{"key":"51_CR8","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":"51_CR9","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":"51_CR10","doi-asserted-by":"crossref","unstructured":"Gusfield, D., Eddhu, S., Langley, C.: Efficient reconstruction of phylogenetic networks with constrained recombination. In: Proc. of the Computational Systems Bioinformatics Conference (CSB2003), pp. 363\u2013374 (2003)","DOI":"10.1109\/CSB.2003.1227337"},{"issue":"2","key":"51_CR11","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0025-5564(90)90123-G","volume":"98","author":"J. Hein","year":"1990","unstructured":"Hein, J.: Reconstructing evolution of sequences subject to recombination using parsimony. Mathematical Biosciences\u00a098(2), 185\u2013200 (1990)","journal-title":"Mathematical Biosciences"},{"key":"51_CR12","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/978-3-540-30219-3_33","volume-title":"Algorithms in Bioinformatics","author":"D.H. Huson","year":"2004","unstructured":"Huson, D.H., Dezulian, T., Kl\u00f6pper, T.H., Steel, M.A.: Phylogenetic super-networks from partial trees. In: Jonassen, I., Kim, J. (eds.) WABI 2004. LNCS (LNBI), vol.\u00a03240, pp. 388\u2013399. Springer, Heidelberg (2004)"},{"key":"51_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/978-3-540-27798-9_49","volume-title":"Computing and Combinatorics","author":"J. Jansson","year":"2004","unstructured":"Jansson, J., Sung, W.-K.: Inferring a level-1 phylogenetic network from a dense set of rooted triplets. In: Chwa, K.-Y., Munro, J.I.J. (eds.) COCOON 2004. LNCS, vol.\u00a03106, pp. 462\u2013471. Springer, Heidelberg (2004)"},{"issue":"2","key":"51_CR14","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":"51_CR15","volume-title":"Molecular Evolution","author":"W.-H. Li","year":"1997","unstructured":"Li, W.-H.: Molecular Evolution. Sinauer Associates, Inc., Sunderland (1997)"},{"key":"51_CR16","doi-asserted-by":"crossref","unstructured":"Nakhleh, L., Sun, J., Warnow, T., Linder, C.R., Moret, B.M.E., Tholse, A.: Towards the development of computational tools for evaluating phylogenetic reconstruction methods. In: Proc. of the 8 th Pacific Symposium on Biocomputing (PSB\u00a02003), pp. 315\u2013326 (2003)","DOI":"10.1142\/9789812776303_0030"},{"key":"51_CR17","doi-asserted-by":"crossref","unstructured":"Nakhleh, L., Warnow, T., Linder, C.R.: Reconstructing reticulate evolution in species \u2013 theory and practice. In: Proc. of the 8 th Annual International Conf. on\u00a0Research in Computational Molecular Biology (RECOMB\u00a02004), pp. 337\u2013346 (2004)","DOI":"10.1145\/974614.974659"},{"issue":"1","key":"51_CR18","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/S0169-5347(00)02026-7","volume":"16","author":"D. Posada","year":"2001","unstructured":"Posada, D., Crandall, K.A.: Intraspecific gene genealogies: trees grafting into networks. TRENDS in Ecology & Evolution\u00a016(1), 37\u201345 (2001)","journal-title":"TRENDS in Ecology & Evolution"},{"key":"51_CR19","unstructured":"Setubal, J., Meidanis, J.: Introduction to Comp. Molecular Biology. PWS (1997)"},{"key":"51_CR20","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"},{"issue":"1","key":"51_CR21","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1089\/106652701300099119","volume":"8","author":"L. Wang","year":"2001","unstructured":"Wang, L., Zhang, K., Zhang, L.: Perfect phylogenetic networks with recombination. Journal of Computational Biology\u00a08(1), 69\u201378 (2001)","journal-title":"Journal of Computational Biology"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30551-4_51.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:21:29Z","timestamp":1605759689000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30551-4_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241317","9783540305514"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30551-4_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}