Two-dimensional prefix string matching and covering on square matrices

Algorithmica (New York)

Volumn 20, Issue 4, 1998, Pages 353-373

  Crochemore, M ^a   Iliopoulos, C S ^b,c   Korda, M ^b  

^a Université de Marne la Vallée   (France)

^b KING'S COLLEGE LONDON   (United Kingdom)

^c CURTIN UNIVERSITY   (Australia)

Author keywords

Pattern matching; Periodicity; Prefix matching; String algorithms

Indexed keywords

EID: 0004463118     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009200     Document Type: Article

References (23)

1. G.M. Main and R.J. Lorentz, An O(n log n) algorithm for finding all repetitions in a string, J. Algorithms, 5 (1984), 422-432.
2. R. Giancarlo, The suffix tree of a square matrix, with applications, Proc. 4th ACM-SIAM Symposium on Discrete Algorithms, 1993, pp. 402-411.
3. R. Giancarlo, A generalization of the suffix tree to square matrices with applications, SIAM J. Comput., 24(3) (1995), 520-562.
4. P. Weiner, Linear pattern matching automaton, Proc. 14 IEEE Symposium on Switching and Automata Theory, 1983, pp. 1-11.
5. A. Amir, G. Benson, and M. Farach, Alphabet independent two-dimensional matching, Proc. 24th ACM Symposium on Theory of Computing, 1992, pp. 59-68.
6. A.V. Aho and M.J. Corasick, Efficient string matching, Comm. ACM, 18(6) (1975), 333-340.
7. A. Apostolico, M. Farach, and C.S. Iliopoulos, Optimal superprimitivity testing for strings, Inform. Process. Lett., 39 (1991), 17-20.
8. D. Breslauer, An on-line string superprimitivity test, Inform. Process. Lett., 44 (1992), 345-347.
9. D.W.G. Moore and W.F. Smyth, Computing the covers of a string in linear time, Proc. 5th ACM-SIAM Symposium on Discrete Algorithms, 1994, pp. 511-515.
10. D. Breslauer, Testing string superprimitivity in parallel, Inform. Process. Lett., 44(6) (1992), 345-347.
11. C.S. Iliopoulos and K. Park, An optimal O(log log n) time algorithm for parallel superprimitivity testing, J. Korea Inform. Sci. Soc., 21(8) (1994), 1400-1404.
12. C.S. Iliopoulos, D.W.G. Moore, and K. Park, Covering a string, Proc. 4th Symposium on Combinatorial Pattern Matching, Lecture Notes in Computer Science, Vol. 684, Springer-Verlag, Berlin, 1993, pp. 54-62.
13. A.M. Ben-Amram, O. Berkman, C.S. Iliopoulos, and K. Park, The subtree max gap problem with application to parallel string covering, Proc. 5th ACM-SIAM Symposium on Discrete Algorithms, 1994, pp. 501-510.
14. A. Apostolico and A. Ehrenfeucht, Efficient detection of quasiperiodicities in strings, Theoret. Comput. Sci., 119 (1993), 247-265.
15. A.M. Duval and W.F. Smyth, Covering a circular string with substrings of fixed length, Internat. J. Found. Comput. Sci., 7.1 (1996), 87-93.
16. D. Harel and R.E. Tarjan, Fast algorithms for finding nearest common ancestors, SIAM J. Comput., 13(2) (1984), 338-355.
17. B. Scheiber and U. Vishkin, On finding lowest common ancestors: simplification and parallelization, SIAM J. Comput., 17(6) (1988), 1253-1262.
18. O. Berkman and U. Vishkin, Finding level-ancestors in trees, J. Comput. System Sci., 48 (1994), 214-230.
19. D.E. Knuth, J.H. Morris, and V.R. Pratt, Fast pattern matching in strings, SIAM J. Comput., 6 (1977), 322-350.
20. A. Amir, G. Benson, and M. Farach, Alphabet independent two-dimensional matching, SIAM J. Comput., 23(2) (1994), 313-323.
21. C.S. Iliopoulos and M. Korda, Optimal parallel superprimitivity testing for square arrays, Par. Proc. Lett., 6(3) (1996), 299-308.
22. C.S. Iliopoulos and M. Korda, Parallel two dimensional covering, Proc. 7th Australasian Workshop on Combinatorial Algorithms, Magnetic Island, University of Sydney, 1996, pp. 62-74.
23. L. Gasieniec and K. Park, Work-time optimal parallel prefix matching, Proc. 2nd European Symposium on Algorithms, Utrecht, 1994, pp. 471-482.