{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T08:40:07Z","timestamp":1746348007208,"version":"3.40.4"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319102641"},{"type":"electronic","value":"9783319102658"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-10265-8_2","type":"book-chapter","created":{"date-parts":[[2014,8,19]],"date-time":"2014-08-19T07:26:17Z","timestamp":1408433177000},"page":"15-29","source":"Crossref","is-referenced-by-count":3,"title":["Centroid Clustering of Cellular Lineage Trees"],"prefix":"10.1007","author":[{"given":"Valeriy","family":"Khakhutskyy","sequence":"first","affiliation":[]},{"given":"Michael","family":"Schwarzfischer","sequence":"additional","affiliation":[]},{"given":"Nina","family":"Hubig","sequence":"additional","affiliation":[]},{"given":"Claudia","family":"Plant","sequence":"additional","affiliation":[]},{"given":"Carsten","family":"Marr","sequence":"additional","affiliation":[]},{"given":"Michael A.","family":"Rieger","sequence":"additional","affiliation":[]},{"given":"Timm","family":"Schroeder","sequence":"additional","affiliation":[]},{"given":"Fabian J.","family":"Theis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-642-30232-9_8","volume-title":"Matrix Information Geometry","author":"M. Arnaudon","year":"2013","unstructured":"Arnaudon, M., Barbaresco, F., Yang, L.: Medians and means in riemannian geometry: Existence, uniqueness and computation. In: Nielsen, F., Bhatia, R. (eds.) Matrix Information Geometry, pp. 169\u2013197. Springer, Heidelberg (2013)"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/278298.278306","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. Journal of ACM\u00a045, 501\u2013555 (1998)","journal-title":"Journal of ACM"},{"key":"2_CR3","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-540-39644-4_6","volume-title":"Discovery Science","author":"T. Asai","year":"2003","unstructured":"Asai, T., Arimura, H., Uno, T., Nakano, S.-I.: Discovering frequent substructures in large unordered trees. In: Grieser, G., Tanaka, Y., Yamamoto, A. (eds.) DS 2003. LNCS (LNAI), vol.\u00a02843, pp. 47\u201361. Springer, Heidelberg (2003)"},{"issue":"1-3","key":"2_CR4","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.tcs.2004.12.030","volume":"337","author":"P. Bille","year":"2005","unstructured":"Bille, P.: A survey on tree edit distance and related problems. Theoretical Computer Science\u00a0337(1-3), 217\u2013239 (2005)","journal-title":"Theoretical Computer Science"},{"key":"2_CR5","unstructured":"Bishop, C.: Pattern recognition and machine learning. Information science and statistics. Springer (2006)"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s11336-007-9021-4","volume":"73","author":"M. Brusco","year":"2008","unstructured":"Brusco, M., K\u00f6hn, H.: Optimal partitioning of a data set based on the p-median model. Psychometrika\u00a073, 89\u2013105 (2008)","journal-title":"Psychometrika"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-642-03767-2_42","volume-title":"Computer Analysis of Images and Patterns","author":"M. Ferrer","year":"2009","unstructured":"Ferrer, M., Valveny, E., Serratosa, F., Bardaj\u00ed, I., Bunke, H.: Graph-based k-means clustering: A comparison of the set median versus the generalized median graph. In: Jiang, X., Petkov, N. (eds.) CAIP 2009. LNCS, vol.\u00a05702, pp. 342\u2013350. Springer, Heidelberg (2009)"},{"key":"2_CR8","series-title":"SCI","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-642-17557-2_9","volume-title":"Mining of Data with Complex Structures","author":"F. Hadzic","year":"2011","unstructured":"Hadzic, F., Tan, H., Dillon, T.S.: Tree mining applications. In: Hadzic, F., Tan, H., Dillon, T.S. (eds.) Mining of Data with Complex Structures. SCI, vol.\u00a0333, pp. 201\u2013247. Springer, Heidelberg (2011)"},{"issue":"5","key":"2_CR9","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1007\/s00778-012-0263-0","volume":"21","author":"S. Helmer","year":"2012","unstructured":"Helmer, S., Augsten, N., B\u00f6hlen, M.: Measuring structural similarity of semistructured data based on information-theoretic approaches. The VLDB Journal\u00a021(5), 677\u2013702 (2012)","journal-title":"The VLDB Journal"},{"issue":"1-3","key":"2_CR10","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1023\/B:MACH.0000033119.52532.ce","volume":"56","author":"B.J. Jain","year":"2004","unstructured":"Jain, B.J., Wysotzki, F.: Central clustering of attributed graphs. Machine Learning\u00a056(1-3), 169\u2013207 (2004)","journal-title":"Machine Learning"},{"key":"2_CR11","first-page":"696","volume-title":"Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2000","author":"P. Klein","year":"2000","unstructured":"Klein, P., Tirthapura, S., Sharvit, D., Kimia, B.: A tree-edit-distance algorithm for comparing simple, closed shapes. In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2000, pp. 696\u2013704. Society for Industrial and Applied Mathematics, Philadelphia (2000)"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"497","DOI":"10.2307\/1910129","volume":"28","author":"A.H. Land","year":"1960","unstructured":"Land, A.H., Doig, A.G.: An automatic method of solving discrete programming problems. Econometrica\u00a028, 497\u2013520 (1960)","journal-title":"Econometrica"},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"2213","DOI":"10.1016\/S0031-3203(03)00084-0","volume":"36","author":"B. Luo","year":"2003","unstructured":"Luo, B., Wilson, R.C., Hancock, E.R.: Spectral embedding of graphs. Pattern Recognition\u00a036, 2213\u20132230 (2003)","journal-title":"Pattern Recognition"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/3-540-44692-3_19","volume-title":"Computer Analysis of Images and Patterns","author":"B. Luo","year":"2001","unstructured":"Luo, B., Robles-Kelly, A., Torsello, A., Wilson, R.C., Hancock, E.R.: Discovering shape categories by clustering shock trees. In: Skarbek, W. (ed.) CAIP 2001. LNCS, vol.\u00a02124, pp. 152\u2013160. Springer, Heidelberg (2001)"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Marinai, S., Marino, E., Soda, G.: Tree clustering for layout-based document image retrieval. In: DIAL 2006: Proceedings of the Second International Conference on Document Image Analysis for Libraries (DIAL 2006), pp. 243\u2013253. IEEE Computer Society (2006)","DOI":"10.1109\/DIAL.2006.44"},{"issue":"18","key":"2_CR16","doi-asserted-by":"publisher","first-page":"3488","DOI":"10.1111\/j.1742-4658.2012.08664.x","volume":"279","author":"C. Marr","year":"2012","unstructured":"Marr, C., Strasser, M., Schwarzfischer, M., Schroeder, T., Theis, F.J.: Multi-scale modeling of gmp differentiation based on single-cell genealogies. FEBS J.\u00a0279(18), 3488\u20133500 (2012)","journal-title":"FEBS J."},{"issue":"3","key":"2_CR17","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1016\/j.ejor.2005.05.034","volume":"179","author":"N. Mladenovic","year":"2007","unstructured":"Mladenovic, N., Brimberg, J., Hansen, P., Moreno-Perez, J.: The p-median problem: A survey of metaheuristic approaches. European Journal of Operational Research\u00a0179(3), 927\u2013939 (2007)","journal-title":"European Journal of Operational Research"},{"key":"2_CR18","unstructured":"Nijssen, S., Kok, J.: Efficient discovery of frequent unordered trees. In: Proc. First Intl Workshop Mining Graphs, Trees, and Sequences, pp. 55\u201364 (2003)"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Paul, D.: Extensions to phone-state decision-tree clustering: Single tree and tagged clustering. In: IEEE International Conference on Acoustics, Speech, and Signal Processing, vol.\u00a02, pp. 1487\u20131490 (1997)","DOI":"10.1109\/ICASSP.1997.596231"},{"key":"2_CR20","first-page":"1337","volume":"24","author":"L. Rastrigin","year":"1963","unstructured":"Rastrigin, L.: The convergence of the random search method in the extremal control of a many parameter system. Automation and Remote Control\u00a024, 1337\u20131342 (1963)","journal-title":"Automation and Remote Control"},{"key":"2_CR21","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1126\/science.1171461","volume":"325","author":"M.A. Rieger","year":"2009","unstructured":"Rieger, M.A., Hoppe, P.S., Smejkal, B.M., Eitelhuber, A.C., Schroeder, T.: Hematopoietic cytokines can instruct lineage choice. Science\u00a0325, 217\u2013218 (2009)","journal-title":"Science"},{"key":"2_CR22","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1287\/moor.6.1.19","volume":"6","author":"F. Solis","year":"1981","unstructured":"Solis, F., Wets, R.J.-B.: Minimization by random search techniques. Mathematics of Operations Research\u00a06, 19\u201330 (1981)","journal-title":"Mathematics of Operations Research"},{"key":"2_CR23","doi-asserted-by":"publisher","first-page":"2319","DOI":"10.1126\/science.290.5500.2319","volume":"290","author":"J.B. Tenenbaum","year":"2000","unstructured":"Tenenbaum, J.B., de Silva, V., Langford, J.C.: A global geometric framework for nonlinear dimensionality reduction. Science\u00a0290, 2319\u20132323 (2000)","journal-title":"Science"},{"issue":"5","key":"2_CR24","doi-asserted-by":"publisher","first-page":"1393","DOI":"10.1016\/j.patcog.2006.09.006","volume":"40","author":"A. Torsello","year":"2007","unstructured":"Torsello, A., Hancock, E.R.: Graph embedding using tree edit-union. Pattern Recognition\u00a040(5), 1393\u20131405 (2007)","journal-title":"Pattern Recognition"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"Torsello, A., Hidovi\u0107-Rowe, D., Pelillo, M.: Polynomial-time metrics for attributed trees. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a027(7), 1087\u20131099 (2005), cited By (since 1996)35","DOI":"10.1109\/TPAMI.2005.146"},{"issue":"10-12","key":"2_CR26","doi-asserted-by":"publisher","first-page":"2029","DOI":"10.1016\/j.neucom.2007.11.033","volume":"71","author":"B. Xiao","year":"2008","unstructured":"Xiao, B., Torsello, A., Hancock, E.R.: Isotree: Tree clustering via metric embedding. Neurocomputing\u00a071(10-12), 2029\u20132036 (2008)","journal-title":"Neurocomputing"},{"key":"2_CR27","first-page":"33","volume":"66","author":"M. Zaki","year":"2005","unstructured":"Zaki, M.: Efficiently mining frequent embedded unordered trees. Fundamenta Informaticae\u00a066, 33\u201352 (2005)","journal-title":"Fundamenta Informaticae"},{"issue":"3","key":"2_CR28","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/BF01975866","volume":"15","author":"K. Zhang","year":"1996","unstructured":"Zhang, K.: A constrained edit distance between unordered labeled trees. Algorithmica\u00a015(3), 205\u2013222 (1996)","journal-title":"Algorithmica"},{"key":"2_CR29","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1137\/0218082","volume":"18","author":"K. Zhang","year":"1989","unstructured":"Zhang, K., Shasha, D.: Simple fast algorithms for the editing distance between trees and related problems. SIAM J. Comput.\u00a018, 1245\u20131262 (1989)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Information Technology in Bio- and Medical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-10265-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T08:06:20Z","timestamp":1746345980000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-10265-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319102641","9783319102658"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-10265-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}