@article{MAKHILLAJIT2009815586,
    title = {On Improving the Naïve String Matching Algorithm},
    journal = {Asian Journal of Information Technology},
    volume = {8},
    number = {1},
    pages = {14-23},
    year = {2009},
    issn = {1682-3915},
    doi = {ajit.2009.14.23},
    url = {https://makhillpublications.co/view-article.php?issn=1682-3915&doi=ajit.2009.14.23},
    author = {Rami H. and},
    keywords = {String matching,naive algorithm,occurrence list,complexity},
    abstract = {String matching algorithms are essential components used in implementations of the practical software under most operating systems. It is important to any string matching algorithm to be able to locate quickly some or all occurrences of a user-specified pattern in a text. In this study, we propose three new exact single pattern matching algorithms. These are: FC-RJ (First Character-Rami and Jehad), FLC-RJ (first and last Characters-Rami and Jehad) and FMLC-RJ (first, middle and last Characters-Rami and Jehad). The proposed algorithms rely on utilizing new technique based on occurrence list. The proposed algorithms are analyzed and implemented as a part of the experimental simulation system (RJ-SMT). The extensive testing and comparisons with the Naïve (Brute Force) algorithm show that the proposed algorithms enhance execution time by 7.4, 16.2 and 20.6%, respectively.}
    }