论文信息 - Detection of periodicities and string-matching in real time

Detection of periodicities and string-matching in real time

This article contains a detailed description of an algorithm for finding all periodicities in real time on a machine with random memory access and registers of asymptotically minimal length. In fact, this construction gives a real-time algorithm for pattern matching, finding the longest repetitions, and so forth.

A. O. Slisenko | A. Slisenko

[1] Leonidas J. Guibas,et al. A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm , 1980, SIAM J. Comput..

[2] A. O. Slisenko. String-Matching in Real Time: Some Properties of the Data Structure , 1978, MFCS.

[3] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[4] M. Fischer,et al. STRING-MATCHING AND OTHER PRODUCTS , 1974 .

[5] Edward M. McCreight,et al. A Space-Economical Suffix Tree Construction Algorithm , 1976, JACM.

[6] Leslie G. Valiant,et al. Fast probabilistic algorithms for hamiltonian circuits and matchings , 1977, STOC '77.

[7] Donald E. Knuth,et al. Fast Pattern Matching in Strings , 1977, SIAM J. Comput..

[8] Zvi Galil. Real-time algorithms for string-matching and palindrome recognition , 1976, STOC '76.

[9] Peter Weiner,et al. Linear Pattern Matching Algorithms , 1973, SWAT.

[10] H. Wilf,et al. Uniqueness theorems for periodic functions , 1965 .

[11] Zvi Galil,et al. Saving space in fast string-matching , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).