International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 64 - Issue 18 |
Published: February 2013 |
Authors: Sagnik Banerjee, Tamal Chakrabarti, Devadatta Sinha |
![]() |
Sagnik Banerjee, Tamal Chakrabarti, Devadatta Sinha . Finding All Occurrences of a Pattern by a Genetic Algorithm Based Divide-and-Conquer Method. International Journal of Computer Applications. 64, 18 (February 2013), 48-52. DOI=10.5120/10737-5614
@article{ 10.5120/10737-5614, author = { Sagnik Banerjee,Tamal Chakrabarti,Devadatta Sinha }, title = { Finding All Occurrences of a Pattern by a Genetic Algorithm Based Divide-and-Conquer Method }, journal = { International Journal of Computer Applications }, year = { 2013 }, volume = { 64 }, number = { 18 }, pages = { 48-52 }, doi = { 10.5120/10737-5614 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2013 %A Sagnik Banerjee %A Tamal Chakrabarti %A Devadatta Sinha %T Finding All Occurrences of a Pattern by a Genetic Algorithm Based Divide-and-Conquer Method%T %J International Journal of Computer Applications %V 64 %N 18 %P 48-52 %R 10.5120/10737-5614 %I Foundation of Computer Science (FCS), NY, USA
The method of finding a sequence of characters, called the pattern, in another much longer sequence of characters, called the text, is known as pattern matching. Several pattern-matching algorithms exist, that locate all the positions where a pattern occurs in a text. In this paper we have presented an algorithm which implements a divide and conquer technique, which divides the text in smaller independent sub-texts and then looks for the existence of the pattern in each such sub-text. The said divide and conquer method thus eventually finds all the occurrences of the pattern in the given text. The points of division have been chosen using a genetic algorithm.