Correctors for XML data

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3186, Issue , 2004, Pages 97-111

  Boobna, Utsav ^a   De Rougemont, Michel ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

^b UNIVERSITÉ PANTHÉON ASSAS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

LINEAR TIME; REGULAR TREE; TEST DATA; TREE AUTOMATA; TREE EDIT DISTANCE; XML DATA; XML FILES;

XML;

EID: 35048821930     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30081-6_8     Document Type: Article

References (15)

1. N. Alon, M. Krivelevich, I. Newman, and M. Szegedy. Regular languages are testable with a constant number of queries. IEEE Symposium on Foundations of Computer Science, 1999.
2. A. Apostolico and Z. Galil. Pattern matching algorithms, chapter 14: Approximate tree Pattern matching. Oxford University Press, 1997.
3. M. Blum and S. Kannan. Designing programs that test their work. ACM Symposium on Theory of Computing, pages 86-97, 1989.
4. M. Blum, M. Luby, and R. Rubinfeld. Self-testing/correcting with applications to numerical problems. ACM Symposium on Theory of Computing, pages 73-83, 1990.
5. S. Chawathe, A. Rajaraman, H. Garcia-Molina, and J . Widom. Change detection in hierarchically structured information. In Proceedings of the A CM SIGMOD, pages 493-504, 1996.
6. G. Cormode. Sequence distance embeddings. Ph.D. thesis, University of Warwick, 2003.
7. M. de Rougemont. A corrector for XML. ISIP: Franco-Japanese Workshop on Information Search, Integration and Personalization, Hokkaido University, http://ca.meme.hokudai.ac.jp/project/fj2003/, 2003.
8. O. Goldreich, S. Goldwasser, and D. Ron. Property testing and its connection to learning and approximation. In IEEE Symposium on Foundations of Computer Science, pages 339-348, 1996.
9. F. Magniez and M. Rougemont. Property testing of regular tree languages. ICALP, 2004.
10. A. Nierman and H. V. Jagadish. Evaluating structural similarity in XML documents. In Proceedings of the fifth International Workshop on the Web and Databases, pages 61-66, 2002.
11. R. Rubinfeld and M. Sudan. Robust characterizations of polynomials with applications to program testing. SIAM Journal on Computing, 25:23-32, 1996.
12. K. C. Tai. The tree-to-tree correction Problem. Journal of the Association for Computing Machinery, 26: 422-433, 1979.
13. Tidy. HTML Tidy Library Project, http://tidy.sourceforge.net. 2000.
14. R. Wagner and M. Fisher. The string-to-string correction Problem. Journal of the Association for Computing Machinery, 21:168-173, 1974.
15. S. Wu, U. Manber, and E. Myers. A subquadratic algorithm for approximate regular expression matching. Journal of algorithms, 19:346-360, 1995.