{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:54:49Z","timestamp":1743076489657,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642022784"},{"type":"electronic","value":"9783642022791"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02279-1_37","type":"book-chapter","created":{"date-parts":[[2009,5,20]],"date-time":"2009-05-20T02:51:59Z","timestamp":1242787919000},"page":"517-534","source":"Crossref","is-referenced-by-count":1,"title":["Split-Order Distance for Clustering and Classification Hierarchies"],"prefix":"10.1007","author":[{"given":"Qi","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric Yi","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abhishek","family":"Sarkar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"37_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00026-001-8006-8","volume":"5","author":"B.L. Allen","year":"2001","unstructured":"Allen, B.L., Steel, M.: Subtree transfer operations and their induced metrics on evolutionary trees. Annals of Combinatorics\u00a05, 1\u201313 (2001)","journal-title":"Annals of Combinatorics"},{"issue":"6","key":"37_CR2","doi-asserted-by":"publisher","first-page":"1656","DOI":"10.1137\/S0097539794269461","volume":"26","author":"A. Amir","year":"1997","unstructured":"Amir, A., Keselman, D.: Maximum agreement subtree in a set of evolutionary trees: metrics and efficient algorithms. Proc. of the SIAM Journal on Computing\u00a026(6), 1656\u20131669 (1997)","journal-title":"Proc. of the SIAM Journal on Computing"},{"key":"37_CR3","doi-asserted-by":"crossref","unstructured":"Bille, P.: A survey on tree edit distance and related problems. Theoretical Computer Science, 217\u2013239 (2005)","DOI":"10.1016\/j.tcs.2004.12.030"},{"key":"37_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-540-73420-8_15","volume-title":"Automata, Languages and Programming","author":"E.D. Demaine","year":"2007","unstructured":"Demaine, E.D., Mozes, S., Rossman, B., Weimann, O.: An Optimal Decomposition Algorithm for Tree Edit Distance. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 146\u2013157. Springer, Heidelberg (2007)"},{"key":"37_CR5","doi-asserted-by":"crossref","unstructured":"Eastabrook, G.F., McMorris, F.R., Meacham, C.A.: Comparison of undirected phylogenetic trees based on subtrees of four evolutionary units. Syst. Zool (1985)","DOI":"10.2307\/2413326"},{"key":"37_CR6","doi-asserted-by":"publisher","first-page":"401","DOI":"10.2307\/2412923","volume":"27","author":"J. Felsenstein","year":"1978","unstructured":"Felsenstein, J.: Cases in which parsimony and compatibility methods will be positively misleading. Syst. Zool.\u00a027, 401\u2013410 (1978)","journal-title":"Syst. Zool."},{"key":"37_CR7","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1126\/science.283.5398.83","volume":"283","author":"V.R. Iyer","year":"1996","unstructured":"Iyer, V.R., Eisen, M.B., Ross, D.T., Schuler, G., Moore, T., Lee, J.C., Trent, J.M., Staudt, L.M., Hudson Jr., J., Boguski, M.S., Lashkari, D., Shalon, D., Botstein, D., Brown, P.O.: Transcriptional program in the response of human fibroblasts to serum. Science\u00a0283, 83\u201387 (1996)","journal-title":"Science"},{"key":"37_CR8","unstructured":"Jiang, D., Pei, J., Zhang, A.: DHC: a density-based hierarchical clustering method for time series gene expression data. In: Proc. of the The Third Symposium on Bioinformatics and Bioengineering, pp. 393\u2013400 (2003)"},{"key":"37_CR9","doi-asserted-by":"crossref","unstructured":"Karypis, G.: CLUTO - A Clustering Toolkit. Tech Report, Dept. of Computer Science, University of Minnesota (2002)","DOI":"10.21236\/ADA439508"},{"key":"37_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/3-540-68530-8_8","volume-title":"Algorithms - ESA \u201998","author":"P.N. Klein","year":"1998","unstructured":"Klein, P.N.: Computing the edit-distance between unrooted ordered trees. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol.\u00a01461, p. 91. Springer, Heidelberg (1998)"},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"Lu, S.Y.: A tree-to-tree distance and its application to cluster analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI) (1979)","DOI":"10.1109\/TPAMI.1979.6786615"},{"key":"37_CR12","first-page":"119","volume":"VI","author":"D.F. Robinson","year":"1979","unstructured":"Robinson, D.F., Foulds, L.R.: Comparison of weighted labeled trees. Combinatorial mathematics\u00a0VI, 119\u2013126 (1979)","journal-title":"Combinatorial mathematics"},{"issue":"1-2","key":"37_CR13","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.: Comparison of phylogenetic trees. Math. Biosci.\u00a053(1-2), 131\u2013147 (1981)","journal-title":"Math. Biosci."},{"issue":"4","key":"37_CR14","first-page":"406","volume":"4","author":"N. Saitou","year":"1987","unstructured":"Saitou, N., Nei, M.: The neighbor-joining method: a new method for reconstructing phylogenetic trees. The Mol. Biol. Evol.\u00a04(4), 406\u2013425 (1987)","journal-title":"The Mol. Biol. Evol."},{"key":"37_CR15","doi-asserted-by":"crossref","unstructured":"Shasha, D., Wang, J.T.L., Zhang, S.: Unordered Tree Mining with Applications to Phylogeny. In: Proc. IEEE International Conference on Data Engineering (ICDE 2004) (2004)","DOI":"10.1109\/ICDE.2004.1320039"},{"key":"37_CR16","first-page":"230","volume-title":"Numerical Taxonomy","author":"P.H.A. Sneath","year":"1973","unstructured":"Sneath, P.H.A., Sokal, R.R.: Numerical Taxonomy, pp. 230\u2013234. WH Freeman and Company, New York (1973)"},{"issue":"3","key":"37_CR17","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0020-0190(02)00369-1","volume":"85","author":"H. Touzet","year":"2003","unstructured":"Touzet, H.: Tree edit distance with gaps. Information Processing Letters\u00a085(3), 123\u2013129 (2003)","journal-title":"Information Processing Letters"},{"issue":"4","key":"37_CR18","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1109\/69.298173","volume":"6","author":"J.T. Wang","year":"1994","unstructured":"Wang, J.T., Zhang, K., Jeong, K., Shasha, D.: A system for approximate tree matching. IEEE Transactions on Knowledge and Data Engineering\u00a06(4), 559\u2013571 (1994)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"37_CR19","unstructured":"Eastabrook, G.F., McMorris, F.R., Meacham, C.A.: TreeRank: A similarity measure for nearest neighbor searching in phylogenetic databases. In: Proc. of the 15th International Conference on Scientific and Statistical Database Management (1985)"},{"key":"37_CR20","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1016\/0022-5193(78)90137-6","volume":"73","author":"M.S. Waterman","year":"1978","unstructured":"Waterman, M.S., Smith, T.F.: On the similarity of dendrograms. Journal of Theoretical Biology\u00a073, 789\u2013800 (1978)","journal-title":"Journal of Theoretical Biology"},{"key":"37_CR21","doi-asserted-by":"crossref","unstructured":"Zhang, K., Shasha, D.: Simple fast algorithms for the editing distance between trees and related problems. SIAM Journal of Computing (1989)","DOI":"10.1137\/0218082"}],"container-title":["Lecture Notes in Computer Science","Scientific and Statistical Database Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02279-1_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T03:05:31Z","timestamp":1558321531000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02279-1_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642022784","9783642022791"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02279-1_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}