{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T15:29:41Z","timestamp":1742398181673},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540287025"},{"type":"electronic","value":"9783540318675"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11549345_20","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T14:05:47Z","timestamp":1127829947000},"page":"224-235","source":"Crossref","is-referenced-by-count":4,"title":["Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix"],"prefix":"10.1007","author":[{"given":"Ho-Leung","family":"Chan","sequence":"first","affiliation":[]},{"given":"Jesper","family":"Jansson","sequence":"additional","affiliation":[]},{"given":"Tak-Wah","family":"Lam","sequence":"additional","affiliation":[]},{"given":"Siu-Ming","family":"Yiu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","unstructured":"Bryant, D.: Building Trees, Hunting for Trees, and Comparing Trees: Theory and Methods in Phylogenetic Analysis. PhD thesis, University of Canterbury, Christchurch, New Zealand (1997)"},{"issue":"2","key":"20_CR2","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1093\/molbev\/msh018","volume":"21","author":"D. Bryant","year":"2004","unstructured":"Bryant, D., Moulton, V.: Neighbor-Net: An agglomerative method for the construction of phylogenetic networks. Molecular Biology and Evolution\u00a021(2), 255\u2013265 (2004)","journal-title":"Molecular Biology and Evolution"},{"key":"20_CR3","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1007\/978-3-540-30551-4_26","volume-title":"Algorithms and Computation","author":"Hsin-Fu Chen","year":"2004","unstructured":"Chen, H.-F., Chang, M.-S.: An efficient exact algorithm for the minimum ultrametric tree problem. In: Proceedings of the 15 th International Symposium on Algorithms and Computation (ISAAC\u00a02004), pp. 282\u2013293 (2004)"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Diday, E., Bertrand, P.: An extension of hierarchical clustering: the pyramidal representation. Pattern Recognition in Practice\u00a0II, 411\u2013424 (1986)","DOI":"10.1016\/B978-0-444-87877-9.50038-8"},{"issue":"1\/2","key":"20_CR5","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/BF01188585","volume":"13","author":"M. Farach","year":"1995","unstructured":"Farach, M., Kannan, S., Warnow, T.: A robust model for finding optimal evolutionary trees. Algorithmica\u00a013(1\/2), 155\u2013179 (1995)","journal-title":"Algorithmica"},{"key":"20_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Cambridge University Press, New York (1997)"},{"key":"20_CR7","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)"},{"issue":"1","key":"20_CR8","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1142\/S0219720004000521","volume":"2","author":"D. Gusfield","year":"2004","unstructured":"Gusfield, D., Eddhu, S., Langley, C.: Optimal, efficient reconstruction of phylogenetic networks with constrained recombination. Journal of Bioinformatics and Computational Biology\u00a02(1), 173\u2013213 (2004)","journal-title":"Journal of Bioinformatics and Computational Biology"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"He, Y.-J., Huynh, T.N.D., Jansson, J., Sung, W.-K.: Inferring phylogenetic relationships avoiding forbidden rooted triplets. In: Proceedings of the 3 rd Asia-Pacific Bioinformatics Conference (APBC\u00a02005), pp. 339\u2013348 (2005)","DOI":"10.1142\/9781860947322_0034"},{"key":"20_CR10","first-page":"388","volume-title":"Lecture Notes in Computer Science","author":"Daniel H. Huson","year":"2004","unstructured":"Huson, D.H., Dezulian, T., Kl\u00f6pper, T., Steel, M.: Phylogenetic super-networks from partial trees. In: Proceedings of the 4 th Workshop on Algorithms in Bioinformatics (WABI\u00a02004), pp. 388\u2013399 (2004)"},{"key":"20_CR11","first-page":"265","volume-title":"Lecture Notes in Computer Science","author":"Trinh 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: Proceedings of the 9 th Annual International Conference on Research in Computational Molecular Biology (RECOMB\u00a02005), pp. 265\u2013280 (2005)"},{"key":"20_CR12","unstructured":"Jansson, J., Nguyen, N.B., Sung, W.-K.: Algorithms for combining rooted triplets into a galled phylogenetic network. In: Proc. of the 16 th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u00a02005), pp. 349\u2013358 (2005)"},{"key":"20_CR13","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1007\/978-3-540-30551-4_51","volume-title":"Algorithms and Computation","author":"Jesper Jansson","year":"2004","unstructured":"Jansson, J., Sung, W.-K.: The maximum agreement of two nested phylogenetic networks. In: Proceedings of the 15 th International Symposium on Algorithms and Computation (ISAAC\u00a02004), pp. 581\u2013593 (2004)"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Nakhleh, L., Warnow, T., Linder, C.R.: Reconstructing reticulate evolution in species \u2013 theory and practice. In: Proceedings of the 8 th Annual International Conference on Research in Computational Molecular Biology (RECOMB\u00a02004), pp. 337\u2013346 (2004)","DOI":"10.1145\/974614.974659"},{"issue":"1","key":"20_CR15","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"},{"issue":"4","key":"20_CR16","first-page":"406","volume":"4","author":"N. Saitou","year":"1987","unstructured":"Saitou, N., Nei, M.: The neighbor-joining method: A new method for reconstructing phylogenetic trees. Molecular Biology and Evolution\u00a04(4), 406\u2013425 (1987)","journal-title":"Molecular Biology and Evolution"},{"issue":"1","key":"20_CR17","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"},{"issue":"2\u20133","key":"20_CR18","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1023\/A:1009885610075","volume":"3","author":"B.Y. Wu","year":"1999","unstructured":"Wu, B.Y., Chao, K.-M., Tang, C.Y.: Approximation and exact algorithms for constructing minimum ultrametric trees from distance matrices. Journal of Combinatorial Optimization\u00a03(2\u20133), 199\u2013211 (1999)","journal-title":"Journal of Combinatorial Optimization"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11549345_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:41:12Z","timestamp":1605642072000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11549345_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540287025","9783540318675"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11549345_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}