I'm working with some binary files (like 10MB each one), with contains some patterns; I've a collection of theme but it not complete( and never be..);
So I'm thinking to adapt the boyer moor function that already have to find variant of the patterns that already have;
Instead of looking for byte sequence I would search for a sequence of angles( that should find the patterns that are offset e.g. 5 6 7 8 is the 1 2 3 4 with offset of 4) and a tollerance to allow a little error in the pattern. (On paper seem esasy but on reality for me is not as simple..).I'm looking for an advice, Is it a bad idea?
So I'm thinking to adapt the boyer moor function that already have to find variant of the patterns that already have;
Instead of looking for byte sequence I would search for a sequence of angles( that should find the patterns that are offset e.g. 5 6 7 8 is the 1 2 3 4 with offset of 4) and a tollerance to allow a little error in the pattern. (On paper seem esasy but on reality for me is not as simple..).I'm looking for an advice, Is it a bad idea?