{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T23:52:44Z","timestamp":1673308364203},"reference-count":22,"publisher":"Elsevier BV","issue":"3-4","license":[{"start":{"date-parts":[[1999,12,1]],"date-time":"1999-12-01T00:00:00Z","timestamp":944006400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[1999,12]]},"DOI":"10.1016\/s0020-0255(99)00100-0","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:32:24Z","timestamp":1049722344000},"page":"367-386","source":"Crossref","is-referenced-by-count":8,"title":["Identifying approximately common substructures in trees based on a restricted edit distance"],"prefix":"10.1016","volume":"121","author":[{"given":"Jason T.L.","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaizhong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chia-Yo","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0255(99)00100-0_BIB1","unstructured":"A.V. Aho, R. Sethi, J.D. Ullman, Compilers: Principles, Techniques, and Tools, Addison-Wesley, Reading, MA, 1986"},{"key":"10.1016\/S0020-0255(99)00100-0_BIB2","doi-asserted-by":"crossref","unstructured":"G.J.S. Chang, G. Patel, L. Relihan, J.T.L. Wang, A graphical environment for change detection in structured documents, in: Proceedings of the 21st Annual International Computer Software and Application Conference, Washington DC, August 1997, pp. 536\u2013541","DOI":"10.1109\/CMPSAC.1997.625064"},{"key":"10.1016\/S0020-0255(99)00100-0_BIB3","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1109\/TPAMI.1985.4767658","article-title":"Waveform correlation by tree matching","volume":"7","author":"Cheng","year":"1985","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"issue":"1","key":"10.1016\/S0020-0255(99)00100-0_BIB4","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1145\/129617.129623","article-title":"Practical minimal perfect hash functions for large databases","volume":"35","author":"Fox","year":"1992","journal-title":"Commun. ACM"},{"key":"10.1016\/S0020-0255(99)00100-0_BIB5","doi-asserted-by":"crossref","unstructured":"R. Grishman, Computational Linguistics, Cambridge University Press, New York, 1986","DOI":"10.1017\/CBO9780511611797"},{"key":"10.1016\/S0020-0255(99)00100-0_BIB6","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/S0166-218X(96)00062-5","article-title":"On the complexity of comparing evolutionary trees","volume":"71","author":"Hein","year":"1996","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0020-0255(99)00100-0_BIB7","doi-asserted-by":"crossref","unstructured":"T. Jiang, L. Wang, K. Zhang, Alignment of trees \u2013 an alternative to tree edit, in: M. Crochemore, D. Gusfield (Eds.), Combinatorial Pattern Matching, Lecture Notes in Computer Science, vol. 807, Springer, Berlin, 1994, pp. 75\u201386","DOI":"10.1007\/3-540-58094-8_7"},{"key":"10.1016\/S0020-0255(99)00100-0_BIB8","doi-asserted-by":"crossref","unstructured":"D. Keselman, A. Amir, Maximum agreement subtree in a set of evolutionary trees \u2013 metrics and efficient algorithms, in: Proceedings of the 35th IEEE Annual Symposium on Foundations of Computer Science, Santa Fe, NM, 1994, pp. 758\u2013769","DOI":"10.1109\/SFCS.1994.365717"},{"key":"10.1016\/S0020-0255(99)00100-0_BIB9","unstructured":"A.S. Noetzel, S.M. Selkow, An analysis of the general tree-editing problem, in: D. Sankoff, J. B. Kruskal (Eds.), Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison, Addison-Wesley, Reading, MA, 1983, pp. 237\u2013252"},{"issue":"10","key":"10.1016\/S0020-0255(99)00100-0_BIB10","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1109\/2.539720","article-title":"Advances in software engineering","volume":"29","author":"Ramamoorthy","year":"1996","journal-title":"IEEE Comput."},{"issue":"6","key":"10.1016\/S0020-0255(99)00100-0_BIB11","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/0020-0190(77)90064-3","article-title":"The tree-to-tree editing problem","volume":"6","author":"Selkow","year":"1977","journal-title":"Inform. Process. Lett."},{"issue":"1","key":"10.1016\/S0020-0255(99)00100-0_BIB12","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0022-2836(81)90087-5","article-title":"Identification of common molecular subsequences","volume":"147","author":"Smith","year":"1981","journal-title":"J. Mol. Biol."},{"issue":"3","key":"10.1016\/S0020-0255(99)00100-0_BIB13","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/322139.322143","article-title":"The tree-to-tree correction problem","volume":"26","author":"Tai","year":"1979","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/S0020-0255(99)00100-0_BIB14","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1142\/S0218001488000157","article-title":"The tree-to-tree editing problem","volume":"2","author":"Tanaka","year":"1988","journal-title":"Int. J. Pattern Recog. Artificial Intell."},{"key":"10.1016\/S0020-0255(99)00100-0_BIB15","doi-asserted-by":"crossref","unstructured":"J.T.L. Wang, G.-W. Chirn, C.-Y. Chang, G. Chang, A. Noriega, K. Pysniak, An integrated toolkit for pattern matching and pattern discovery in scientific, program and document databases, in: Proceedings of the 7th International Conference on Software Engineering and Knowledge Engineering, Rockville, MD, June 1995, p. 497","DOI":"10.1145\/223784.223900"},{"key":"10.1016\/S0020-0255(99)00100-0_BIB16","doi-asserted-by":"crossref","unstructured":"J.T.L. Wang, D. Shasha, G.J.S. Chang, L. Relihan, K. Zhang, G. Patel, Structural matching and discovery in document databases, in: Proceedings of the 1997 ACM SIGMOD International Conference on Management of Data, Tucson, AZ, May 1997, pp. 560\u2013563","DOI":"10.1145\/253260.253406"},{"issue":"4","key":"10.1016\/S0020-0255(99)00100-0_BIB17","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1109\/69.298173","article-title":"A system for approximate tree matching","volume":"6","author":"Wang","year":"1994","journal-title":"IEEE Trans. Knowledge and Data Eng."},{"key":"10.1016\/S0020-0255(99)00100-0_BIB18","doi-asserted-by":"crossref","unstructured":"J.T.L. Wang, K. Zhang, D. Shasha, Pattern matching and pattern discovery in scientific, program, and document databases, in: Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, San Jose, CA, May 1995, p. 487","DOI":"10.1145\/223784.223900"},{"issue":"7","key":"10.1016\/S0020-0255(99)00100-0_BIB19","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1002\/spe.4380210706","article-title":"Identifying syntactic differences between two programs","volume":"21","author":"Yang","year":"1991","journal-title":"Software \u2013 Practice and Experience"},{"issue":"3","key":"10.1016\/S0020-0255(99)00100-0_BIB20","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1016\/0031-3203(94)00109-Y","article-title":"Algorithms for the constrained editing distance between ordered labeled trees and related problems","volume":"28","author":"Zhang","year":"1995","journal-title":"Pattern Recog."},{"issue":"6","key":"10.1016\/S0020-0255(99)00100-0_BIB21","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1137\/0218082","article-title":"Simple fast algorithms for the editing distance between trees and related problems","volume":"18","author":"Zhang","year":"1989","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/S0020-0255(99)00100-0_BIB22","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1006\/jagm.1994.1003","article-title":"Approximate tree matching in the presence of variable length don't cares","volume":"16","author":"Zhang","year":"1994","journal-title":"J. Algorithms"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025599001000?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025599001000?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,14]],"date-time":"2020-01-14T15:35:53Z","timestamp":1579016153000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025599001000"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,12]]},"references-count":22,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[1999,12]]}},"alternative-id":["S0020025599001000"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0255(99)00100-0","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[1999,12]]}}}