i’m facing a problem right now, i need to count the number of time a certain MxM matrix appears inside a NxN one (this one should be larger than the first one). Any hints on how to do this? I’m going to implement it in C and there is no option to change it.
Revision 1
Hi everyone, i would really like to say thank to all the answers and opinions on the matter. I should tell you that after many hours of hard work we have come to a solutions that is not strictly like the Boyer-Moore approach, but rather an algorithm on my own. I’m planning on publishing it once is tested and finished. The solutions is now being adapted to be paralelized for speed optimization using the university cluster with the C Library MPI.
Hm, sounds like a 2-dimensional version of string matching. I wonder if there’s a 2D version of Boyer-Moore?
A Boyer-Moore Approach for Two-Dimensional Matching
Ah, apparently there is. 🙂