{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:53:54Z","timestamp":1750308834619,"version":"3.41.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319601335"},{"type":"electronic","value":"9783319601342"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-60134-2_11","type":"book-chapter","created":{"date-parts":[[2017,5,27]],"date-time":"2017-05-27T12:53:09Z","timestamp":1495889589000},"page":"126-137","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Alignment Distance of Regular Tree Languages"],"prefix":"10.1007","author":[{"given":"Yo-Sub","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sang-Ki","family":"Ko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,28]]},"reference":[{"issue":"3","key":"11_CR1","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. J. ACM 45(3), 501\u2013555 (1998)","journal-title":"J. ACM"},{"issue":"10","key":"11_CR2","doi-asserted-by":"publisher","first-page":"1191","DOI":"10.1080\/00207160412331336053","volume":"82","author":"ER Canfield","year":"2005","unstructured":"Canfield, E.R., Xing, G.: Approximate matching of XML document with regular hedge grammar. Int. J. Comput. Math. 82(10), 1191\u20131198 (2005)","journal-title":"Int. J. Comput. Math."},{"key":"11_CR3","unstructured":"Comon, H., Dauchet, M., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications (2007)"},{"issue":"1","key":"11_CR4","doi-asserted-by":"publisher","first-page":"2:1","DOI":"10.1145\/1644015.1644017","volume":"6","author":"ED Demaine","year":"2009","unstructured":"Demaine, E.D., Mozes, S., Rossman, B., Weimann, O.: An optimal decomposition algorithm for tree edit distance. ACM Trans. Algorithms 6(1), 2:1\u20132:19 (2009)","journal-title":"ACM Trans. Algorithms"},{"issue":"3","key":"11_CR5","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"ML Fredman","year":"1987","unstructured":"Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34(3), 596\u2013615 (1987)","journal-title":"J. ACM"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"H\u00f6chsmann, M., T\u00f6ller, T., Giegerich, R., Kurtz, S.: Local similarity in RNA secondary structures. In: Proceedings of the 2nd IEEE Computer Society Conference on Bioinformatics, pp. 159\u2013168 (2003)","DOI":"10.1109\/CSB.2003.1227315"},{"issue":"1","key":"11_CR7","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0304-3975(95)80029-9","volume":"143","author":"T Jiang","year":"1995","unstructured":"Jiang, T., Wang, L., Zhang, K.: Alignment of trees \u2013 an alternative to tree edit. Theoret. Comput. Sci. 143(1), 137\u2013148 (1995)","journal-title":"Theoret. Comput. Sci."},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Klein, P.N.: Computing the edit-distance between unrooted ordered trees. In: Proceedings of the 6th Annual European Symposium on Algorithms, pp. 91\u2013102 (1998)","DOI":"10.1007\/3-540-68530-8_8"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Kuboyama, T., Shin, K., Miyahara, T., Yasuda, H.: A theoretical analysis of alignment and edit problems for trees. In: Proceedings of the 9th Italian Conference on Theoretical Computer Science, pp. 323\u2013337 (2005)","DOI":"10.1007\/11560586_26"},{"issue":"8","key":"11_CR10","first-page":"707","volume":"10","author":"VI Levenshtein","year":"1966","unstructured":"Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions, and reversals. Sov. Phys. Dokl. 10(8), 707\u2013710 (1966)","journal-title":"Sov. Phys. Dokl."},{"issue":"1\u20133","key":"11_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0167-8655(01)00095-2","volume":"23","author":"D L\u00f3pez","year":"2002","unstructured":"L\u00f3pez, D., Espa\u00f1a, S.: Error-correcting tree language inference. Pattern Recogn. Lett. 23(1\u20133), 1\u201312 (2002)","journal-title":"Pattern Recogn. Lett."},{"issue":"03","key":"11_CR12","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1142\/S0218001400000234","volume":"14","author":"D L\u00f3pez","year":"2000","unstructured":"L\u00f3pez, D., Sempere, J.M., Garc\u00eda, P.: Error correcting analysis for tree languages. Int. J. Pattern Recogn. Artif. Intell. 14(03), 357\u2013368 (2000)","journal-title":"Int. J. Pattern Recogn. Artif. Intell."},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Lu, C.L., Su, Z.-Y., Tang, C.Y.: A new measure of edit distance between labeled trees. In: Proceedings of the 7th Annual International Conference on Computing and Combinatorics, pp. 338\u2013348 (2001)","DOI":"10.1007\/3-540-44679-6_37"},{"key":"11_CR14","unstructured":"Nierman, A., Jagadish, H.V.: Evaluating structural similarity in XML documents. In: Proceedings of the 5th International Workshop on the Web and Databases, pp. 61\u201366 (2002)"},{"issue":"3","key":"11_CR15","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/322139.322143","volume":"26","author":"K-C Tai","year":"1979","unstructured":"Tai, K.-C.: The tree-to-tree correction problem. J. ACM 26(3), 422\u2013433 (1979)","journal-title":"J. ACM"},{"issue":"1","key":"11_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1741-7007-4-5","volume":"4","author":"B Vo\u00df","year":"2006","unstructured":"Vo\u00df, B., Giegerich, R., Rehmsmeier, M.: Complete probabilistic analysis of RNA shapes. BMC Biol. 4(1), 1\u201323 (2006)","journal-title":"BMC Biol."},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Xing, G.: Approximate matching of XML documents with schemata using tree alignment. In: Proceedings of the 2014 ACM Southeast Regional Conference, pp. 43:1\u201343:4 (2014)","DOI":"10.1145\/2638404.2638517"},{"issue":"3","key":"11_CR18","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 15(3), 205\u2013222 (1996)","journal-title":"Algorithmica"},{"issue":"5","key":"11_CR19","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0020-0190(94)90062-0","volume":"49","author":"K Zhang","year":"1994","unstructured":"Zhang, K., Jiang, T.: Some MAX SNP-hard results concerning unordered labeled trees. Inf. Process. Lett. 49(5), 249\u2013254 (1994)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"11_CR20","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. Inf. Process. Lett. 42(3), 133\u2013139 (1992)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-60134-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:40:27Z","timestamp":1750279227000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-60134-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319601335","9783319601342"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-60134-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"28 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Implementation and Application of Automata","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Marne-la-Vall\u00e9e","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 June 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wia2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ciaa17.univ-mlv.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}