{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:52:44Z","timestamp":1725486764907},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540715894"},{"type":"electronic","value":"9783540716181"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-71618-1_78","type":"book-chapter","created":{"date-parts":[[2007,7,3]],"date-time":"2007-07-03T02:05:53Z","timestamp":1183428353000},"page":"702-710","source":"Crossref","is-referenced-by-count":4,"title":["Clustering of Leaf-Labelled Trees"],"prefix":"10.1007","author":[{"given":"Jakub","family":"Koperwas","sequence":"first","affiliation":[]},{"given":"Krzysztof","family":"Walczak","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"78_CR1","unstructured":"Akutsu, T., Halld\u00f3rsson, M.: On the approximation of largest common point sets and largest common subtrees. Unpublished manuscript (1997)"},{"key":"78_CR2","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/978-3-540-39763-2_17","volume-title":"Algorithms in Bioinformatics","author":"N. Amenta","year":"2003","unstructured":"Amenta, N., Clarke, F., St. John, K.: A linear-time majority tree algorithm. In: Benson, G., Page, R.D.M. (eds.) WABI 2003. LNCS (LNBI), vol.\u00a02812, pp. 216\u2013227. Springer, Heidelberg (2003)"},{"key":"78_CR3","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/S0196-8858(02)00505-5","volume":"31","author":"D. Auber","year":"2003","unstructured":"Auber, D., Delest, M.: A clustering algorithm for huge trees. Advances in Applied Mathematics\u00a031, 46\u201360 (2003)","journal-title":"Advances in Applied Mathematics"},{"key":"78_CR4","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/BF01894194","volume":"3","author":"J.P. Barthelemy","year":"1986","unstructured":"Barthelemy, J.P., McMorris, F.R.: The median procedure for n-trees. J. Classif.\u00a03, 329\u2013334 (1986)","journal-title":"J. Classif."},{"key":"78_CR5","unstructured":"Bille, P.: Tree Edit Distance, Alignment Distance and Inclusion. Technical report TR-2003-23 in IT University Technical Report Series (2003)"},{"key":"78_CR6","unstructured":"Bryant, D.: Building Trees, Hunting For Trees, And Comparing Trees. Theory And Methods In Phylogenetic Analysis. Ph.D Thesis University of Canterbury (1997)"},{"key":"78_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1007\/978-3-540-24587-2_37","volume-title":"Algorithms and Computation","author":"I. Elias","year":"2003","unstructured":"Elias, I.: Settling the intractability of multiple alignment. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol.\u00a02906, pp. 352\u2013363. Springer, Heidelberg (2003)"},{"key":"78_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/3-540-48194-X_22","volume-title":"Combinatorial Pattern Matching","author":"J. Jansson","year":"2001","unstructured":"Jansson, J., Lingas, A.: A Fast Algorithm for Optimal Alignment between Similar Ordered Trees. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol.\u00a02089, pp. 232\u2013232. Springer, Heidelberg (2001)"},{"key":"78_CR9","doi-asserted-by":"crossref","unstructured":"Amenta, N., Klingner, J.: Case study: Visualizing sets of evolutionary trees. In: 8th IEEE Symposium on Information Visualization, pp. 71\u201374 (2002)","DOI":"10.1109\/INFVIS.2002.1173150"},{"key":"78_CR10","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1093\/bioinformatics\/18.suppl_1.S285","volume":"18","author":"C. Stockham","year":"2002","unstructured":"Stockham, C., Wang, L.S., Warnow, T.: Statistically Based Postprocessing of Phylogenetic Analysis by Clustering. Bioinformatics\u00a018, 285\u2013293 (2002)","journal-title":"Bioinformatics"},{"key":"78_CR11","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1109\/TKDE.2005.30","volume":"17","author":"Y. Xia","year":"2005","unstructured":"Xia, Y., et al.: Mining Closed and Maximal Frequent Subtrees from Databases of Labeled Rooted Trees. IEEE Transactions on Knowledge and Data Engineering\u00a017, 190\u2013202 (2005)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"}],"container-title":["Lecture Notes in Computer Science","Adaptive and Natural Computing Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71618-1_78.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:23:41Z","timestamp":1605763421000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71618-1_78"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540715894","9783540716181"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71618-1_78","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}