Study of Selected Shifting based String Matching Algorithms | Zendy

Gend Lal Prajapati | Zendy; Mohd Sharique | Zendy; Piyush Nagani | Zendy; V. Adarsh | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Study of Selected Shifting based String Matching Algorithms

Author(s) -

Gend Lal Prajapati,

Mohd Sharique,

Piyush Nagani,

V. Adarsh

Publication year - 2016

Publication title -

international journal of computer applications

Language(s) - English

Resource type - Journals

ISSN - 0975-8887

DOI - 10.5120/ijca2016909441

Subject(s) - computer science , string searching algorithm , string (physics) , matching (statistics) , algorithm , pattern matching , artificial intelligence , mathematics , statistics , mathematical physics

This paper presents detailed comparisons and analysis of shift-based exact string matching algorithms. The paper proposes comparison among these algorithms on the basis of execution time taken by the algorithms to completely match a given pattern on a given text. The algorithms have been analyzed on the following parameters: length of pattern, length of text, and number of characters in the text. This study will help in selecting the appropriate algorithm to be used in solving a particular real-life problem.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research