{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T11:38:53Z","timestamp":1742384333422},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540850960"},{"type":"electronic","value":"9783540850977"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85097-7_44","type":"book-chapter","created":{"date-parts":[[2008,8,19]],"date-time":"2008-08-19T07:18:26Z","timestamp":1219130306000},"page":"469-478","source":"Crossref","is-referenced-by-count":2,"title":["Clustered SplitsNetworks"],"prefix":"10.1007","author":[{"given":"Lichen","family":"Bao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergey","family":"Bereg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"44_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0001-8708(92)90061-O","volume":"92","author":"H. Bandelt","year":"1992","unstructured":"Bandelt, H., Dress, A.: A canonical decomposition theory for metrics on a finite set. Advances in Mathematics\u00a092, 47\u2013105 (1992)","journal-title":"Advances in Mathematics"},{"key":"44_CR2","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":"44_CR3","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0001-8708(84)90029-X","volume":"53","author":"A. Dress","year":"1984","unstructured":"Dress, A.: Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces. Advances in Mathematics\u00a053, 321\u2013402 (1984)","journal-title":"Advances in Mathematics"},{"key":"44_CR4","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/TCBB.2004.27","volume":"1","author":"A. Dress","year":"2004","unstructured":"Dress, A., Huson, D.: Constructing splits graphs. IEEE\/ACM Transactions in Computational Biology and Bioinformatics\u00a01, 109\u2013115 (2004)","journal-title":"IEEE\/ACM Transactions in Computational Biology and Bioinformatics"},{"key":"44_CR5","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1287\/ijoc.1040.0099","volume":"16","author":"D. Gusfield","year":"2004","unstructured":"Gusfield, D., Eddhu, S., Langley, C.: The fine structure of galls in phylogenetic networks. INFORMS Journal on Computing\u00a016, 459\u2013469 (2004)","journal-title":"INFORMS Journal on Computing"},{"key":"44_CR6","doi-asserted-by":"publisher","first-page":"806","DOI":"10.1016\/j.dam.2005.05.044","volume":"155","author":"D. Gusfield","year":"2007","unstructured":"Gusfield, D., Hickerson, D., Eddhu, S.: An efficiently computed lower bound on the number of recombinations in phylogenetic networks: Theory and empirical study. Discrete Applied Mathematics\u00a0155, 806\u2013830 (2007)","journal-title":"Discrete Applied Mathematics"},{"key":"44_CR7","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1093\/bioinformatics\/14.1.68","volume":"14","author":"D. Huson","year":"1998","unstructured":"Huson, D.: Splitstree: a program for analyzing and visualizing evolutionary data. Bioinformatics\u00a014, 68\u201373 (1998)","journal-title":"Bioinformatics"},{"key":"44_CR8","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1093\/molbev\/msj030","volume":"23","author":"D. Huson","year":"2006","unstructured":"Huson, D., Bryant, D.: Application of phylogenetic networks in evolutionary studies. Molecular Biology and Evolution\u00a023, 254\u2013267 (2006)","journal-title":"Molecular Biology and Evolution"},{"key":"44_CR9","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-540-71681-5_15","volume-title":"Research in Computational Molecular Biology","author":"D. Huson","year":"2007","unstructured":"Huson, D., Kl\u00f6pper, T.: Beyond galled trees - decomposition and computation of galled networks. In: Speed, T., Huang, H. (eds.) RECOMB 2007. LNCS (LNBI), vol.\u00a04453, pp. 211\u2013225. Springer, Heidelberg (2007)"},{"key":"44_CR10","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1006\/eujc.2000.0386","volume":"21","author":"J. Koolen","year":"2000","unstructured":"Koolen, J., Moulton, V., T\u00f6nges, U.: A classification of the six-point prime metrics. Europ. J. Combinatorics\u00a021, 815\u2013829 (2000)","journal-title":"Europ. J. Combinatorics"},{"issue":"1","key":"44_CR11","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1109\/TCBB.2004.10","volume":"155","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.E.: Phylogenetic networks: Modeling, reconstructibility, and accuracy. IEEE\/ACM Trans. Comput. Biology Bioinformatics\u00a0155(1), 13\u201323 (2004)","journal-title":"IEEE\/ACM Trans. Comput. Biology Bioinformatics"},{"key":"44_CR12","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1093\/genetics\/163.1.375","volume":"163","author":"S. Myers","year":"2003","unstructured":"Myers, S., Griffiths, R.: Bounds on the minimum number of recombination events in a sample history. Genetics\u00a0163, 375\u2013394 (2003)","journal-title":"Genetics"},{"issue":"6","key":"44_CR13","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1089\/cmb.2005.12.796","volume":"12","author":"L. Nakhleh","year":"2005","unstructured":"Nakhleh, L., Warnow, T., Linder, C.R., John, K.St.: Reconstructing reticulate evolution in species: Theory and practice. Journal of Computational Biology\u00a012(6), 796\u2013811 (2005)","journal-title":"Journal of Computational Biology"},{"key":"44_CR14","first-page":"413","volume":"21","author":"Y.S. Song","year":"2005","unstructured":"Song, Y.S., Wu, Y., Gusfield, D.: Efficient computation of close lower and upper bounds on the minimum number of recombinations in biological sequence evolution. Advances in Mathematics\u00a021, 413\u2013422 (2005)","journal-title":"Advances in Mathematics"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85097-7_44.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,15]],"date-time":"2021-09-15T04:03:03Z","timestamp":1631678583000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85097-7_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540850960","9783540850977"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85097-7_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}