Suffix to Prefix Rule and Substring Matching Rules of Sting Matching Algorithms: An Analytical study and Correlations

String matching is a profound problem in various fields and becomes a great challenge for running a program for pattern matching quickly and effectively with less or no complexities. The application of string matching or pattern matching is widely increased as new technologies are used in medical science, network security, forensic science, library sciences and many others for information detection and retrieval. Algorithms for string matching were designed since 1974 and till date lots of algorithms have been proposed. This analytical study presents the mechanism also called rules follows for pattern matching process. This includes analysis and correlations of suffix to prefix rule and substring matching rules with different cases, supported by appropriate figures and examples to justify the relations among them.