{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:21:30Z","timestamp":1759638090336,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540229698"},{"type":"electronic","value":"9783540300816"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30081-6_8","type":"book-chapter","created":{"date-parts":[[2010,9,16]],"date-time":"2010-09-16T16:24:54Z","timestamp":1284654294000},"page":"97-111","source":"Crossref","is-referenced-by-count":16,"title":["Correctors for XML Data"],"prefix":"10.1007","author":[{"given":"Utsav","family":"Boobna","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"de Rougemont","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","unstructured":"Alon, N., Krivelevich, M., Newman, I., Szegedy, M.: Regular languages are testable with a constant number of queries. In: IEEE Symposium on Foundations of Computer Science (1999)"},{"key":"8_CR2","volume-title":"Approximate tree Pattern matching","author":"A. Apostolico","year":"1997","unstructured":"Apostolico, A., Galil, Z.: Pattern matching algorithms, chapter 14. In: Approximate tree Pattern matching, Oxford University Press, Oxford (1997)"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Blum, M., Kannan, S.: Designing programs that test their work. In: ACM Symposium on Theory of Computing, pp. 86\u201397 (1989)","DOI":"10.1145\/73007.73015"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Blum, M., Luby, M., Rubinfeld, R.: Self-testing\/correcting with applications to numerical problems. In: ACM Symposium on Theory of Computing, pp. 73\u201383 (1990)","DOI":"10.1145\/100216.100225"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Chawathe, S., Rajaraman, A., Garcia-Molina, H., Widom, J.: Change detection in hierarchically structured information. In: Proceedings of the ACM SIGMOD, pp. 493\u2013504 (1996)","DOI":"10.1145\/235968.233366"},{"key":"8_CR6","unstructured":"Cormode, G.: Sequence distance embeddings. Ph.D. thesis, University of Warwick (2003)"},{"key":"8_CR7","unstructured":"de Rougemont. M.: A corrector for XML. In: ISIP: Franco-Japanese Workshop on Information Search, Integration and Personalization, Hokkaido University (2003), http:\/\/ca.meme.hokudai.ac.jp\/project\/fj2003\/"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Goldwasser, S., Ron, D.: Property testing and its connection to learning and approximation. In: IEEE Symposium on Foundations of Computer Science, pp. 339\u2013348 (1996)","DOI":"10.1109\/SFCS.1996.548493"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Magniez, F., Rougemont, M.: Property testing of regular tree languages. ICALP (2004)","DOI":"10.1007\/978-3-540-27836-8_78"},{"key":"8_CR10","unstructured":"Nierman, A., Jagadish, H.V.: Evaluating structural similarity in XML documents. In: Proceedings of the fifth International Workshop on the Web and Databases, pp. 61\u201366 (2002)"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1137\/S0097539793255151","volume":"25","author":"R. Rubinfeld","year":"1996","unstructured":"Rubinfeld, R., Sudan, M.: Robust characterizations of polynomials with applications to program testing. SIAM Journal on Computing\u00a025, 23\u201332 (1996)","journal-title":"SIAM Journal on Computing"},{"key":"8_CR12","doi-asserted-by":"crossref","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. Journal of the Association for Computing Machinery\u00a026, 422\u2013433 (1979)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"8_CR13","unstructured":"Tidy. HTML Tidy Library Project (2000), http:\/\/tidy.sourceforge.net"},{"key":"8_CR14","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"R. Wagner","year":"1974","unstructured":"Wagner, R., Fisher, M.: The string-to-string correction Problem. Journal of the Association for Computing Machinery\u00a021, 168\u2013173 (1974)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1006\/jagm.1995.1041","volume":"19","author":"S. Wu","year":"1995","unstructured":"Wu, S., Manber, U., Myers, E.: A subquadratic algorithm for approximate regular expression matching. Journal of algorithms\u00a019, 346\u2013360 (1995)","journal-title":"Journal of algorithms"}],"container-title":["Lecture Notes in Computer Science","Database and XML Technologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30081-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T21:48:56Z","timestamp":1740520136000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30081-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540229698","9783540300816"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30081-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}