String matching algorithms play a key role in many\ud computer science problems, and in the implementation of\ud computer software. This problem has received, and\ud continues to receive a great deal of attention due to\ud various applications in text manipulation, information\ud retrieval, speech recognition, image and signal\ud processing and computational biology. In this study, we\ud propose a new algorithm called the Odd and Even\ud algorithm (OE). OE combines an enhanced preprocessing\ud phase from the Berry Ravindran algorithm with our\ud proposed new searching phase procedure. This variety of\ud searching order allows our proposed algorithm to reduce\ud the number of comparison characters and enhances the\ud searching response time. Experimental results show that\ud OE algorithm offers a smaller number of comparisons\ud and offers improved elapsed searching time when\ud compared to other well-known algorithms for searching\ud any length of alphabets and patterns. The proposed\ud algorithm is applicable to searching protein sequence\ud databases as well as any other string searching\ud applications
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.