Abstract
We present several new parallel algorithms in the field of string and array processing. We give almost optimal algorithms for pattern matching in arrays and for related problem: longest common subarray, longest repeated subarray and longest symmetric subarray. We also give almost optimal algorithms for problems on strings: finding squares, testing even palstars, computing Lyndon factorizations and building pattern matching automata. In the PRAM model without concurrent writes, the parallel time is log(n)2 with n processors and, in the PRAM model with concurrent writes, the time, for most of the problems, is log(n) with n processors. All the algorithms have in common the use of a parallel version of the Karp, Miller and Rosenberg's algorithm.
This work has been realized at the University of Paris-Nord.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
A. Aho, M. Corasick, Efficient string-matching: an aid to bibliographic search, CACM 18 (1975) 333–340.
A. Aho, J. Hopcroft, J. Ullman, The design and analysis of computer algorithms, Addison-Wesley (1974).
A. Apostolico, C. Iliopoulos, G. Landau, B. Schieber, U. Vishkin, Parallel construction of a suffix tree applications, Algorithmica, 3, 3 (1988) 347–365.
T. Baker, A technique for extending rapid exact string matching to arrays of more than one dimension, SIAM J.Comp. 7 (1978) 533–541.
R.S. Bird, Two-dimensional pattern-matching, IPL 6 (1977) 168–170.
R. Boyer, J. Moore, A fast string searching algorithm, CACM 20 (1977)
R. Cole, Parallel merge sort, FOCS (1987).
M. Crochemore, Longest common factor of two words, CAAP'87, 23–36.
M. Crochemore, String matching and periods, to appear in Bullet, EATCS (1989).
M. Crochemore, D.Perrin, Two way string matching, 1989, submitted to JACM.
M. Crochemore, W. Rytter, Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays, 1989, to appear in TCS.
J-P. Duval, Factorizing words over an ordered alphabet, J.Algorithms 4 (1983) 363–381.
Z. Galil, Open problems in stringology, in: (Combinatorial algorithms on words, A. Apostolico, Z. Galil eds, Springer-Verlag, 1985) 1–12.
Z. Galil, Optimal parallel algorithm for string matching, Information and Control 67,(1985) 144–157.
Z. Galil, J. Seiferas, Time space optimal string matching, JCSS 26 (1983) 280–294.
Z. Galil, J. Seiferas, A linear time on line recognition algorithm for palstars, JACM 25 (1978) 102–11.
A. Gibbons, W. Rytter, Efficient parallel algorithms, Cambridge University Press (1988).
R. Karp, R. Miller, A. Rosenberg, Rapid identification of repeated patterns in strings, arrays and trees, STOC 4 (1972) 125–136.
D. Knuth, J. Morris, V. Pratt, Fast pattern matching in strings, SIAM J.Comp. 6 (1977) 322–350.
G. Landau, B. Schieber, U. Vishkin, Parallel construction of a suffix tree, ICALP (1987) 314–325.
M. Lothaire, Combinatorics on words, Addison Wesley (1983).
G. Manacher, A new linear time on-line algorithm for finding the smallest initial palindrome of the string, J. ACM 22 (1975) 345–351.
M. Main, R. Lorentz, An O(n log(n)) algorithm for finding all repetitions in a string. J. Algorithms (1984) 422–432.
M. Main, R. Lorentz, Linear time recognition of square-free strings, in: (Combinatorial algorithms on words, A. Apostolico, Z. Galil eds, Springer-Verlag, 1985) 271–278.
W. Rytter, On the parallel transformations of regular expressions to nondeterministic finite automata. Inf.Proc.Letters 31 (1989) 103–109.
U. Vishkin, Optimal parallel pattern matching in strings, Information and Control 67 (1985) 91–113.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Crochemore, M., Rytter, W. (1990). Parallel computations on strings and arrays. In: Choffrut, C., Lengauer, T. (eds) STACS 90. STACS 1990. Lecture Notes in Computer Science, vol 415. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52282-4_36
Download citation
DOI: https://doi.org/10.1007/3-540-52282-4_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52282-9
Online ISBN: 978-3-540-46945-2
eBook Packages: Springer Book Archive