{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T20:21:39Z","timestamp":1725740499058},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642401039"},{"type":"electronic","value":"9783642401046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40104-6_37","type":"book-chapter","created":{"date-parts":[[2013,7,11]],"date-time":"2013-07-11T05:36:30Z","timestamp":1373520990000},"page":"427-438","source":"Crossref","is-referenced-by-count":1,"title":["Neighborhood-Preserving Mapping between 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":[{"key":"37_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\u201317 (2009)","journal-title":"Computer Science Review"},{"key":"37_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, 1057\u20131067 (2011)","journal-title":"Pattern Recognition"},{"key":"37_CR3","doi-asserted-by":"publisher","first-page":"950","DOI":"10.1016\/j.imavis.2008.04.004","volume":"27","author":"K. Riesen","year":"2009","unstructured":"Riesen, K., Bunke, H.: Approximate graph edit distance computation by means of bipartite graph matching. Image and Vision Computing\u00a027, 950\u2013959 (2009)","journal-title":"Image and Vision Computing"},{"key":"37_CR4","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.tcs.2012.11.017","volume":"470","author":"T. Akutsu","year":"2013","unstructured":"Akutsu, T., Fukagawa, D., Halld\u00f3rsson, M.M., Takasu, A., Tanaka, K.: Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees. Theor. Comput. Sci.\u00a0470, 10\u201322 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"37_CR5","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1016\/j.tcs.2010.10.002","volume":"412","author":"T. Akutsu","year":"2011","unstructured":"Akutsu, T., Fukagawa, D., Takasu, A., Tamura, T.: Exact algorithms for computing the tree edit distance between unordered trees. Theor. Comput. Sci.\u00a0412, 352\u2013364 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"37_CR6","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. Theor. Comput. Sci.\u00a0337, 217\u2013239 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"37_CR7","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1109\/TCBB.2008.59","volume":"5","author":"A. Lozano","year":"2008","unstructured":"Lozano, A., Pinter, R.Y., Rokhlenko, O., Valiente, G., Ziv-Ukelson, M.: Seeded tree alignment. IEEE\/ACM Transactions on Computational Biology and Bioinformatics\u00a05, 503\u2013513 (2008)","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"37_CR8","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman (1979)"},{"key":"37_CR9","volume-title":"The Design and Analysis of Computer Algorithms","author":"A.V. Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms, 1st edn. Addison-Wesley Longman Publishing Co., Inc., Boston (1974)","edition":"1"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40104-6_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,28]],"date-time":"2019-01-28T07:29:48Z","timestamp":1548660588000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40104-6_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401039","9783642401046"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40104-6_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}