Alphabet-independent optimal parallel search for three-dimensional patterns

Theoretical Computer Science

Volumn 205, Issue 1-2, 1998, Pages 243-260

  Karpinski, Marek ^a   Rytter, Wojciech ^b,c  

^a UNIVERSITY OF BONN   (Germany)

^b UNIVERSITY OF WARSAW   (Poland)

^c UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347087936     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00252-1     Document Type: Article

References (16)

1. A. Amir, G. Benson, Two dimensional periodicity in rectangular arrays, in: Proc. 2nd ACM Symp. on Discrete Algorithms, 1992, pp. 440-452
2. A. Amir, G. Benson, M. Farach, Alphabet independent two dimensional matching, in: Proc. 24th ACM Symp. on Theory of Computation, 1992 pp. 59-68.
3. A. Amir, G. Benson, M. Farach, Parallel two dimensional matching in logarithmic time, in: Proc. 5th ACM Symp. on Parallel Algorithms and Architectures, 1993, pp. 79-85.
4. M. Atallah, R. Kosaraju, An efficient parallel algorithm for the row minima of a totally monotone array, Algorithms 13(2) (1992) 394-413.
5. T.J. Baker, A technique for extending rapid exact-match string matching to arrays of more than one dimension, SIAM J. Comp. 7 (1978) 533-541.
6. R.S. Bird. Two dimensional pattern matching, Inf. Proc. Lett. 6 (1977) 168-170.
7. R. Cole, M. Crochemore, Z. Galil, L. Gasieniec, R. Hariharan, S. Muthukrishnan, K. Park, W. Rytter, Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions, in: Proc. 34th IEEE Symp. on Foundations of Computer Science 1993, pp. 248-258.
8. M. Crochemore, W. Rytter, Text algorithms, Oxford University Press, New York, 1994.
9. M. Crochemore, W. Rytter, Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays, Theoret. Comput. Sci. 88 (1991) 59-62.
10. Z. Galil, Optimal parallel algorithms for string matching, Inform. Control 67 (1985) 144-157.
11. Z. Galil, K. Park, Truly alphabet independent two dimensional matching, in: Proc. 34th IEEE Symp. on Foundations of Computer Science, 1992, pp. 247-256.
12. A. Gibbons, W. Rytter, Efficient parallel algorithms, Cambridge University Press, Cambridge, 1988.
13. R. Karp, R. Miller, A. Rosenberg, Rapid identification of repeated patterns in strings, trees and arrays, in: Proc. ACM Symp. on Theory of Computation, 1972, pp. 125-136.
14. R. Karp, M.O. Rabin, Efficient randomized pattern matching algorithms, IBM J. Res. Dev. 31 (1987) 249-260.
15. M. Karpinski, W. Rytter, Alphabet independent optimal parallel search for 3-dimensional patterns, preliminary version, in: Combinatorial Pattern Matching, M. Crochemore, D. Gusfield, eds, Springer, Berlin, Lecture Notes in Computer Science, vol. 807, 1994, pp. 125-135.
16. U. Vishkin, Optimal pattern matching in strings, Inform. Control (1985) 91-113.