Could algorithms designed within the computational model of cellular automata fit well into a future biocomputing environment where data and computation are seamlessly and dynamically distributed? We suggest it is possible by presenting a systematic approach for creating 1D linear cellular automata that in parallel can locate all starting positions of complete matches to a given PROSITE pattern in a string. The cellular automaton requires time proportional to the maximal length of a pattern match, and is inherently suited for distribution out on multiple processors.