Abstract.
Two linear time algorithms are presented. One for determining, for every position in a given square matrix, the longest prefix of a given pattern (also a square matrix) that occurs at that position and one for computing all square covers of a given two-dimensional square matrix.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received December 21, 1995; revised September 12, 1996.
Rights and permissions
About this article
Cite this article
Crochemore, M., Iliopoulos, C. & Korda, M. Two-Dimensional Prefix String Matching and Covering on Square Matrices . Algorithmica 20, 353–373 (1998). https://doi.org/10.1007/PL00009200
Issue Date:
DOI: https://doi.org/10.1007/PL00009200