Indexing and dictionary matching with one error (extended abstract)

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

Volumn 1663, Issue , 1999, Pages 181-192

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

^a BAR ILAN UNIVERSITY   (Israel)

^b Georgia Institute of Technology   (United States)

^c Simons Technologies Inc   (United States)

^d UNIVERSITY OF HAIFA   (Israel)

^e Polytechnic Uuiversity   (Israel)

^f TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; INDEXING (OF INFORMATION);

DICTIONARY MATCHING; DICTIONARY PATTERN; EXTENDED ABSTRACTS; PREPROCESS; QUERY STRING; QUERY TIME;

ABSTRACTING;

EID: 84948972034     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48447-7_19     Document Type: Conference Paper

References (25)

1. A.V. Aho and M.J. Corasick. Efficient string matching. Comm. ACM, 18(6):333-340, 1975.
2. A. Amir and M. Farach. Adaptive dictionary matching. Proc. 32nd IEEE FOCS, pages 760-766, 1991.
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. R.S. Boyer and J.S. Moore. A fast string searching algorithm. Comm. ACM, 20:762-772, 1977.
6. G. S. Brodal and L. Gasieniec. Approximate dictionary queries. In Proc. 7th Annual Symposium on Combinatorial Pattern Matching (CPM 96), pages 65-74. LNCS 1075, Springer, 1996.
7. M. T. Chen and J. Seiferas. Efficient and elegant subword tree construction. In A. Apostolico and Z. Galil, editors, Combinatorial Algorithms on Words, chapter 12, pages 97-107. NATO ASI Series F: Computer and System Sciences, 1985.
8. M. Farach. Optimal suffix tree construction with large alphabets. Proc. 38th IEEE Symposium on Foundations of Computer Science, pages 137-143, 1997.
9. 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.
10. M.J. Fischer and M.S. Paterson. String matching and other products. Complexity of Computation, R.M. Karp (editor), SIAM-AMS Proceedings, 7:113-125, 1974.
11. D. Greene, M. Parnas, and F. Yao. Multi-index hashing for information retrieval. Proc. 35th Annual Symposium on Foundations of Computer Science, pages 722-731, 1994.
12. M. Gu, M. Farach, and R. Beigel. An efficient algorithm for dynamic text indexing. Proc. 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 697-704, 1994.
13. R.M. Idury and A.A Schaffer. Dynamic dictionary matching with failure functions. Proc. 3rd Annual Symposium on Combinatorial Pattern Matching, pages 273-284, 1992.
14. R. Karp, R. Miller, and A. Rosenberg. Rapid identification of repeated patterns in strings, arrays and trees. Symposium on the Theory of Computing, 4:125-136, 1972.
15. R.M. Karp and M.O. Rabin. Efficient randomized pattern-matching algorithms. IBM Journal of Res. and Dev., pages 249-260, 1987.
16. J. M. Kleinberg. Two algorithms for nearest-neighbor searchin high dimensions. Proc. 29th ACM STOC, pages 599-608, 1997.
17. D.E. Kriuth, J.H. Morris, and V.R. Pratt. Fast pattern matching in strings. SIAM J. Computing, 6:323-350, 1977.
18. E. Kushilevitz, R. Ostrovsky, and Y. Rabani. Efficient search for approximate nearest neighbor in high dimensional spaces. Proc. 30th ACM STOC, 1998. to appear.
19. V. I. Levenshtein. Binary codes capable of correcting, deletions, insertions and reversals. Soviet Phys. Dokl., 10:707-710, 1966.
20. E. M. McCreight. A space-economical suffix tree construction algorithm. Journal of the ACM, 23:262-272, 1976.
21. M. Minsky and S. Papert. Perceptrons. MIT Press, Cambridge, Mass., 1969.
22. M. H. Overmars. Efficient data structures for range searching on a grid. J. of Algorithms, 9:254-275, 1988.
23. S. C. Sahinalp and U. Vishkin. Efficient approximate and dynamic matching of patterns using a labeling paradigm. Proc. 37th FOCS, pages 320-328, 1996.
24. P. Weiner. Linear pattern matching algorithm. Proc. l4 IEEE Symposium on Switching and Automata Theory, pages 1-11, 1973.
25. A. C.-C. Yao and F. F. Yao. Dictionary lookup with one error. J. of Algorithms, 25(1):194-202, 1997.