This paper investigates the performance of the new algorithm on such data and compares it with other known algorithms. The results are very encouraging, suggesting that the expected running time theoretical results for ergodic sequences provide a very good estimate of the algorithm's performance on DNA sequences. In fact the algorithm provides its most striking performance on longer pattern strings and small size of alphabet