{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:59:08Z","timestamp":1725487148958},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734505"},{"type":"electronic","value":"9783540734512"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73451-2_77","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T12:12:14Z","timestamp":1184587934000},"page":"736-745","source":"Crossref","is-referenced-by-count":2,"title":["Clustering of Leaf-Labelled Trees on Free Leafset"],"prefix":"10.1007","author":[{"given":"Jakub","family":"Koperwas","sequence":"first","affiliation":[]},{"given":"Krzysztof","family":"Walczak","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"77_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1007\/978-3-540-71618-1_78","volume-title":"ICANNGA 2007","author":"J. Koperwas","year":"2007","unstructured":"Koperwas, J., Walczak, K.: Clustering of leaf labeled-trees (Part I). In: ICANNGA 2007. LNCS, vol.\u00a04431, pp. 702\u2013710. Springer, Heidelberg (2007)"},{"key":"77_CR2","series-title":"Lecture Notes in Computer Science","first-page":"156","volume-title":"Algorithms in Bioinformatics","author":"G. Ganeshkumar","year":"2001","unstructured":"Ganeshkumar, G., Warnow, T.: Finding a maximum compatible tree for a bounded number of trees with bounded degree is solvable in polynomial time. In: Gascuel, O., Moret, B.M.E. (eds.) WABI 2001. LNCS, vol.\u00a02149, pp. 156\u2013163. Springer, Heidelberg (2001)"},{"key":"77_CR3","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":"77_CR4","unstructured":"Bryant, D.: Building trees, hunting for trees, and comparing trees. Theory And Method. In: Phylogenetic Analysis. Ph.D Thesis University of Canterbury (1997)"},{"key":"77_CR5","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1093\/oxfordjournals.molbev.a004081","volume":"19","author":"O. Elemento","year":"2002","unstructured":"Elemento, O. et al.: Reconstructing the duplication history of tandemly repeated genes. Molecular Biology and Evolution\u00a019, 278\u2013288 (2002)","journal-title":"Molecular Biology and Evolution"},{"key":"77_CR6","unstructured":"Tandem Repeats Database, \n                    \n                      http:\/\/tandem.bu.edu"},{"key":"77_CR7","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. Bionformatics\u00a018, 285\u2013293 (2002)","journal-title":"Bionformatics"},{"key":"77_CR8","first-page":"71","volume-title":"8th IEEE Symposium on Information Visualization","author":"N. Amenta","year":"2002","unstructured":"Amenta, N., Klingner, J.: Case study: Visualizing sets of evolutionary trees. In: 8th IEEE Symposium on Information Visualization, pp. 71\u201374. IEEE Computer Society Press, Los Alamitos (2002)"},{"key":"77_CR9","unstructured":"Akutsu, T., Halldrsson, M.: On the approximation of largest common point sets and largest common subtrees. Unpublished manuscript (1997)"},{"issue":"1","key":"77_CR10","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1080\/10635150390132821","volume":"52","author":"O. Gascuel","year":"2003","unstructured":"Gascuel, O. et al.: The combinatorics of tandem duplication trees. Systematic Biology\u00a052(1), 110\u2013118 (2003)","journal-title":"Systematic Biology"},{"key":"77_CR11","unstructured":"Bille, P.: Tree edit distance, alignment distance and inclusion. Technical report TR-2003-23 in IT University Technical Report Series (2003)"}],"container-title":["Lecture Notes in Computer Science","Rough Sets and Intelligent Systems Paradigms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73451-2_77.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:15:20Z","timestamp":1605744920000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73451-2_77"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540734505","9783540734512"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73451-2_77","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}