Call For Paper Volume:4 Issue:6 Jun'2017

A Composite Algorithm for String Matching

Publication Date : 19/07/2015



Author(s) :

Neha R Dalal , Poonam Jadhav.


Volume/Issue :
Volume 2
,
Issue 7
(07 - 2015)



Abstract :

String matching algorithms play an important role in the field of Computer Science as they help us extract the relevant data from a huge database. Due to complex nature of technical data stored in huge databases, making use of algorithms like the Knuth-Morris-Pratt Algorithm, Horspool’s Algorithm, or the Boyer-Moore algorithm for retrieving a subset of data will be efficient. But it is always preferable to have an advanced variation of any of these algorithms so as to be more time and space efficient. Hence we propose a composite algorithm that will be a variant of Knuth-Morris-Pratt Algorithm, which will prove to be more time and space efficient.  


No. of Downloads :

3


Indexing

Web Design MymensinghPremium WordPress ThemesWeb Development

A Composite Algorithm for String Matching

July 16, 2015