Dynamic text and static pattern matching

ACM Transactions on Algorithms

Volumn 3, Issue 2, 2007, Pages

  Amir, Amihood ^a   Landau, Gad M ^b,d   Lewenstein, Moshe ^a   Sokol, Dina ^c  

^a BAR ILAN UNIVERSITY   (Israel)

^b UNIVERSITY OF HAIFA   (Israel)

^c CITY UNIVERSITY OF NEW YORK   (United States)

^d POLYTECHNIC UNIVERSITY   (United States)

Author keywords

Border trees; Dynamic text; Static pattern

Indexed keywords

BORDER TREES; DYNAMIC TEXTS; STATIC PATTERNS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; TEXT PROCESSING; TREES (MATHEMATICS);

PATTERN MATCHING;

EID: 34250180198     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1240233.1240242     Document Type: Article

References (28)

1. ALON, N., AND NAOR, M. 1996. Derandomization, witnesses for boolean matrix multiplication and construction of perfect hash functions. Algorithmica 16, 4-5, 434-449.
2. ALSTRUP, S., BRODAL, G. S., AND RAUHE, T. 2000. Pattern matching in dynamic texts. In Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM, 819-828.
3. BEAME, P., AND FICH, F. E. 2002. Optimal bounds for the predecessor problem and related problems. J. Comput. Syst. Sci. 65, 1, 38-72.
4. BERKMAN, O., AND VISHKIN, U. 1994. Finding level-ancestors in trees. J. Comput. Syst. Sci. 48, 2, 214-229.
5. BUCHSBAUM, A. L. 2006. Personal communication.
6. BUCHSBAUM, A. L., GOODRICH, M. T., AND WESTBROOK, J. 2000. Range searching over tree cross products. In Proceedings of the 8th Annual European Symposium on Algorithms (ESA). Springer Verlag, Berlin. 120-131.
7. COLE, R., AND HARIHAN, R. 1997. Tighter bounds on the exact complexity of string matching. SIAM J. Comput. 26, 3, 803-856.
8. FARACH, M. 1997. Optimal suffix tree construction with large alphabets. In Proceedings of the 38th IEEE Symposium on Foundations of Computer Science (FOCS). 137-143.
9. FARACH, M., AND MUTHUKRISHNAN, S. 1996. Perfect hashing for strings: Formalization and algorithms. In Proceedings of the 7th Symposium on Combinatorial Pattern Matching (CPM). Springer Verlag, Berlin. 130-140.
10. FERRAGINA, P., AND GROSSI, R. 1995. Fast incremental text editing. In Proceedings of the 7th ACM-SIAM Symposium on Discrete Algorithms (SODA). 531-540.
11. GABOW, H. N., BENTLEY, J. L., AND TARJAN, R. E. 1984. Scaling and related techniques for geometry problems. In Proceedings of the 16th ACM Symposium on Theory of Computing (STOC), vol. 67. 135-143.
12. GU, M., FARACH, M., AND BEIGEL, R. 1994. An efficient algorithm for dynamic text indexing. In Proceedings of the 5th ACM-SIAM Symposium on Discrete Algorithms (SODA). 697-704.
13. HAGERUP, T., MILTERSEN, P. B., AND PAGH, R. 2001. Deterministic dictionaries. J. Alg. 41, 1, 69-85.
14. HAREL, D., AND TARJAN, R. 1984. Fast algorithms for finding nearest common ancestors. SIAM J. Comput. 13, 2, 338-355.
15. KÄRKKÄINEN, J., AND SANDERS, P. 2003. Simple linear work suffix array construction. In Proceedings of the 30th International Colloquium on Automata, Languages and Programming (ICALP). Lecture Notes in Computer Science, vol. 2719. Springer Verlag, Berlin. 943-955.
16. KNUTH, D., MORRIS, J., AND PRATT, V. 1977. Fast pattern matching in strings. SIAM J. Comput. 6, 323-350.
17. LANDAU, G. M., AND VISHKIN, U. 1988. Fast string matching with k differences. J. Comput. Syst. Sci. 37, 1, 63-78.
18. LANDAU, G. M., AND VISHKIN, U. 1994. Pattern matching in a digitized image. Algorithmica 12, 4-5, 375-408.
19. LEVENSHTEIN, V. I. 1966. Binary codes capable of correcting, deletions, insertions and reversals. Soviet Phys. Dokl. 10, 707-710.
20. LOWRANCE, R., AND WAGNER, R. A. 1975. An extension of the string-to-string correction problem. J. ACM 22, 2, 177-183.
21. MCCREIGHT, E. M. 1976. A space-economical suffix tree construction algorithm. J. ACM 23, 262-272.
22. SAHINALP, S. C., AND VISHKIN, U. 1996. Efficient approximate and dynamic matching of patterns using a labeling paradigm. In Proceedings of the 37th IEEE Symposium on Foundations of Computer Science (FOCS). 320-328.
23. SCHIEBER, B., AND VISHKIN, U. 1988. On finding lowest common ancestors: Simplification and parallelization. SIAM J. Comput. 17, 6, 1253-1262.
24. SMITH, T., AND WATERMAN, M. 1981. Identification of common molecular subsequences. J. Mol. Biol. 147, 195-197.
25. UKKONEN, E. 1995. On-Line construction of suffix trees. Algorithmica 14, 249-260.
26. VAN EMDE BOAS, P. 1974. An O(n log log n) online algorithm for the insert-extract min problem. Tech. Rep. TR 74-221, Cornell University, Department of Computer Science.
27. WEINER, P. 1973. Linear pattern matching algorithm. In Proceedings of the 14th IEEE Symposium on Switching and Automata Theory. 1-11.
28. WILLARD, D. E. 1983. Log-Logarithmic worst-case range queries are possible in space Theta(n). Inf. Process. Lett. 17, 2, 81-84.