Pattern matching in hypertext

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

Volumn 1272, Issue , 1997, Pages 160-173

  Amir, Amihood ^a   Lewenstein, Moshe ^a   Lewenstein, Noa ^a  

^a BAR ILAN UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; ERRORS; GRAPH ALGORITHMS; HAMMING DISTANCE; PATTERN MATCHING; POLYNOMIAL APPROXIMATION;

APPROXIMATE PATTERN MATCHING; EDIT DISTANCE; NON-TRIVIAL; NONLINEAR STRUCTURE; NP COMPLETE; POLYNOMIAL-TIME; SIMPLER ALGORITHMS; SPECIAL STRUCTURE;

HYPERTEXT SYSTEMS;

EID: 84869101539     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63307-3_56     Document Type: Conference Paper

References (16)

1. K. Abrahamson. Generalized String Matching. SIAM J. Computing 16 (6), 1039-1051, 1987.
2. T. Akutsu. A Linear Time Pattern Matching Algorithm Between a String and a Tree. Proceedings of the 4th Symposium on Combinatorial Pattern Matching, 1-10, Padova, Italy, 1993.
3. A. Amir, M. Farach, R. Giancarlo, Z. Galil, and K. Park. Dynamic dictionary matching. Journal of Computer and System Sciences, 49(2):208-222, 1994.
4. A. Amir, M. Farach, R.M. Idury, J.A. La Poutré, and A.A Schaffer. Improved dynamic dictionary matching. Information and Computation, 119(2):258-282, 1995.
5. A. Aviad. Hyper Talmud: a hypertext system for the Babylonian Talmud and its commentaries. Dept, of Math and Computer Science, Bar-Ilan University, 1993.
6. R.S. Boyer and J.S. Moore. A fast string searching algorithm. Comm. ACM, 20:762-772, 1977.
7. T.H. Cormen, C.E. Leiserson and R.L. Rivest. Introduction to Algorithms The MIT Press, Cambridge, Massachusetts, 1990.
8. P. Ferragina and R. Grossi. Optimal on-line search and sublinear time update in string matching. Proc. 7th ACM-SIAM Symposium on Discrete Algorithms, pages 531-540, 1995.
9. A. S. Fraenkel and S. T. Klein. Information Retrieval from Annotated Texts. TR-95-25, Dept, of Applied Math and Computer Science, The Weizmann Institute of Science, 1995.
10. D.E. Knuth, J.H. Morris, and V.R. Pratt. Fast pattern matching in strings. SIAM J. Computing, 6:323-350, 1977.
11. D.K. Kim and K. Park. String matching in hypertext. 6th Symposium on Combinatorial Pattern Matching, Helsinki, Finland, 1995.
12. S. Rao Kosaraju. Efficient String Matching. Manuscript, 1987.
13. G. M. Landau and U. Vishkin. Fast parallel and serial approximate string matching. Journal of Algorithms 10 (2), 157-169, 1989.
14. U. Manber and S. Wu. Approximate string matching with arbitrary costs for text and hypertext. IAPR Workshop on structural and syntactic pattern recognition, Bern, Switzerland, 1992.
15. J. Nielsen. Hypertext and Hypermedia. Academic Press Professional, Boston, 1993.
16. S. C. Sahinalp and U. Vishkin. Efficient approximate and dynamic matching of patterns using a labeling paradigm. Proc. of 37th Annual Symposium on Foundations of Computer Science, 320-328, Burlington, Vermont, 1996.