메뉴 건너뛰기




Volumn 2005, Issue , 2005, Pages 163-172

Accurate and efficient HTML differencing

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES; ELECTRONIC DOCUMENT EXCHANGE; FILE EDITORS; PROBLEM SOLVING; TEXT PROCESSING; WEBSITES;

EID: 33947629701     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/STEP.2005.7     Document Type: Conference Paper
Times cited : (8)

References (24)
  • 5
    • 33947679515 scopus 로고    scopus 로고
    • A comparative study for XML change detection
    • Technical Report, INRIA, France
    • G. Cobena, T. Abdessalem and Y. Hinnach, "A comparative study for XML change detection" Technical Report, INRIA, France, 2000.
    • (2000)
    • Cobena, G.1    Abdessalem, T.2    Hinnach, Y.3
  • 6
    • 0041387617 scopus 로고    scopus 로고
    • RNA Secondary structure comparison: Exact analysis of the Zhang-Shasha tree edit algorithm
    • September
    • S. Dulucq, and L. Tichit, "RNA Secondary structure comparison: exact analysis of the Zhang-Shasha tree edit algorithm", Theoretical Computer Science, Volume 306, Issue 13: 471 - 484, September 2003.
    • (2003) Theoretical Computer Science , vol.306 , Issue.13 , pp. 471-484
    • Dulucq, S.1    Tichit, L.2
  • 9
    • 0029309548 scopus 로고
    • Alignment of trees - an alternative to tree edit
    • July
    • T. Jiang, L. Wang, and K. Zhang, "Alignment of trees - an alternative to tree edit", Theoretical Computer Science, 143(1): 137-148, July 1995.
    • (1995) Theoretical Computer Science , vol.143 , Issue.1 , pp. 137-148
    • Jiang, T.1    Wang, L.2    Zhang, K.3
  • 11
    • 14344251246 scopus 로고    scopus 로고
    • TreeJuxtaposer: Scalable Tree Comparison using Focus+Context with Guaranteed Visibility. SIGGRAPH 2003, published as
    • T. Munzner, F. Guimbretiere, S. Tasiran, L. Zhang, and Y. Zhou. "TreeJuxtaposer: Scalable Tree Comparison using Focus+Context with Guaranteed Visibility". SIGGRAPH 2003, published as ACM Transactions on Graphics 22(3), pages 453-462
    • ACM Transactions on Graphics , vol.22 , Issue.3 , pp. 453-462
    • Munzner, T.1    Guimbretiere, F.2    Tasiran, S.3    Zhang, L.4    Zhou, Y.5
  • 13
    • 4644340823 scopus 로고    scopus 로고
    • D. Reis, P. Golgher, A. Silva, and A. Laender, Automatic web news extraction using tree edit distance, In Proceedings of the 13th International Conference on the World Wide Web, pages 502-511, New York, NY, 2004.
    • D. Reis, P. Golgher, A. Silva, and A. Laender, "Automatic web news extraction using tree edit distance", In Proceedings of the 13th International Conference on the World Wide Web, pages 502-511, New York, NY, 2004.
  • 14
  • 15
    • 0000904385 scopus 로고
    • Linear trees and RNA secondary structures
    • W. Schmitt and M. Waterman, "Linear trees and RNA secondary structures", In Discrete Applied Mathematics 51, pages 317-323, 1994.
    • (1994) Discrete Applied Mathematics , vol.51 , pp. 317-323
    • Schmitt, W.1    Waterman, M.2
  • 16
    • 0001122858 scopus 로고
    • The tree-to-tree editing problem
    • Dec
    • S. Selkow, "The tree-to-tree editing problem", Information Processing Letters, 6:184-186, Dec. 1977.
    • (1977) Information Processing Letters , vol.6 , pp. 184-186
    • Selkow, S.1
  • 17
    • 0024061490 scopus 로고
    • An algorihtm for computing multiple RNA secondary structures
    • B. Shaprio, "An algorihtm for computing multiple RNA secondary structures" In Comput. Appl. Biosci., pages 387-393, 1988.
    • (1988) Comput. Appl. Biosci , pp. 387-393
    • Shaprio, B.1
  • 18
    • 0025187499 scopus 로고
    • Comparing multiple RNA secondary structures using tree comparisons
    • B. Shaprio and K. Zhang, "Comparing multiple RNA secondary structures using tree comparisons", In Comput. Appl. Biosci. 6(4), pages 309-318, 1990.
    • (1990) Comput. Appl. Biosci , vol.6 , Issue.4 , pp. 309-318
    • Shaprio, B.1    Zhang, K.2
  • 19
    • 0018491659 scopus 로고
    • The tree-to-tree correction problem
    • July
    • K.-C. Tai, "The tree-to-tree correction problem", Journal of the ACM(JACM), 26(3):422-433, July 1979.
    • (1979) Journal of the ACM(JACM) , vol.26 , Issue.3 , pp. 422-433
    • Tai, K.-C.1
  • 20
    • 35248894417 scopus 로고    scopus 로고
    • L. Wang and D. Gusfield, Improved approximation algorithms for tree alignment, Proceedings of 7th Symp. on Combinatorial Pattern Matching, pages 220 - 33, 1996.
    • L. Wang and D. Gusfield, "Improved approximation algorithms for tree alignment", Proceedings of 7th Symp. on Combinatorial Pattern Matching, pages 220 - 33, 1996.
  • 23
    • 0024889169 scopus 로고
    • Simple fast algorithm for the editing distance between trees and related problems
    • K. Zhang, R. Stgatman, and D. Shasha, "Simple fast algorithm for the editing distance between trees and related problems", SIAM Journal on Computing, 18(6):1245-1262, 1989.
    • (1989) SIAM Journal on Computing , vol.18 , Issue.6 , pp. 1245-1262
    • Zhang, K.1    Stgatman, R.2    Shasha, D.3
  • 24
    • 0003193164 scopus 로고
    • Approximate tree matching in the presence of variable length don't cares
    • K. Zhang, D. Shasha, and J. T. L. Wang. "Approximate tree matching in the presence of variable length don't cares", Journal of Algorithms, 16(1):33-66, 1994.
    • (1994) Journal of Algorithms , vol.16 , Issue.1 , pp. 33-66
    • Zhang, K.1    Shasha, D.2    Wang, J.T.L.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.