{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:45:38Z","timestamp":1725795938201},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319075655"},{"type":"electronic","value":"9783319075662"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07566-2_17","type":"book-chapter","created":{"date-parts":[[2014,6,12]],"date-time":"2014-06-12T03:50:31Z","timestamp":1402545031000},"page":"162-171","source":"Crossref","is-referenced-by-count":0,"title":["Compactness-Preserving Mapping on Trees"],"prefix":"10.1007","author":[{"given":"Jan","family":"Baumbach","sequence":"first","affiliation":[]},{"given":"Jiong","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Rashid","family":"Ibragimov","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"17_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cosrev.2009.01.002","volume":"3","author":"A.P. Heath","year":"2009","unstructured":"Heath, A.P., Kavraki, L.E.: Computational challenges in systems biology. Computer Science Review\u00a03(1), 1\u201317 (2009)","journal-title":"Computer Science Review"},{"issue":"5","key":"17_CR2","doi-asserted-by":"publisher","first-page":"1057","DOI":"10.1016\/j.patcog.2010.11.015","volume":"44","author":"H. Bunke","year":"2011","unstructured":"Bunke, H., Riesen, K.: Recent advances in graph-based pattern recognition with applications in document analysis. Pattern Recognition\u00a044(5), 1057\u20131067 (2011)","journal-title":"Pattern Recognition"},{"issue":"3","key":"17_CR3","first-page":"265","volume":"18","author":"D. Conte","year":"2004","unstructured":"Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. IJPRAI\u00a018(3), 265\u2013298 (2004)","journal-title":"IJPRAI"},{"key":"17_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)"},{"issue":"4","key":"17_CR5","first-page":"334","volume":"5","author":"M. Pawlik","year":"2011","unstructured":"Pawlik, M., Augsten, N.: RTED: A Robust Algorithm for the Tree Edit Distance. PVLDB\u00a05(4), 334\u2013345 (2011)","journal-title":"PVLDB"},{"issue":"3","key":"17_CR6","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(92)90136-J","volume":"42","author":"K. Zhang","year":"1992","unstructured":"Zhang, K., Statman, R., Shasha, D.: On the editing distance between unordered labeled trees. Information Processing Letters\u00a042(3), 133\u2013139 (1992)","journal-title":"Information Processing Letters"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-3-642-40104-6_37","volume-title":"Algorithms and Data Structures","author":"J. Baumbach","year":"2013","unstructured":"Baumbach, J., Guo, J., Ibragimov, R.: Neighborhood-preserving mapping between trees. In: Dehne, F., Solis-Oba, R., Sack, J.-R. (eds.) WADS 2013. LNCS, vol.\u00a08037, pp. 427\u2013438. Springer, Heidelberg (2013)"},{"key":"17_CR8","volume-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, San Francisco (1979)"},{"key":"17_CR9","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley Longman Publishing Co., Inc. (1974)"},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-642-22685-4_31","volume-title":"Computing and Combinatorics","author":"Q. Feng","year":"2011","unstructured":"Feng, Q., Wang, J., Chen, J.: Matching and P\n                2-Packing: Weighted Versions. In: Fu, B., Du, D.-Z. (eds.) COCOON 2011. LNCS, vol.\u00a06842, pp. 343\u2013353. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07566-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T02:06:34Z","timestamp":1558922794000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07566-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319075655","9783319075662"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07566-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}