Fast text searching for regular expressions or automaton searching on tries

Journal of the ACM

Volumn 43, Issue 6, 1996, Pages 915-936

  Baeza Yates, Ricardo A ^a   Gonnet, Gaston H ^b,c  

^a UNIVERSITY OF CHILE   (Chile)

^b Informatik   (Switzerland)

^c ETH ZURICH   (Switzerland)

Author keywords

Algorithms; Digital trees; Finite automata; Regular expressions; Text searching

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; FINITE AUTOMATA; INFORMATION RETRIEVAL SYSTEMS; PATTERN RECOGNITION;

AUTOMATON SEARCHING; DIGITAL TREES; PROBLEM COMPLEXITY; REGULAR EXPRESSIONS; TEXT SEARCHING;

ALGORITHMS;

EID: 0030287008     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/235809.235810     Document Type: Article

References (29)

1. AHO, A. V., HOPCROFT, J. E., AND ULLMAN, J. D. 1974. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass.
2. APOSTOLICO, A., AND SZPANKOWSKI, W. 1992. Self-alignments in words and their applications. J. Algorithms 13, 446-467.
3. BAEZA-YATES, R. A. 1989. Efficient text searching. Ph.D. dissertation. Dept. of Computer Science, Univ. Waterloo, Waterloo, Ont., Canada.
4. BAEZA-YATES, R. A. 1995. Fringe analysis revisited. ACM Comput. Surv. 27 (Mar.), 109-119.
5. BAEZA-YATES, R., AND GONNET, G. H. 1989a. Efficient text searching of regular expressions. In Proceedings of ICALP'89. G. Ausiello, M. Dezani-Ciancaglini, and S. Ronchi Della Rocca, eds., Lecture Notes in Computer Science, vol. 372. Springer-Verlag, New York, pp. 46-62.
6. BAEZA-YATES, R. A., AND GONNET, G. H. 1989b. Solving matrix recurrences with applications. Tech. Rep. CS-89-16. Department of Computer Science, Univ. Waterloo.
7. BATORY, D. S. 1979. On searching transposed files. ACM Trans. Datab. Syst. 4, 531-544.
8. DE LA BRIANDAIS, R. 1959. File searching using variable length keys. In AFIPS Western JCC (San Francisco, Calif.), pp. 295-298.
9. DEVROYE, L. 1982. A note on the average depth of tries. Computing 28, 367-371.
10. FLAJOLET, P., AND PUECH, C. 1986. Partial match retrieval of multidimensional data. J. ACM 33, 2 (Apr.), 371-407.
11. FREDKIN, E. 1960. Trie memory. Commun. ACM 3, 9 (Sept.), 490-499.
12. GALIL, Z. 1985. Open problems in stringology. In Combinatorial Algorithms on Words, A. Apostolico and Z. Galil, eds., volume F12 of NATO ASI Series. Springer-Verlag, New York, pp. 1-3.
13. GANTMACHER, F. R. 1959. The Theory of Matrices, (2 vols.). Chelsea Publishing Company, New York.
14. GONNET, G. H. 1983. Unstructured data bases or very efficient text searching. In Proceedings of the 2nd ACM Symposium on Principles of Database Systems (Atlanta, Ga., Mar. 21-23). ACM, New York, pp. 117-124.
15. GONNET, G. H. 1988. Efficient searching of text and pictures (extended abstract). Tech. Rep. OED-88-02. Centre for the New OED., Univ. Waterloo, Waterloo, Ont., Canada.
16. GONNET, G. H., AND BAEZA-YATES, R. 1991. Handbook of Algorithms and Data Structures - In Pascal and C, 2nd ed., Addison-Wesley, Wokingham, UK.
17. GONNET, G., COHEN, M., AND BENNER, S. 1992. The all-against-all matching of a major protein sequence database. Science 256, 1443-1445.
18. HOPCROFT, J. E., AND ULLMAN, J. D. 1979. Introduction to Automata Theory. Addison-Wesley, Reading, Mass.
19. KNUTH, D. E. 1973. The Art of Computer Programming: Sorting and Searching, vol. 3. Addison-Wesley, Reading, Mass.
20. MANBER, U., AND BAEZA-YATES, R. 1991. An algorithm for string matching with a sequence of don't cares. Inf. Proc. Lett. 37 (Feb.), 133-136.
21. MANBER, U., AND MYERS, G. 1990. Suffix arrays: A new method for on-line string searches. In Proceedings of the 1st ACM-SIAM Symposium on Discrete Algorithms (San Francisco, Calif., Jan.). ACM, New York, pp. 319-327.
22. MORRISON, D. R. 1968. PATRICIA - Practical algorithm to retrieve information coded in alpha-numeric. J. ACM 15, 4 (Oct.), 514-534.
23. OSTROWSKI, A. M., AND SCHNEIDER, H. 1960. Bounds for the maximal characteristic root of a non-negative irreducible matrix. Duke Math J. 27, 547-553.
24. PITTEL, B. 1986. Paths in a random digital tree: Limiting distributions. Adv. Appl. Prob. 18, 139-155.
25. RÉGNIER, M. 1981. On the average height of trees in digital search and dynamic hashing. Inf. Proc. Lett. 13, 64-66.
26. RIVEST, R. 1977. On the worst-case behavior of string-searching algorithms. SIAM J. Comput. 6, 669-674.
27. SZPANKOWSKI, W. 1993. A generalized suffix tree and its (un)expected asymptotic behaviors. SIAM J. Comput. 22, 1176-1198.
28. THOMPSON, K. 1968. Regular expression search algorithm. Commun. ACM 11, 6 (June), 419-422.
29. UKKONEN, E. 1993. Approximate string matching over suffix trees. In CPM'94 (Padova, Italy, June). Lecture Notes in Computer Science, vol. 520. Springer-Verlag, New York, pp. 240-248.