{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T11:27:18Z","timestamp":1742383638903},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642015502"},{"type":"electronic","value":"9783642015519"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-01551-9_12","type":"book-chapter","created":{"date-parts":[[2009,4,28]],"date-time":"2009-04-28T06:29:20Z","timestamp":1240900160000},"page":"112-123","source":"Crossref","is-referenced-by-count":2,"title":["Counting Faces in Split Networks"],"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":"12_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":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/978-3-540-85097-7_44","volume-title":"Combinatorial Optimization and Applications","author":"L. Bao","year":"2008","unstructured":"Bao, L., Bereg, S.: Clustered splitsnetworks. In: Yang, B., Du, D.-Z., Wang, C.A. (eds.) COCOA 2008. LNCS, vol.\u00a05165, pp. 469\u2013478. Springer, Heidelberg (2008)"},{"key":"12_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":"12_CR4","unstructured":"Buneman, P.: The recovery of trees from measures of dissimlarity. Math. and the Archeological and Historical Sciences, 387\u2013395 (1971)"},{"issue":"7","key":"12_CR5","doi-asserted-by":"publisher","first-page":"1781","DOI":"10.1046\/j.1365-294X.2003.01876.x","volume":"12","author":"I. Cassens","year":"2003","unstructured":"Cassens, I., Van Waerebeek, K., Best, P.B., Crespo, E.A., Reyes, J., Milinkovitch, M.C.: The phylogeography of dusky dolphins (lagenorhynchus obscurus): a critical examination of network methods and rooting procedures. Mol. Ecol.\u00a012(7), 1781\u20131792 (2003)","journal-title":"Mol. Ecol."},{"key":"12_CR6","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":"12_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)"},{"key":"12_CR8","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"},{"issue":"2","key":"12_CR9","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1093\/molbev\/msj030","volume":"23","author":"D.H. Huson","year":"2005","unstructured":"Huson, D.H., Bryant, D.: Application of phylogenetic networks in evolutionary studies. Molecular Biology and Evolution\u00a023(2), 254\u2013267 (2005)","journal-title":"Molecular Biology and Evolution"},{"key":"12_CR10","series-title":"CRC Computer and Information Science Series","volume-title":"Handbook of Computational Biology","author":"C.R. Linder","year":"2005","unstructured":"Linder, C.R., Warnow, T.: Overview of phylogeny reconstruction. In: Aluru, S. (ed.) Handbook of Computational Biology. CRC Computer and Information Science Series. Chapman & Hall, Boca Raton (2005)"},{"key":"12_CR11","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/11557067_20","volume-title":"Algorithms in Bioinformatics","author":"R.B. Lyngs\u00f8","year":"2005","unstructured":"Lyngs\u00f8, R.B., Song, Y.S., Hein, J.: Minimum recombination histories by branch and bound. In: Casadio, R., Myers, G. (eds.) WABI 2005. LNCS (LNBI), vol.\u00a03692, pp. 239\u2013250. Springer, Heidelberg (2005)"},{"issue":"1","key":"12_CR12","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":"12_CR13","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, 406\u2013425 (1987)","journal-title":"Molecular Biology and Evolution"},{"key":"12_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"},{"issue":"12","key":"12_CR15","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/j.patcog.2006.06.020","volume":"39","author":"M.A.H. Zahid","year":"2006","unstructured":"Zahid, M.A.H., Mittal, A., Joshi, R.C.: A pattern recognition-based approach for phylogenetic network construction with constrained recombination. Pattern Recognition\u00a039(12), 387\u2013395 (2006)","journal-title":"Pattern Recognition"}],"container-title":["Lecture Notes in Computer Science","Bioinformatics Research and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01551-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,7]],"date-time":"2019-03-07T18:38:54Z","timestamp":1551983934000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01551-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642015502","9783642015519"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01551-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}