Abstract
String matching is an integral part of various important areas of computer science viz search engines, DNA matching, information retrieval, security, and biological systems. String matching algorithms are used in finding a pattern in a string. In this paper, the authors have given a novel algorithm to reduce the time complexity of string matching. The proposed algorithm is based on the concept of hashing with chaining. Further, the authors have found reduced time complexity in most of the cases and equal in few.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Norton, M., & Roelker, D. (2003). The new Snort. Computer Security Journal, 19(3), 37–47.
Boyer, R., & Moore, J. (1977). A fast string searching algorithm. Communications of the ACM, 20(10), 762–772.
Pandey, S. K. et al. (2014). A study on string matching methodologies, (IJCSIT). International Journal of Computer Science and Information Technologies, 5, 4732–4735.
Karp, R. & Rabin, M. (1987). Efficient matching algorithms. IBM Journal of Research and Development, 31(2), 249–260.
Takáč, Ľuboš. (2013). Fast exact string pattern-matching algorithm for fixed length patterns. Žilina, SlovakRepublic, TRANSCOM: University of Žilina.
Chang, C., & Wang, H. (2012). Comparison of two-dimensional string matching algorithms. International Conference on Computer Science and Electronics Engineering, 3, 608–611. doi: 10.1109/ICCSEE.2012.29.
Yuan, L. (2011). An improved algorithm for Boyer-Moore string matching. In 2011 International Conference on Chinese Information Processing, Computer Science and Service System (CSSS), pp. 182–184. IEEE. doi:10.1109/CSSS.2011.5974722. Print ISBN:978-1-4244-9762-1.
Alshahrani, A. M. (2013). Exact and like string matching algorithm for web and network security. 2013 World Congress on Computer and Information Technology (WCCIT), pp. 1–4. Print ISBN:978-1-4799-0460-0INSPEC. Accession Number:1382632. doi:10.1109/WCCIT.2013.6618726.
Sheik, S. S., Aggarwal, S. K., Poddar, A., Balakrishnan, N., & Sekar, K. (2004). A FAST pattern matching algorithm. Journal of Chemical Information and Computer Sciences, 44, 1251–1256.
Exact String Matching Algorithm Animation Java. http://www-igm.univ-mlv.fr/~lecroq/string/node1.html.
Fuyao, Z. (2009, December 19–20). A string matching algorithm based on efficient hash function. IEEE Information Engineering and Computer Science, pp. 1–4. doi:10.1109/ICIECS.2009.5363191. Print ISBN:978-1-4244-4994-1.
Knuth, D., Morris, J., & Pratt, V. (1977). Fast pattern matching in strings. SIAM Journal on Computing, 6(2), 323–350.
Boyer-Moore (1995). Parameterized pattern matching by type algorithms. In Proceedings of the 6th ACMSIAM, pp. 541–550. San Francisco, CA.
Notes on Boyer Moore String Mathing Algorithm. http://www.cs.ucdavis.edu/~gusfield/cs224f11/bnotes.pdf.
Franeka, F., Jennings, C. G., Smyth, W. F. (2007). A simple fast hybrid pattern-matching algorithm. Journal of Discrete Algorithms, 5(4), 682–695. December 2007.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media Singapore
About this paper
Cite this paper
Pandey, S.K., Tiwari, H.K., Tripathi, P. (2016). Hybrid Approach to Reduce Time Complexity of String Matching Algorithm Using Hashing with Chaining. In: Satapathy, S., Joshi, A., Modi, N., Pathak, N. (eds) Proceedings of International Conference on ICT for Sustainable Development. Advances in Intelligent Systems and Computing, vol 408. Springer, Singapore. https://doi.org/10.1007/978-981-10-0129-1_20
Download citation
DOI: https://doi.org/10.1007/978-981-10-0129-1_20
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-0127-7
Online ISBN: 978-981-10-0129-1
eBook Packages: EngineeringEngineering (R0)