{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:47:09Z","timestamp":1725490029681},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540735441"},{"type":"electronic","value":"9783540735458"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73545-8_47","type":"book-chapter","created":{"date-parts":[[2007,8,17]],"date-time":"2007-08-17T09:44:11Z","timestamp":1187343851000},"page":"482-492","source":"Crossref","is-referenced-by-count":1,"title":["An Improved Algorithm for Tree Edit Distance Incorporating Structural Linearity"],"prefix":"10.1007","author":[{"given":"Shihyen","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaizhong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"47_CR1","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1006\/jagm.2001.1170","volume":"40","author":"W. Chen","year":"2001","unstructured":"Chen, W.: New algorithm for ordered tree-to-tree correction problem. Journal of Algorithms\u00a040(2), 135\u2013158 (2001)","journal-title":"Journal of Algorithms"},{"key":"47_CR2","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Mozes, S., Rossman, B., Weimann, O.: An optimal decomposition algorithm for tree edit distance. In: Proceedings of the 34th International Colloquium on Automata, Languages and Programming (To appear)","DOI":"10.1007\/978-3-540-73420-8_15"},{"key":"47_CR3","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1016\/j.jda.2004.08.018","volume":"3","author":"S. Dulucq","year":"2005","unstructured":"Dulucq, S., Touzet, H.: Decomposition algorithms for the tree edit distance problem. Journal of Discrete Algorithms\u00a03, 448\u2013471 (2005)","journal-title":"Journal of Discrete Algorithms"},{"key":"47_CR4","doi-asserted-by":"crossref","unstructured":"Klein, P.N.: Computing the edit-distance between unrooted ordered trees. In: Proceedings of the 6th European Symposium on Algorithms(ESA), pp. 91\u2013102 (1998)","DOI":"10.1007\/3-540-68530-8_8"},{"key":"47_CR5","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1146\/annurev.biochem.68.1.287","volume":"68","author":"P.B. Moore","year":"1999","unstructured":"Moore, P.B.: Structural motifs in RNA. Annual review of biochemistry\u00a068, 287\u2013300 (1999)","journal-title":"Annual review of biochemistry"},{"key":"47_CR6","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/0022-0000(83)90006-5","volume":"26","author":"D.D. Sleator","year":"1983","unstructured":"Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. Journal of Computer and System Sciences\u00a026, 362\u2013391 (1983)","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"47_CR7","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/322139.322143","volume":"26","author":"K. Tai","year":"1979","unstructured":"Tai, K.: The tree-to-tree correction problem. Journal of the Association for Computing Machinery (JACM)\u00a026(3), 422\u2013433 (1979)","journal-title":"Journal of the Association for Computing Machinery (JACM)"},{"key":"47_CR8","unstructured":"Genomic tRNA Database, \n                  \n                    http:\/\/lowelab.ucsc.edu\/gtrnadb\/"},{"issue":"1","key":"47_CR9","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"R.A. Wagner","year":"1974","unstructured":"Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. Journal of the ACM\u00a021(1), 168\u2013173 (1974)","journal-title":"Journal of the ACM"},{"issue":"6","key":"47_CR10","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 Journal on Computing\u00a018(6), 1245\u20131262 (1989)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73545-8_47.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:18:00Z","timestamp":1619504280000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73545-8_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540735441","9783540735458"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73545-8_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}