{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:31:53Z","timestamp":1742913113383,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319595740"},{"type":"electronic","value":"9783319595757"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","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":[[2017]]},"DOI":"10.1007\/978-3-319-59575-7_4","type":"book-chapter","created":{"date-parts":[[2017,5,30]],"date-time":"2017-05-30T09:14:49Z","timestamp":1496135689000},"page":"34-45","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Reconstructing One-Articulated Networks with Distance Matrices"],"prefix":"10.1007","author":[{"given":"Kuang-Yu","family":"Chang","sequence":"first","affiliation":[]},{"given":"Yun","family":"Cui","sequence":"additional","affiliation":[]},{"given":"Siu-Ming","family":"Yiu","sequence":"additional","affiliation":[]},{"given":"Wing-Kai","family":"Hon","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,31]]},"reference":[{"issue":"2","key":"4_CR1","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.jalgor.2005.08.001","volume":"57","author":"MA Bender","year":"2005","unstructured":"Bender, M.A., Farach-Colton, M., Pemmasani, G., Skiena, S., Sumazin, P.: Lowest common ancestors in trees and directed acyclic graphs. J. Algorithms 57(2), 75\u201394 (2005)","journal-title":"J. Algorithms"},{"key":"4_CR2","first-page":"47","volume":"213","author":"M Bordewich","year":"2016","unstructured":"Bordewich, M., Tokac, N.: An algorithm for reconstructing ultrametric tree-child networks from inter-taxa distances. DAM 213, 47\u201359 (2016)","journal-title":"DAM"},{"issue":"2","key":"4_CR3","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. Mol. Biol. Evol. 21(2), 255\u2013265 (2004)","journal-title":"Mol. Biol. Evol."},{"issue":"4","key":"4_CR4","first-page":"552","volume":"6","author":"G Cardona","year":"2009","unstructured":"Cardona, G., Rossello, F., Valiente, G.: Comparison of tree-child phylogenetic networks. IEEE\/ACM TCBB 6(4), 552\u2013569 (2009)","journal-title":"IEEE\/ACM TCBB"},{"issue":"4","key":"4_CR5","first-page":"807","volume":"4","author":"H Chan","year":"2006","unstructured":"Chan, H., Jansson, J., Lam, T., Yiu, S.: Reconstructing an ultrametric galled phylogenetic network from a distance matrix. JBCB 4(4), 807\u2013832 (2006)","journal-title":"JBCB"},{"issue":"1","key":"4_CR6","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/BF01908061","volume":"2","author":"WHE Day","year":"1985","unstructured":"Day, W.H.E.: Optimal algorithms for comparing trees with labeled leaves. J. Classif. 2(1), 7\u201328 (1985)","journal-title":"J. Classif."},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-319-16706-0_12","volume-title":"Research in Computational Molecular Biology","author":"P Gambette","year":"2015","unstructured":"Gambette, P., Gunawan, A.D.M., Labarre, A., Vialette, S., Zhang, L.: Locating a tree in a phylogenetic network in quadratic time. In: Przytycka, T.M. (ed.) RECOMB 2015. LNCS, vol. 9029, pp. 96\u2013107. Springer, Cham (2015). doi:10.1007\/978-3-319-16706-0_12"},{"issue":"1","key":"4_CR8","first-page":"173","volume":"2","author":"D Gusfield","year":"2004","unstructured":"Gusfield, D., Eddhu, S., Langley, C.H.: Optimal, efficient reconstruction of phylogenetic networks with constrained recombination. JBCB 2(1), 173\u2013214 (2004)","journal-title":"JBCB"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-540-71681-5_15","volume-title":"Research in Computational Molecular Biology","author":"DH 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, vol. 4453, pp. 211\u2013225. Springer, Heidelberg (2007). doi:10.1007\/978-3-540-71681-5_15"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/11415770_20","volume-title":"Research in Computational Molecular Biology","author":"TND 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, vol. 3500, pp. 265\u2013280. Springer, Heidelberg (2005). doi:10.1007\/11415770_20"},{"issue":"23","key":"4_CR11","doi-asserted-by":"publisher","first-page":"1037","DOI":"10.1016\/j.ipl.2010.07.027","volume":"110","author":"L van Iersel","year":"2010","unstructured":"van Iersel, L., Semple, C., Steel, M.: Locating a tree in a phylogenetic network. IPL 110(23), 1037\u20131043 (2010)","journal-title":"IPL"},{"issue":"1","key":"4_CR12","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.tcs.2006.06.022","volume":"363","author":"J Jansson","year":"2006","unstructured":"Jansson, J., Sung, W.: Inferring a level-1 phylogenetic network from a dense set of rooted triplets. TCS 363(1), 60\u201368 (2006)","journal-title":"TCS"},{"issue":"4","key":"4_CR13","first-page":"667","volume":"6","author":"L van Iersel","year":"2009","unstructured":"van Iersel, L., Keijsper, J., Kelk, S., Stougie, L., Hagen, F., Boekhout, T.: Constructing level-2 phylogenetic networks from triplets. IEEE\/ACM TCBB 6(4), 667\u2013681 (2009)","journal-title":"IEEE\/ACM TCBB"},{"issue":"6","key":"4_CR14","first-page":"796","volume":"12","author":"L Nakhleh","year":"2005","unstructured":"Nakhleh, L., Warnow, T., Linder, C.R.: Reconstructing reticulate evolution in species: theory and practice. JCB 12(6), 796\u2013811 (2005)","journal-title":"JCB"}],"container-title":["Lecture Notes in Computer Science","Bioinformatics Research and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59575-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T14:46:49Z","timestamp":1709822809000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-59575-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319595740","9783319595757"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59575-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"31 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISBRA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Bioinformatics Research and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Honolulu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 June 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isbra2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/alan.cs.gsu.edu\/isbra17\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}