Two-dimensional prefix string matching and covering on square matrices
Résumé
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.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...