Date: 05/17/05 (Algorithms)    Keywords: no keywords

I haven't come across any algorithms or methods of approaching this, though I guess it's pretty standard... so bear with my questions:

Given an ordered list of elements, what is the best way find a regular pattern within a given accuracy? Say, for instance, the list [2, 4, 3, 6, 7, 9, 11, 2]... the pattern is [prime, even, prime, even, prime, odd, prime, even]->[prime, even, prime, even, prime, even, prime, even] with 11/12 accuracy. (This is a constructed example; hope it is clear enoungh.) We're assuming, of course, that the attribute space is predefined and finite.

Source: http://www.livejournal.com/community/algorithms/54027.html