Text Indexing and Dictionary Matching with One Error

Journal of Algorithms

Volumn 37, Issue 2, 2000, Pages 309-325

  Amir, Amihood ^a   Keselman, Dmitry ^b   Landau, Gad M ^c,d   Lewenstein, Moshe ^a   Lewenstein, Noa ^a   Rodeh, Michael ^e  

^a BAR ILAN UNIVERSITY   (Israel)

^b Simons Technologies Inc   (United States)

^c POLYTECHNIC UNIVERSITY   (United States)

^d UNIVERSITY OF HAIFA   (Israel)

^e IBM HAIFA RESEARCH LAB   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346109265     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.2000.1104     Document Type: Article

References (28)

1. A. V. Aho and M. J. Corasick, Efficient string matching, Comm. Assoc. Comput. Mach. 18, No. 6 (1975), 333-340.
2. A. Amir and M. Farach, Adaptive dictionary matching, in "Proc. 32nd IEEE FOCS," pp. 760-766, 1991.
3. A. Amir, M. Farach, R. Giancarlo, Z. Galil, and K. Park, Dynamic dictionary matching, J. Comput. System Sci. 49 (1994), 208-222.
4. A. Amir, M. Farach, R. M. Idury, J. A. La Poutré, and A. A. Schäffer, Improved dynamic dictionary matching, Inform. and Comput. 119 (1995), 258-282.
5. A. Amir, D. Keselman, G. M. Landau, N. Lewenstein, M. Lewenstein, and M. Rodeh, Indexing and dictionary matching with one error, in "Proc. 1999 Workshop on Algorithms and Data Structures (WADS)," pp. 181-192, 1999.
6. A. Apostolico and Z. Galil (Eds.), "Pattern Matching Algorithms," Oxford University Press, Oxford, 1997.
7. R. S. Boyer and J. S. Moore, A fast string searching algorithm, Comm. Assoc. Comput. Mach. 20 (1977), 762-772.
8. G. S. Brodal and L. Gasieniec, Approximate dictionary queries, in "Proc. 7th Annual Symposium on Combinatorial Pattern Matching (CPM 96)," pp. 65-74, Lecture Notes in Computer Science, Vol. 1075, Springer-Verlag, Berlin/New York, 1996.
9. M. T. Chen and J. Seiferas, Efficient and elegant subword tree construction, in "Combinatorial Algorithms on Words" (A. Apostolico and Z. Gaili, Eds.), Vol. 12, Chap. 12, pp. 97-107, NATO ASI Series F: Computer and System Sciences, Springer-Verlag, Berlin, 1985.
10. M. Crochemore and W. Rytter, "Text Algorithms," Oxford University Press, Oxford, 1994.
11. M. Farach, Optimal suffix tree construction with large alphabets, in "Proc. 38th IEEE Symposium on Foundations of Computer Science," pp. 137-143, 1997.
12. P. Ferragina and R. Grossi, Fast incremental text editing, in "Proc. 7th ACM-SIAM Symposium on Discrete Algorithms," pp. 531-540, 1995.
13. P. Ferragina and R. Grossi, Optimal on-line search and sublinear time update in string matching, SIAM J. Comput. 27 (1998), 713-736.
14. P. Ferragina, S. Muthukrishnan, and M. deBerg, Multi-method dispatching: a geometric approach with applications to string matching, in "Proc. 31st Annual Symposium on the Theory of Computing (STOC)," pp. 483-491, 1999.
15. M. J. Fischer and M. S. Paterson, String matching and other products, "Complexity of Computation" (R. M. Karp, Ed.), SIAM-AMS Proc. 7 (1974), 113-125.
16. M. Gu, M. Farach, and R. Beigel, An efficient algorithm for dynamic text indexing, in "Proc. 5th Annual ACM-SIAM Symposium on Discrete Algorithms," pp. 697-704, 1994.
17. D. Gusfield, G. M. Landau, and B. Schieber, An efficient algorithm for all the pairs suffix-prefix problem, Inform. Process. Lett. 41 (1992), 181-185.
18. D. Gusfield, "Algorithms on Strings, Trees, and Sequences: Computer Science and Computation Biology," Cambridge University Press, Cambridge, UK, 1997.
19. R. M. Idury and A. A. Schäffer, Dynamic dictionary matching with failure functions, in "Proc. 3rd Annual Symposium on Combinatorial Pattern Matching," pp. 273-284, 1992.
20. R. Karp, R. Miller, and A. Rosenberg, Rapid identification of repeated patterns in strings, arrays and trees, Sympos. Theory Comput. 4 (1972), 125-136.
21. R. M. Karp and M. O. Rabin, Efficient randomized pattern-matching algorithms, IBM J. Res. Dev. 31 (1987), 249-260.
22. D. E. Knuth, J. H. Morris, and V. R. Pratt, Fast pattern matching in strings, SIAM J. Comput. 6 (1977), 323-350.
23. V. I. Levenshtein, Binary codes capable of correcting, deletions, insertions and reversals, Soviet Phys. Dokl. 10 (1966), 707-710.
24. E. M. McCreight, A space-economical suffix tree construction algorithm, J. Assoc. Comput. Mach. 23 (1976), 262-272.
25. M. H. Overmars, Efficient data structures for range searching on a grid, J. Algorithms 9 (1988), 254-275.
26. S. C. Sahinalp and U. Vishkin, Efficient approximate and dynamic matching of patterns using a labeling paradigm, in "Proc. 37th FOCS," pp. 320-328, 1996.
27. P. Weiner, Linear pattern matching algorithm, in "Proc. 14th IEEE Symposium on Switching and Automata Theory," pp. 1-11, 1973.
28. A. C.-C. Yao and F. F. Yao, Dictionary lookup with one error, J. Algorithms 25 (1997), 194-202.