On maximal suffixes and constant-space linear-time versions of KMP algorithm

Theoretical Computer Science

Volumn 299, Issue 1-3, 2003, Pages 763-774

  Rytter, Wojciech ^a,b  

^a UNIVERSITY OF WARSAW   (Poland)

^b University Heights   (United States)

Author keywords

Constant space; Linear time; Maximal suffix; String matching

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FUNCTIONS; THEOREM PROVING;

STRING MATCHING;

COMPUTER SCIENCE;

EID: 0037453394     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00590-X     Document Type: Article

References (10)

1. Crochemore M. String-matching on ordered alphabets. Theoret. Comput. Sci. 92:1992;35-47.
2. Crochemore M., Perrin D. Two-way string-matching. J. Assoc. Comput. Mach. 38(3):1991;651-675.
3. Crochemore M., Rytter W. Text Algorithms. 1994;Oxford University Press, New York.
4. Crochemore M., Rytter W. Cubes, squares and time space efficient string matching. Algorithmica. 13(5):1995;405-425.
5. Duval J.-P. Factorizing words over an ordered alphabet. J. Algorithms. 4:1983;363-381.
6. Galil Z., Seiferas J. Time-space-optimal string matching. J. Comput. System Sci. 26:1983;280-294.
7. Ga̧sieniec L., Plandowski W., Rytter W. The zooming method: a recursive approach to time-space efficient string-matching. Theoret. Comput. Sci. 147:1995;19-30.
8. L. Ga̧sieniec, W. Plandowski, W. Rytter, Constant-space string matching with smaller number of comparisons: sequential sampling, in: Z. Galil, E. Ukkonen (Eds.), Combinatorial Pattern Matching, 6th Annual Symposium, CPM gs, Lecture Notes in Computer Science, Vol. 937, Springer, Berlin, 1995, pp. 78-89.
9. Knuth D.E., Morris J.H., Pratt V.R. Fast pattern matching in strings. SIAM J. Comput. 6:1977;322-350.
10. Lothaire M. Combinatorics on Words. 1983;Addison-Wesley, Reading, MA, USA.