This paper presents a new parallel algorithm far string matching with variable length "don't care" (VLDC). The initial computational model used is the associative computing model (ASC) enhanced with a linear network. ASC is a natural extension of the data parallel paradigm to a complete model far parallel computation. It supports massively parallelism through the use of data parallelism and constant time functions such as associative search and maximum value. It is also shown that the same algorithm is equally adaptable to the mesh with multiple broadcast. The algorithm has a run time of O(m) using O(n) processors, given a pattern of size m and a text of size n. The algorithm has the unique feature of permitting the identification of all match continuation points in the text after each "don't care" character.