2-DIMENSIONAL PREFIX STRING-MATCHING AND COVERING ON SQUARE MATRICES

Authors
CROCHEMORE M ILIOPOULOS CS KORDA M
Citation
M. Crochemore et al., 2-DIMENSIONAL PREFIX STRING-MATCHING AND COVERING ON SQUARE MATRICES, Algorithmica, 20(4), 1998, pp. 353-373
Citations number
22
Categorie Soggetti
Mathematics,"Computer Science Software Graphycs Programming",Mathematics,"Computer Science Software Graphycs Programming
Journal title
Algorithmica → ACNP
ISSN journal
01784617
Volume
20
Issue
4
Year of publication
1998
Pages
353 - 373
Database
ISI
SICI code
0178-4617(1998)20:4<353:2PSACO>2.0.ZU;2-P
Abstract
Two linear time algorithms are presented. One for determining, for eve ry position in a given square matrix, the longest prefix of a given pa ttern (also a square matrix) that occurs at that position and one for computing all square covers of a given two-dimensional square matrix.