Implementation of ECSA for String Matching

The problems of Exact string Searching had been investigated by many studies ranging from finding the shortest common super string in DNA sequencing to searching for occurrences of a pattern occurs in text editors. In this paper, the implementation of Naïve, Boyer-Moore-Horsepool and Enhanced Checking and Skipping Algorithm (ECSA) is introduced. The ECSA algorithm enhance the classical string searching algorithms by converting the character-comparison into character-access, by using the condition type character-access rather than the number-comparison, and by starting the comparison at the latest mismatch in the previous checking, which in turn increases the probability of finding the mismatch faster if there is any. A computer program is developed to compare the performance of the ECSA algorithm against the conventional Naïve (brute force) and Boyer-Moore-Horsepool (BMH) algorithms. The results of the experiment show that the performance of the enhanced algorithm is outperform the performance of the introduced algorithms.