Abstract

Many problems encountered require string searching to solve them. Thus, string searching algorithms are important. They play the vital role in various fields and applications, including text editing, finding part of DNA in bio informatics engineering, text searching, computer security, linguistics, artificial intelligence and web search engines. In this paper, a string searching algorithm is proposed. The proposed algorithm aims to improve the brute-force searching algorithm. It finds all the occurrences of a pattern within a given text. The pattern and the text are to be preprocessed before the actual searching starts.

References

• Thierry Lecroq, Experimental Results on String Matching Algorithms, SOFTWARE—PRACTICE AND EXPERIENCE, Vol. 25(7), pp. 727–765, 1995.
• G. Stephen, String Searching Algorithms, World Scientific, Singapore, 1994.
• Apostolico A. and Galil Z., Pattern Matching Algorithms, Oxford University Press, 1997.
• Robert Sedgewick and Kevin Wayne, Algorithms, 4th edition, ISBN-13: 978-0-321-57351-3, ISBN-10: 0-321-57351-X, Princeton University, Addison-Wesley, 2011.
• Liu Z., Du X. and Ishii N., An improved adaptive string searching algorithm, Software Practice and Experience, 28(2), pp. 191–198, 1988.
• Sunday D., A very fast substring search algorithm, Communications of the ACM, 33(8), pp. 132–142, 1990.
• Bruce W. and Watson E., A Boyer-Moore-style Algorithm for Regular Expression Pattern Matching, Science of Computer Programming, Vol. 48, pp. 99-117, 2003.
• Fenwick P., Fast string matching for multiple searches, Software, Practice and Experience, 31(9), pp. 815–833, 2001.
• Ohdan Masanori, Takeuchi Ryo and Satou Tadamasa, An Evaluation of String Search Algorithms at Users Standing, Proceedings of the 3rd WSES International Conference on Mathematics and Computers in Mechanical Engineering (MCME), pp. 4231-4236, ISBN: 960-8052-35-1, 2001.
• Softpanorama, Searching Algorithms, 2001, Available: http://www.softpanorama.org/Algorithms/searching.shtml. [Accessed: 8 July, 2019].
• Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, Introduction to Algorithms, 3rd edition, MIT Press, 2009.
• G.L. Prajapati, Mohd. Sharique, Piyush Nagani, Adarsh V., Study of Selected Shifting based String Matching Algorithms, International Journal of Computer Applications (0975 – 8887), Volume 140, No. 9, April 2016.
• D.E. Knuth, J.H. Morris Jr, and V.R. Pratt, Fast pattern matching in strings, SIAM journal on computing, Vol. 6, No. 2, pp. 323-350, June 1977.
• Hume and Sunday, Fast String Searching, Software-Practice and Experience, Vol. 21(11), pp. 1221–1248, 1991.
• Michael T. Goodrich and Roberto Tamassia, Algorithm Design and Applications, John Wiley and Sons, 2015.
• M. Crochemore and D. Perrin, 1991, Two Way String Matching, Journal of the Association for Computing Machinery, Vol. 38, No. 3, pp.651-675.
• Robert S. Boyer and J. Strother Moore, A Fast String Searching Algorithm, Association for Computing Machinery, Vol. 20, No. 10, pp. 762-772, Oct. 1977.
• Mohammad Ababneh, Saleh Oqeili and Rawan A. Abdeen, Occurrences Algorithm for String Searching Based on Brute-force Algorithm, Journal of Computer Science, ISSN 1549-3636, 2(1), pp. 82-85, 2006.
• Rawan A. Abdeen, Start-to-End Algorithm for String Searching, IJCSNS International Journal of Computer Science and Network Security, Vol. 11, No. 2, pp. 179-182, February 2011.