{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:17:11Z","timestamp":1725488231025},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642380358"},{"type":"electronic","value":"9783642380365"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38036-5_14","type":"book-chapter","created":{"date-parts":[[2013,5,13]],"date-time":"2013-05-13T02:16:04Z","timestamp":1368411364000},"page":"112-124","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Reconstructing k-Reticulated Phylogenetic Network from a Set of Gene Trees"],"prefix":"10.1007","author":[{"given":"Hoa","family":"Vu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francis","family":"Chin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W. K.","family":"Hon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Henry","family":"Leung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Sadakane","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ken W. K.","family":"Sung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siu-Ming","family":"Yiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"14_CR1","first-page":"295","volume":"3","author":"T.W. Lam","year":"1996","unstructured":"Lam, T.W., Sung, W.K., Ting, H.F.: Computing the unrooted maximum agreement subtree in sub-quadratic time. Nordic Journal of Computing\u00a03(4), 295\u2013322 (1996)","journal-title":"Nordic Journal of Computing"},{"issue":"1","key":"14_CR2","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/S0097539794262422","volume":"26","author":"M. Farach","year":"1997","unstructured":"Farach, M., Thorup, M.: Sparse dynamic programming for evolutionary-tree comparison. SIAM Journal on Computing\u00a026(1), 210\u2013230 (1997)","journal-title":"SIAM Journal on Computing"},{"key":"14_CR3","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.J.: Kaikoura tree theorems: Computing the maximum agreement subtree. Information Processing Letters\u00a048, 77\u201382 (1993)","journal-title":"Information Processing Letters"},{"issue":"5423","key":"14_CR4","doi-asserted-by":"publisher","first-page":"2124","DOI":"10.1126\/science.284.5423.2124","volume":"284","author":"W. Ford Doolittle","year":"1999","unstructured":"Ford Doolittle, W.: Phylogenetic classification and the universal tree. Science\u00a0284(5423), 2124\u20132128 (1999)","journal-title":"Science"},{"key":"14_CR5","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":"14_CR6","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 8th Annual International Conference on Research in Computational Molecular Biology (RECOMB 2004), pp. 337\u2013346 (2004)","DOI":"10.1145\/974614.974659"},{"key":"14_CR7","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1007\/978-3-540-71681-5_36","volume-title":"Research in Computational Molecular Biology","author":"W.-H. Lee","year":"2007","unstructured":"Lee, W.-H., Sung, W.-K.: RB-finder: An improved distance-based sliding window method to detect recombination breakpoints. In: Speed, T., Huang, H. (eds.) RECOMB 2007. LNCS (LNBI), vol.\u00a04453, pp. 518\u2013532. Springer, Heidelberg (2007)"},{"issue":"1475","key":"14_CR8","doi-asserted-by":"publisher","first-page":"2045","DOI":"10.1098\/rstb.2006.1925","volume":"361","author":"D. Falush","year":"2006","unstructured":"Falush, D., Torpdahl, M., Didelot, X., Conrad, D.F., Wilson, D.J., Achtman, M.: Mismatch induced speciation in salmonella: model and data. Philos. Trans. R Soc. Lond. B Biol. Sci.\u00a0361(1475), 2045\u20132053 (2006)","journal-title":"Philos. Trans. R Soc. Lond. B Biol. Sci."},{"issue":"2","key":"14_CR9","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1111\/j.1574-6968.2001.tb10668.x","volume":"199","author":"J. Majewski","year":"2001","unstructured":"Majewski, J.: Sexual isolation in bacteria. FEMS Microbiol. Lett.\u00a0199(2), 161\u2013169 (2001)","journal-title":"FEMS Microbiol. Lett."},{"issue":"5811","key":"14_CR10","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1126\/science.1127573","volume":"315","author":"C. Fraser","year":"2007","unstructured":"Fraser, C., Hanage, W.P., Spratt, B.G.: Recombination and the nature of bacterial speciation. Science\u00a0315(5811), 476\u2013480 (2007)","journal-title":"Science"},{"key":"14_CR11","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/978-3-540-78839-3_40","volume-title":"Research in Computational Molecular Biology","author":"L. Iersel van","year":"2008","unstructured":"van Iersel, L., Keijsper, J., Kelk, S., Stougie, L., Hagen, F., Boekhout, T.: Constructing level-2 phylogenetic networks from triplets. In: Vingron, M., Wong, L. (eds.) RECOMB 2008. LNCS (LNBI), vol.\u00a04955, pp. 450\u2013462. Springer, Heidelberg (2008)"},{"key":"14_CR12","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)"},{"issue":"2","key":"14_CR13","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1109\/TCBB.2011.137","volume":"9","author":"C. Zhi-Zhong","year":"2012","unstructured":"Zhi-Zhong, C., Lusheng, W.: Algorithms for Reticulate Networks of Multiple Phylogenetic Trees. IEEE\/ACM Transactions on Computational Biology and Bioinformatics (TCBB)\u00a09(2), 372\u2013384 (2012)","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics (TCBB)"},{"key":"14_CR14","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.H. Huson","year":"2007","unstructured":"Huson, D.H., Kl\u00f6pper, T.H.: 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":"14_CR15","unstructured":"Jansson, J., Nguyen, N.B., Sung, W.-K.: Algorithms for combining rooted triplets into a galled phylogenetic network. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 349\u2013358 (2005)"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Habib, M., To, T.-H.: Constructing a minimum phylogenetic network from a dense triplet set. J. Bioinformatics and Computational Biology 10(05) (2012)","DOI":"10.1142\/S0219720012500138"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Gambette, P., Berry, V., Paul, C.: Quartets and Unrooted Phylogenetic Networks. Journal of Bioinformatics and Computational Biology (2011)","DOI":"10.1142\/S0219720012500047"}],"container-title":["Lecture Notes in Computer Science","Bioinformatics Research and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38036-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,17]],"date-time":"2020-03-17T20:24:31Z","timestamp":1584476671000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38036-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642380358","9783642380365"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38036-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}