Rectangular Tile Covers of 2D-Strings

We consider tile covers of 2D-strings which are a generalization of periodicity of 1D-strings. We say that a 2D-string A is a tile cover of a 2D-string S if S can be decomposed into non-overlapping 2D-strings, each of them equal to A or to A^T, where A^T is the transpose of A. We show that all tile covers of a 2D-string of size N can be computed in ?(N^{1+?}) time for any ? > 0. We also show a linear-time algorithm for computing all 1D-strings being tile covers of a 2D-string