{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:52:29Z","timestamp":1742993549096,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540877431"},{"type":"electronic","value":"9783540877448"}],"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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"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.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87744-8_66","type":"book-chapter","created":{"date-parts":[[2008,8,30]],"date-time":"2008-08-30T09:20:52Z","timestamp":1220088052000},"page":"793-804","source":"Crossref","is-referenced-by-count":15,"title":["An Experimental Analysis of Robinson-Foulds Distance Matrix Algorithms"],"prefix":"10.1007","author":[{"given":"Seung-Jin","family":"Sul","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tiffani L.","family":"Williams","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"66_CR1","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1080\/10635150590946961","volume":"54","author":"D.M. Hillis","year":"2005","unstructured":"Hillis, D.M., Heath, T.A., John, K.S.: Analysis and visualization of tree space. Syst. Biol.\u00a054(3), 471\u2013482 (2005)","journal-title":"Syst. Biol."},{"key":"66_CR2","doi-asserted-by":"crossref","unstructured":"Sul, S.J., Williams, T.L.: A randomized algorithm for comparing sets of phylogenetic trees. In: Proc. Fifth Asia Pacific Bioinformatics Conference (APBC 2007), pp. 121\u2013130 (2007)","DOI":"10.1142\/9781860947995_0015"},{"key":"66_CR3","unstructured":"Sul, S.J., Williams, T.L.: HashRF: a fast algorithm for computing the Robinson-Foulds distance matrix. Technical Report TR-CS-2008-6-1, Department of Computer Science, Texas A& M University (2008), \n                      http:\/\/www.cs.tamu.edu\/academics\/tr\/tamu-cs-tr-2008-6-1"},{"issue":"6","key":"66_CR4","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1089\/cmb.2007.R012","volume":"14","author":"N. Pattengale","year":"2007","unstructured":"Pattengale, N., Gottlieb, E., Moret, B.: Efficiently computing the Robinson-Foulds metric. Journal of Computational Biology\u00a014(6), 724\u2013735 (2007)","journal-title":"Journal of Computational Biology"},{"key":"66_CR5","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. Mathematical Biosciences\u00a053, 131\u2013147 (1981)","journal-title":"Mathematical Biosciences"},{"key":"66_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. Journal Of Classification\u00a02, 7\u201328 (1985)","journal-title":"Journal Of Classification"},{"key":"66_CR7","doi-asserted-by":"crossref","unstructured":"Amenta, N., Clarke, F., John, K.S.: A linear-time majority tree algorithm. In: Workshop on Algorithms in Bioinformatics. LNCS, vol.\u00a02168, pp. 216\u2013227 (2003)","DOI":"10.1007\/978-3-540-39763-2_17"},{"issue":"3","key":"66_CR8","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1093\/bioinformatics\/bti798","volume":"22","author":"N. Bortolussi","year":"2006","unstructured":"Bortolussi, N., Durand, E., Blum, M., Franois, O.: apTreeshape: statistical analysis of phylogenetic tree shape. Bioinformatics\u00a022(3), 363\u2013364 (2006)","journal-title":"Bioinformatics"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2008"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87744-8_66","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,7]],"date-time":"2024-05-07T05:20:26Z","timestamp":1715059226000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87744-8_66"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540877431","9783540877448"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87744-8_66","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}