{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:55:47Z","timestamp":1743134147018,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":17,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387307701"},{"type":"electronic","value":"9780387301624"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_92","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:36:50Z","timestamp":1214505410000},"page":"202-205","source":"Crossref","is-referenced-by-count":0,"title":["Constructing a\u00a0Galled Phylogenetic Network"],"prefix":"10.1007","author":[{"given":"Wing-Kin","family":"Sung","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"92_CR1_92","first-page":"204","volume-title":"Proc. 1st Workshop on Algorithms in Bioinformatics (WABI 2001). LNCS, vol. 2149","author":"B. Chor","year":"2001","unstructured":"Chor, B., Hendy, M., Penny, D.: Analytic solutions for three-taxon MLMC trees with variable rates across sites. In: Proc. 1st Workshop on Algorithms in Bioinformatics (WABI\u00a02001). LNCS, vol.\u00a02149, pp.\u00a0204\u2013213. Springer, Berlin (2001)"},{"key":"92_CR2_92","unstructured":"Choy, C., Jansson, J., Sadakane, K., Sung, W.-K.: Computing the maximum agreement of phylogenetic networks. In: Proc. Computing: the 10th Australasian Theory Symposium (CATS\u00a02004), 2004, pp.\u00a033\u201345"},{"key":"92_CR3_92","unstructured":"Gusfield, D., Eddhu, S., Langley, C.: Efficient reconstruction of phylogenetic networks with constrained recombination. In: Proc. of Computational Systems Bioinformatics (CSB2003), 2003 pp.\u00a0363\u2013374"},{"issue":"1","key":"92_CR4_92","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1142\/S0219720006001709","volume":"4","author":"Y.-J. He","year":"2006","unstructured":"He, Y.-J., Huynh, T.N.D., Jannson, J., Sung, W.-K.: Inferring phylogenetic relationships avoiding forbidden rooted triplets. J\u00a0Bioinform. Comput. Biol. 4(1), 59\u201374 (2006)","journal-title":"J Bioinform. Comput. Biol."},{"issue":"2","key":"92_CR5_92","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. Math. Biosci. 98(2), 185\u2013200 (1990)","journal-title":"Math. Biosci."},{"issue":"1","key":"92_CR6_92","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/PL00009268","volume":"24","author":"M.R. Henzinger","year":"1999","unstructured":"Henzinger, M.R., King, V., Warnow, T.: Constructing a\u00a0tree from homeomorphic subtrees, with applications to computational evolutionary biology. Algorithmica 24(1), 1\u201313 (1999)","journal-title":"Algorithmica"},{"key":"92_CR7_92","doi-asserted-by":"crossref","unstructured":"Jansson, J., Sung, W.-K.: Inferring a\u00a0level-1 phylogenetic network from a\u00a0dense set of rooted triplets. In: Proc. 10th International Computing and Combinatorics Conference (COCOON\u00a02004), 2004","DOI":"10.1007\/978-3-540-27798-9_49"},{"issue":"5","key":"92_CR8_92","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1137\/S0097539704446529","volume":"35","author":"J. Jansson","year":"2006","unstructured":"Jansson, J., Nguyen, N.B., Sung, W.-K.: Algorithms for combining rooted triplets into a\u00a0galled phylogenetic network. SIAM\u00a0J. Comput. 35(5), 1098\u20131121 (2006)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"92_CR9_92","doi-asserted-by":"publisher","first-page":"1942","DOI":"10.1137\/S0097539799361683","volume":"30","author":"T. Jiang","year":"2001","unstructured":"Jiang, T., Kearney, P., Li, M.: A\u00a0polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application. SIAM J. Comput. 30(6), 1942\u20131961 (2001)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"92_CR10_92","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1006\/jagm.1996.0035","volume":"21","author":"S. Kannan","year":"1996","unstructured":"Kannan, S., Lawler, E., Warnow, T.: Determining the evolutionary tree using experiments. J.\u00a0Algorithms 21(1), 26\u201350 (1996)","journal-title":"J. Algorithms"},{"key":"92_CR11_92","first-page":"111","volume-title":"Current Topics in Computational Molecular Biology","author":"P. Kearney","year":"2002","unstructured":"Kearney, P.: Phylogenetics and the quartet method. In: Jiang, T., Xu, Y., and Zhang, M.Q. (eds.) Current Topics in Computational Molecular Biology, pp.\u00a0111\u2013133. MIT Press, Cambridge (2002)"},{"key":"92_CR12_92","volume-title":"Molecular Evolution","author":"W.-H. Li.","year":"1997","unstructured":"Li., W.-H.: Molecular Evolution. Sinauer, Sunderland (1997)"},{"key":"92_CR13_92","doi-asserted-by":"crossref","unstructured":"Nakhleh, L., Warnow, T., Linder, C.R.: Reconstructing reticulate evolution in species\u00a0\u2013 theory and practice. In: Proc. 8th Annual International Conference on Research in Computational Molecular Biology (RECOMB\u00a02004), 2004, pp.\u00a0337\u2013346","DOI":"10.1145\/974614.974659"},{"issue":"1\u20132","key":"92_CR14_92","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0166-218X(95)00074-2","volume":"69","author":"M.P. Ng","year":"1996","unstructured":"Ng, M.P., Wormald, N.C.: Reconstruction of rooted trees from subtrees. Discrete Appl. Math. 69(1\u20132), 19\u201331 (1996)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"92_CR15_92","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 Ecol. Evol. 16(1), 37\u201345 (2001)","journal-title":"TRENDS Ecol. Evol."},{"key":"92_CR16_92","volume-title":"Introduction to Computational Molecular Biology","author":"J.C. Setubal","year":"1997","unstructured":"Setubal, J.C., Meidanis, J.: Introduction to Computational Molecular Biology. PWS, Boston (1997)"},{"issue":"1","key":"92_CR17_92","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. J.\u00a0Comput. Biol. 8(1), 69\u201378 (2001)","journal-title":"J. Comput. Biol."}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_92","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T02:06:40Z","timestamp":1662170800000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_92"}},"subtitle":["2006; Jansson, Nguyen, Sung"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_92","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}