Improved approximate pattern matching on hypertext

Theoretical Computer Science

Volumn 237, Issue 1-2, 2000, Pages 455-463

  Navarro, Gonzalo ^a  

^a UNIVERSITY OF CHILE   (Chile)

Author keywords

Approximate structure matching; Graph algorithms

Indexed keywords

EID: 0344436248     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00333-3     Document Type: Article

References (15)

1. T. Akutsu, A linear time pattern matching algorithm between a string and a tree, Proc. CPM'93 1993, pp. 1-10.
2. A. Amir, M. Lewenstein, N. Lewenstein, Pattern matching in hypertext, Proc. WADS'97, Lecture Notes in Computer Science, Vol. 1272, Springer, Berlin, 1997, pp. 160-173.
3. R. Baeza-Yates, G. Navarro, A faster algorithm for approximate string matching, Proc. CPM'96, Lecture Notes in Computer Science, Vol. 1075, Springer, Berlin, 1996, pp. 1-23.
4. W. Chang, J. Lampe, Theoretical and empirical comparisons of approximate string matching algorithms, Proc. CPM'92, Lecture Notes in Computer Science, Vol. 644, Springer, Berlin, 1992, pp. 172-181.
5. J. Conklin, Hypertext: An introduction and survey, IEEE Comput. 20 (9) (1987) 17-41.
6. G. Das, R. Fleischer, L. Gasieniec, D. Gunopulos, J. Katkäinen, Episode matching. Proc. CPM'97, Lecture Notes in Computer Science, Vol. 1264, Springer, Berlin, 1997, pp. 12-27.
7. G. Landau, U. Vishkin, Fast string matching with k differences, J. Comput. Systems Sci. 37 (1988) 63-78.
8. U. Manber, S. Wu, Approximate string matching with arbitrary costs for text and hypertext, Proc. IAPR Workshop on Structural and Syntactic Pattern Recognition, Bern, Switzerland, 1992, pp. 22-33.
9. G. Myers, A fast bit-vector algorithm for approximate pattern matching based on dynamic programming, Proc. CPM'98, Lecture Notes in Computer Science, Vol. 1448, Springer, Berlin, 1998, pp. 1-13.
10. G. Navarro, Improved approximate pattern matching on hypertext, Proc. LATIN'98, Lecture Notes in Computer Science, Vol. 1380, Springer, Berlin, 1998, pp. 352-357.
11. K. Park, D. Kim, String matching in hypertext, Proc. CPM'95, 1995, pp. 318-329.
12. P. Sellers, The theory and computation of evolutionary distances: pattern recognition, J. algorithms 1 (1980) 359-372.
13. E. Ukkonen, Finding approximte patterns in strings, J. Algorithms 6 (1985) 132-137.
14. S. Wu, U. Manber, Fast text searching allowing errors, CACM 35 (0) (1992) 83-91.
15. S. Wu, U. Manber, E. Myers, A sub-quadratic algorithm for approximate limited expression matching, Algorithmica 15 (1) (1996) 50-67.