Intelligent Analytical String Search Algorithm

Kamran Arshad · 2021 International Conference on Innovative Computing (ICIC) · 2021

Text preparation has moved beyond simple word handling which right now structures a minor piece of its application. With the arrival of globalization and the extremely large measure of text handling related to data mining, string search algorithms now become important than earlier. As, there already exist the KMP, Boyer-Moore, and Horspool algorithms for string matching. The given algorithm also works on string matching but it is different from further present algorithms such that preprocess don’t require by the algorithm for the pattern search. It uses the linear rules when the character match or mismatch occurs. It tends to be connected in the field of information and data mining, DNA example, etc.

Read the paper · More papers on PaperTik