{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:32:54Z","timestamp":1725557574558},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642135088"},{"type":"electronic","value":"9783642135095"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13509-5_18","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T09:19:57Z","timestamp":1277198397000},"page":"190-201","source":"Crossref","is-referenced-by-count":3,"title":["Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks"],"prefix":"10.1007","author":[{"given":"Tetsuo","family":"Asano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jesper","family":"Jansson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kunihiko","family":"Sadakane","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryuhei","family":"Uehara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gabriel","family":"Valiente","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"18_CR1","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1080\/10635150500431197","volume":"55","author":"M. Baroni","year":"2006","unstructured":"Baroni, M., Semple, C., Steel, M.: Hybrids in real time. Syst. Biol.\u00a055(1), 46\u201356 (2006)","journal-title":"Syst. Biol."},{"issue":"2","key":"18_CR2","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.\u00a021(2), 255\u2013265 (2004)","journal-title":"Mol. Biol. Evol."},{"issue":"1","key":"18_CR3","first-page":"1","volume":"6","author":"G. Cardona","year":"2009","unstructured":"Cardona, G., Llabr\u00e9s, M., Rossell\u00f3, F., Valiente, G.: Metrics for phylogenetic networks I: Generalizations of the Robinson-Foulds metric. IEEE ACM T. Comput. Biol.\u00a06(1), 1\u201316 (2009)","journal-title":"IEEE ACM T. Comput. Biol."},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Cardona, G., Rossell\u00f3, F., Valiente, G.: Comparison of tree-child phylogenetic networks. IEEE ACM T. Comput. Biol. (2009)","DOI":"10.1109\/TCBB.2007.70270"},{"issue":"1","key":"18_CR5","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.tcs.2004.12.012","volume":"335","author":"C. Choy","year":"2005","unstructured":"Choy, C., Jansson, J., Sadakane, K., Sung, W.K.: Computing the maximum agreement of phylogenetic networks. Theor. Comput. Sci.\u00a0335(1), 93\u2013107 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"18_CR6","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/BF01908061","volume":"2","author":"W.H.E. Day","year":"1985","unstructured":"Day, W.H.E.: Optimal algorithms for comparing trees with labeled leaves. J. Classif.\u00a02(1), 7\u201328 (1985)","journal-title":"J. Classif."},{"issue":"5423","key":"18_CR7","doi-asserted-by":"publisher","first-page":"2124","DOI":"10.1126\/science.284.5423.2124","volume":"284","author":"W.F. Doolittle","year":"1999","unstructured":"Doolittle, W.F.: Phylogenetic classification and the universal tree. Science\u00a0284(5423), 2124\u20132128 (1999)","journal-title":"Science"},{"issue":"2","key":"18_CR8","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1093\/molbev\/msl180","volume":"24","author":"S. Gr\u00fcnewald","year":"2007","unstructured":"Gr\u00fcnewald, S., Forslund, K., Dress, A., Moulton, V.: QNet: An agglomerative method for the construction of phylogenetic networks from weighted quartets. Mol. Biol. Evol.\u00a024(2), 532\u2013538 (2007)","journal-title":"Mol. Biol. Evol."},{"issue":"10","key":"18_CR9","doi-asserted-by":"publisher","first-page":"2325","DOI":"10.1016\/j.dam.2008.06.038","volume":"157","author":"S. Gr\u00fcnewald","year":"2009","unstructured":"Gr\u00fcnewald, S., Moulton, V., Spillner, A.: Consistency of the QNet algorithm for generating planar split networks from weighted quartets. Discr. Appl. Math.\u00a0157(10), 2325\u20132334 (2009)","journal-title":"Discr. Appl. Math."},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Gusfield, D., Eddhu, S., Langley, C.: Efficient reconstruction of phylogenetic networks with constrained recombination. In: Proc. 2nd IEEE Computer Society Bioinformatics Conf., pp. 363\u2013374 (2003)","DOI":"10.1109\/CSB.2003.1227337"},{"issue":"4","key":"18_CR11","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.H.: The fine structure of galls in phylogenetic networks. INFORMS J. Comput.\u00a016(4), 459\u2013469 (2004)","journal-title":"INFORMS J. Comput."},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/BFb0028575","volume-title":"STACS 98","author":"T. Hagerup","year":"1998","unstructured":"Hagerup, T.: Sorting and searching on the word RAM. In: Meinel, C., Morvan, M. (eds.) STACS 1998. LNCS, vol.\u00a01373, pp. 366\u2013398. Springer, Heidelberg (1998)"},{"issue":"21","key":"18_CR13","doi-asserted-by":"publisher","first-page":"2604","DOI":"10.1093\/bioinformatics\/btl452","volume":"22","author":"G. Jin","year":"2006","unstructured":"Jin, G., Nakhleh, L., Snir, S., Tuller, T.: Maximum likelihood of phylogenetic networks. Bioinformatics\u00a022(21), 2604\u20132611 (2006)","journal-title":"Bioinformatics"},{"issue":"2","key":"18_CR14","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1093\/bioinformatics\/btl313","volume":"23","author":"G. Jin","year":"2007","unstructured":"Jin, G., Nakhleh, L., Snir, S., Tuller, T.: Efficient parsimony-based methods for phylogenetic network reconstruction. Bioinformatics\u00a023(2), 123\u2013128 (2007)","journal-title":"Bioinformatics"},{"issue":"6","key":"18_CR15","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1089\/cmb.2007.R012","volume":"14","author":"N.D. Pattengale","year":"2007","unstructured":"Pattengale, N.D., Gottlieb, E.J., Moret, B.M.: Efficiently computing the Robinson-Foulds metric. J. Comput. Biol.\u00a014(6), 724\u2013735 (2007)","journal-title":"J. Comput. Biol."},{"issue":"1","key":"18_CR16","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.\u00a016(1), 37\u201345 (2001)","journal-title":"Trends Ecol. Evol."},{"issue":"1\/2","key":"18_CR17","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0025-5564(81)90043-2","volume":"53","author":"D.F. Robinson","year":"1981","unstructured":"Robinson, D.F., Foulds, L.R.: Comparison of phylogenetic trees. Math. Biosci.\u00a053(1\/2), 131\u2013147 (1981)","journal-title":"Math. Biosci."},{"issue":"1","key":"18_CR18","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.mbs.2009.06.007","volume":"221","author":"F. Rossell\u00f3","year":"2009","unstructured":"Rossell\u00f3, F., Valiente, G.: All that glisters is not galled. Math. Biosci.\u00a0221(1), 54\u201359 (2009)","journal-title":"Math. Biosci."},{"issue":"6","key":"18_CR19","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1093\/oxfordjournals.molbev.a026367","volume":"17","author":"K. Strimmer","year":"2000","unstructured":"Strimmer, K., Moulton, V.: Likelihood analysis of phylogenetic networks using directed graphical models. Mol. Biol. Evol.\u00a017(6), 875\u2013881 (2000)","journal-title":"Mol. Biol. Evol."},{"issue":"1","key":"18_CR20","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1093\/oxfordjournals.molbev.a003725","volume":"18","author":"K. Strimmer","year":"2001","unstructured":"Strimmer, K., Wiuf, C., Moulton, V.: Recombination analysis using directed graphical models. Mol. Biol. Evol.\u00a018(1), 97\u201399 (2001)","journal-title":"Mol. Biol. Evol."},{"key":"18_CR21","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-540-87361-7_11","volume-title":"Algorithms in Bioinformatics","author":"S.-J. Sul","year":"2008","unstructured":"Sul, S.-J., Brammer, G., Williams, T.L.: Efficiently computing arbitrarily-sized Robinson-Foulds distance matrices. In: Crandall, K.A., Lagergren, J. (eds.) WABI 2008. LNCS (LNBI), vol.\u00a05251, pp. 123\u2013134. Springer, Heidelberg (2008)"},{"key":"18_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1007\/978-3-540-87744-8_66","volume-title":"Algorithms - ESA 2008","author":"S.-J. Sul","year":"2008","unstructured":"Sul, S.-J., Williams, T.L.: An experimental analysis of Robinson-Foulds distance matrix algorithms. In: Halperin, D., Mehlhorn, K. (eds.) Esa 2008. LNCS, vol.\u00a05193, pp. 793\u2013804. Springer, Heidelberg (2008)"},{"issue":"4","key":"18_CR23","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1109\/TCBB.2009.22","volume":"6","author":"L. Iersel van","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 T. Comput. Biol.\u00a06(4), 667\u2013681 (2009)","journal-title":"IEEE ACM T. Comput. Biol."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13509-5_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:39:09Z","timestamp":1606185549000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13509-5_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642135088","9783642135095"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13509-5_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}