Abstract
In an enormous amount of factual data, it is necessary to find necessary information that can lead us to meaningful work. One such domain that does this work in pattern matching. The work of pattern matching is to provide us with information whether a particular pattern exists or not in given data. The algorithms of pattern matching fall in two categories, single and multiple, according to the number of patterns they can find, out of which the latter has wider applicability as compared to former. Such algorithms not only signify all the occurrences of particular patterns but are also useful in their analysis, which may lead to significant information. These algorithms have wide applicability due to the presence of abundance of data over the Internet. The paper emphasizes detailed study on the algorithms that can find more than one pattern, followed by a comparative analysis.
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
R. Boyer, J. Moore, A fast string searching algorithm. Commun. ACM 20(10), 762–772 (1977)
S. Vijayarani, R. Janani, String matching algorithms for retrieving information from desktop—comparative analysis, in 2016 International Conference on Inventive Computation Technologies (ICICT), Coimbatore (2016), pp. 1–6
M. Tahir, M. Sardaraz, A.A. Ikram, EPMA: efficient pattern matching algorithm for DNA sequences. Expert Syst. Appl. 80(1), 162–170 (2017)
P. Neamatollahi, M. Hadi, M. Naghibzadeh, Simple and efficient pattern matching algorithms for biological sequences. IEEE Access 8, 23838–23846 (2020)
S. Kumar, E.H. Spafford, An application of pattern matching in intrusion detection. Department of Computer Science Technical Reports. Paper 1116 (1994). https://docs.lib.purdue.edu/cstech/1116
H. Gharaee, S. Seifi, N. Monsefan, A survey of pattern matching algorithm in intrusion detection system, in Conference: 2014 7th International Symposium on Telecommunications (IST) (2014), pp. 946–953
D. Knuth, J. Morris Jr., V. Pratt, Fast pattern matching in strings. SIAM J. Comput. 6(2), 323–350 (1977)
R. Karp, M. Rabin, Efficient randomized pattern-matching algorithms. IBM J. Res. Dev. 31(2), 249–260 (1987)
Y.D. Hong, X. Ke, C. Yong, An improved Wu-Manber multiple patterns matching algorithm, in 25th IEEE International Performance, Computing, and Communications Conference, 2006 IPCCC (2006), pp. 675–680
S. Wu, U. Manber, A fast algorithm for multi-pattern searching. Technical Report TR-94-17 (University of Arizona, 1994), pp. 1–11
A. Aho, M. Corasick, Efficient string matching: an aid to bibliographic search. Commun. ACM 18(6), 333–340 (1975)
B. Commentz-Walter, A string matching algorithm fast on the average, in Proceeding 6th International Colloquium on Automata, Languages and Programming (Springer, 1979), pp. 118–132
R. Baeza-Yates, G. Gonnet, A new approach to text searching. Commun. ACM 35(10), 74–82 (1992)
Z.R. Feng, T. Takaoka, On improving the average case of the Boyer Moore string matching algorithm. J. Inf. process. 10(3), 173–177 (1987)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Mehta, R., Chormunge, S. (2022). Pattern Matching Algorithms: A Survey. In: Poonia, R.C., Singh, V., Singh Jat, D., Diván, M.J., Khan, M.S. (eds) Proceedings of Third International Conference on Sustainable Computing. Advances in Intelligent Systems and Computing, vol 1404. Springer, Singapore. https://doi.org/10.1007/978-981-16-4538-9_39
Download citation
DOI: https://doi.org/10.1007/978-981-16-4538-9_39
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-16-4537-2
Online ISBN: 978-981-16-4538-9
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)