Matching a set of strings with variable length don't cares

Theoretical Computer Science

Volumn 178, Issue 1-2, 1997, Pages 129-154

  Kucherov, Gregory ^a   Rusinowitch, Michaël ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; GRAPH THEORY; PROBLEM SOLVING;

DIRECTED ACYCLIC WORD GRAPH (DAWG); VARIABLE LENGTH DON'T CARE SYMBOLS;

PROGRAMMING THEORY;

EID: 0031143237     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)88195-9     Document Type: Article

References (17)

1. A.V. Aho, Algorithms for finding patterns in strings, in: J. van Leeuwen, ed., Handbook of Theoretical Computer Science (North-Holland, Elsevier, 1990).
2. A. Amir and M. Farach, Adaptive dictionary matching, in: Proc. 32nd Ann. IEEE Symp. on Foundations of Computer Science, San Juan (Puerto Rico), (IEEE Computer Society Press, New York, 1991) p. 760-766.
3. A. Amir, M. Farach, Z. Galil, R. Giancarlo and P. Kunsoo, Fully 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, in: Proc. 4th Ann. ACM-SIAM Symp. on Discrete Algorithms, Austin (TX), 392-401, January 1993, to appear in: Inform. Comput.
5. A.A. Bertossi and F. Logi, Parallel string matching with variable length don't cares, J. parallel distributed comput. 22 (1994) 229-234.
6. A. Blumer, J. Blumer, D. Haussler, A. Ehrenfeucht, M. T. Chen and J. Seiferas, The smallest automaton recognizing the subwords of a text, Theoret. Comput. Sci. 40 (1985) 31-55.
7. A. Blumer, J. Blumer, D. Haussler, R. McConnell and A. Ehrenfeucht, Complete inverted files for efficient text retrieval and analysis, J. ACM. 34 (1987) 578-595.
8. M. Crochemore, Transducers and repetitions, Theoret. Comput. Sci. 45 (1986) 63-86.
9. M. Crochemore, String matching with constraints, In Proc. Internat. Symp. on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, Vol. 324 (Springer, Berlin, 1988) p. 44-58.
10. M.J. Fisher and M.S. Paterson, String-matching and other products, in: R.M. Karp, ed. Complexity of Computation, SIAM-AMS Proceedings, Vol. 7 (American Mathematical Society, Providence, RI, 1974) p. 113-125.
11. R.M. Idury and A.A. Schäffer, Dynamic dictionary matching with failure functions, Theoret. Comput. Sci. 131 (1994) 295-310.
12. G. Kucherov and M. Rusinowitch, Complexity of testing ground reducibility for linear word rewriting systems with variables, in: Proc. 4th Internat. Workshop on Conditional and Typed Term Rewriting Systems, Jerusalem (Israel), Lecture Notes in Computer Science, Vol. 968 (Springer, Berlin 1995) p. 262-275.
13. U. Manber and R. Baeza-Yates, An algorithm for string matching with a sequence of don't cares, Inform. Process. Lett. 37 (1991) 133-136.
14. G. Myers, A four russians algorithm for regular expression pattern matching, J. ACM 39 (1992) 430-448.
15. R.Y. Pinter, Efficient string matching with don't-care patterns, in: A. Apostolico and Z. Galil, ed., Combinatorial Pattern Matching, Vol. F12 of ASI Series (Springer, Berlin, 1985) p. 11-29.
16. D.D. Sleator and R.E. Tarjan, A data structure for dynamic trees, J. Comput. System Sci. 26 (1983) 362-391.
17. E. Ukkonen, On-line construction of suffix-trees, Algorithmica. 14 (1995) 249-260.