A2KD string pattern Matching Algorithm

String matching problem is to find all the occurrences of a given string pattern in a large string text. This problem is fundamental in computer Science and is the basic need of many applications; some of the most popular Multipattern String Matching Algorithm is “Aho-Corasick” and “Boyre Moore”. In this paper we will discuss about a new algorithm which will consume less time as compared to present algorithms in the various application areas like intrusion detection, detecting plagiarism, bioinformatics, digital forensic, and exploring text etc.