{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:56:58Z","timestamp":1725573418496},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540309352"},{"type":"electronic","value":"9783540324263"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11602613_41","type":"book-chapter","created":{"date-parts":[[2005,12,2]],"date-time":"2005-12-02T08:24:24Z","timestamp":1133511864000},"page":"402-411","source":"Crossref","is-referenced-by-count":0,"title":["Fast Algorithms for Computing the Tripartition-Based Distance Between Phylogenetic Networks"],"prefix":"10.1007","author":[{"given":"Nguyen Bao","family":"Nguyen","sequence":"first","affiliation":[]},{"given":"C. Thach","family":"Nguyen","sequence":"additional","affiliation":[]},{"given":"Wing-Kin","family":"Sung","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"41_CR1","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)"},{"issue":"1","key":"41_CR2","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.tcs.2004.12.012","volume":"335","author":"C. Choy","year":"2005","unstructured":"Choy, C., Jansson, J., Sadakane, K., Sung, W.-K.: Computing the maximum\u00a0agreement of phylogenetic networks. Theoretical Computer Science\u00a0335(1), 93\u2013107 (2005)","journal-title":"Theoretical Computer Science"},{"key":"41_CR3","doi-asserted-by":"publisher","first-page":"2124","DOI":"10.1126\/science.284.5423.2124","volume":"284","author":"W.F. Doolittle","year":"1999","unstructured":"Doolittle, W.F.: Phylogenetic classification and the universal tree. Science\u00a0284, 2124\u20132128 (1999)","journal-title":"Science"},{"key":"41_CR4","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/11415770_17","volume-title":"Research in Computational Molecular Biology","author":"D. Gusfield","year":"2005","unstructured":"Gusfield, D., Bansal, V.: A fundamental decomposition theory for phylogenetic networks and incompatible characters. In: Miyano, S., Mesirov, J., Kasif, S., Istrail, S., Pevzner, P.A., Waterman, M. (eds.) RECOMB 2005. LNCS (LNBI), vol.\u00a03500, pp. 217\u2013232. Springer, Heidelberg (2005)"},{"key":"41_CR5","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 (CSB 2003), pp. 363\u2013374 (2003)","DOI":"10.1109\/CSB.2003.1227337"},{"issue":"2","key":"41_CR6","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"},{"issue":"3","key":"41_CR7","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.ipl.2004.04.003","volume":"91","author":"W.-K. Hon","year":"2004","unstructured":"Hon, W.-K., Kao, M.-Y., Lam, T.W., Sung, W.-K., Yiu, S.-M.: Non-shared edges and nearest neighbor interchanges revisited. Inf. Process. Lett.\u00a091(3), 129\u2013134 (2004)","journal-title":"Inf. Process. Lett."},{"key":"41_CR8","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., Steel, M.: 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":"41_CR9","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/11415770_18","volume-title":"Research in Computational Molecular Biology","author":"D.H. Huson","year":"2005","unstructured":"Huson, D.H., Klopper, T., Lockhart, P.J., Steel, M.A.: Reconstruction of reticulate networks from gene trees. In: Miyano, S., Mesirov, J., Kasif, S., Istrail, S., Pevzner, P.A., Waterman, M. (eds.) RECOMB 2005. LNCS (LNBI), vol.\u00a03500, pp. 233\u2013249. Springer, Heidelberg (2005)"},{"key":"41_CR10","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/11415770_20","volume-title":"Research in Computational Molecular Biology","author":"T.N.D. Huynh","year":"2005","unstructured":"Huynh, T.N.D., Jansson, J., Nguyen, N.B., Sung, W.K.: Constructing a smallest refining galled phylogenetic network. In: Miyano, S., Mesirov, J., Kasif, S., Istrail, S., Pevzner, P.A., Waterman, M. (eds.) RECOMB 2005. LNCS (LNBI), vol.\u00a03500, pp. 265\u2013280. Springer, Heidelberg (2005)"},{"key":"41_CR11","unstructured":"Jansson, J., Nguyen, N.B., Sung, W.K.: Algorithms for combining rooted triplets into a galled phylogenetic network. In: Proc. of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), pp. 349\u2013358 (2005)"},{"key":"41_CR12","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)"},{"key":"41_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/978-3-540-30551-4_51","volume-title":"Algorithms and Computation","author":"J. Jansson","year":"2004","unstructured":"Jansson, J., Sung, W.K.: The maximum agreement of two nested phylogenetic networks. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 581\u2013593. Springer, Heidelberg (2004)"},{"issue":"1","key":"41_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TCBB.2004.10","volume":"1","author":"B.M.E. Moret","year":"2004","unstructured":"Moret, B.M.E., Nakhleh, L., Warnow, T., Linder, C.R., Tholse, A., Padolina, A., Sun, J., Timme, R.: Phylogenetic networks: Modeling, reconstructibility, and accuracy. IEEE Transactions on Computational Biology and Bioinformatics\u00a01(1), 1\u201312 (2004)","journal-title":"IEEE Transactions on Computational Biology and Bioinformatics"},{"key":"41_CR15","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 8th Pacific Symposium on Biocomputing (PSB\u00a02003), pp. 315\u2013326 (2003)","DOI":"10.1142\/9789812776303_0030"},{"key":"41_CR16","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 8th Annual International Conf.\u00a0on\u00a0Research in Computational Molecular Biology (RECOMB\u00a02004), pp. 337\u2013346 (2004)","DOI":"10.1145\/974614.974659"},{"issue":"1","key":"41_CR17","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":"41_CR18","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"},{"issue":"1","key":"41_CR19","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\/11602613_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:02:51Z","timestamp":1619506971000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11602613_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540309352","9783540324263"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11602613_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}