Finding All Occurrences of a Pattern by a Genetic Algorithm Based Divide-and-Conquer Method

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...

Full description

Saved in:
Bibliographic Details
Published in:International journal of computer applications 2013-01, Vol.64 (18), p.48-52
Main Authors: Banerjee, Sagnik, Chakrabarti, Tamal, Sinha, Devadatta
Format: Article
Language:English
Subjects:
Algorithms
Division
Genetic algorithms
Matching
Texts
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 52
container_issue 18
container_start_page 48
container_title International journal of computer applications
container_volume 64
creator Banerjee, Sagnik
Chakrabarti, Tamal
Sinha, Devadatta
description 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.
doi_str_mv 10.5120/10737-5614
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1671330592</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1671330592</sourcerecordid><originalsourceid>FETCH-LOGICAL-c1324-73a12a47c9023627af1c73b7fa0b09c1e686aeb51c89f6dc2d07583c8b1f6cc03</originalsourceid><addsrcrecordid>eNpdkE1LAzEQhoMoWGov_oKAFxFW87Gbj2OttgqVetCTh5DNZtuU3aQmu0L_vVvrQZzLzAsPM8MDwCVGtwUm6A4jTnlWMJyfgBGSvMiEEPz0z3wOJilt0VBUEibzEfiYO185v4bTpoErY_oYrTc2wVBDDV9119noYbkfwsJ62zkzkOsQXbdp4b1OtoIP7stVNtO-ymbBf_Y2whfbbUJ1Ac5q3SQ7-e1j8D5_fJs9ZcvV4nk2XWYGU5JnnGpMdM6NRIQywnWNDaclrzUqkTTYMsG0LQtshKxZZUiFeCGoESWumTGIjsH1ce8uhuF86lTrkrFNo70NfVKYcUwpKiQZ0Kt_6Db00Q_fKUyERDmj9EDdHCkTQ0rR1moXXavjXmGkDqrVj2p1UE2_AVXdbfc</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1289046332</pqid></control><display><type>article</type><title>Finding All Occurrences of a Pattern by a Genetic Algorithm Based Divide-and-Conquer Method</title><source>Freely Accessible Journals</source><creator>Banerjee, Sagnik ; Chakrabarti, Tamal ; Sinha, Devadatta</creator><creatorcontrib>Banerjee, Sagnik ; Chakrabarti, Tamal ; Sinha, Devadatta</creatorcontrib><description>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.</description><identifier>ISSN: 0975-8887</identifier><identifier>EISSN: 0975-8887</identifier><identifier>DOI: 10.5120/10737-5614</identifier><language>eng</language><publisher>New York: Foundation of Computer Science</publisher><subject>Algorithms ; Division ; Genetic algorithms ; Matching ; Texts</subject><ispartof>International journal of computer applications, 2013-01, Vol.64 (18), p.48-52</ispartof><rights>Copyright Foundation of Computer Science 2013</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Banerjee, Sagnik</creatorcontrib><creatorcontrib>Chakrabarti, Tamal</creatorcontrib><creatorcontrib>Sinha, Devadatta</creatorcontrib><title>Finding All Occurrences of a Pattern by a Genetic Algorithm Based Divide-and-Conquer Method</title><title>International journal of computer applications</title><description>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.</description><subject>Algorithms</subject><subject>Division</subject><subject>Genetic algorithms</subject><subject>Matching</subject><subject>Texts</subject><issn>0975-8887</issn><issn>0975-8887</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><recordid>eNpdkE1LAzEQhoMoWGov_oKAFxFW87Gbj2OttgqVetCTh5DNZtuU3aQmu0L_vVvrQZzLzAsPM8MDwCVGtwUm6A4jTnlWMJyfgBGSvMiEEPz0z3wOJilt0VBUEibzEfiYO185v4bTpoErY_oYrTc2wVBDDV9119noYbkfwsJ62zkzkOsQXbdp4b1OtoIP7stVNtO-ymbBf_Y2whfbbUJ1Ac5q3SQ7-e1j8D5_fJs9ZcvV4nk2XWYGU5JnnGpMdM6NRIQywnWNDaclrzUqkTTYMsG0LQtshKxZZUiFeCGoESWumTGIjsH1ce8uhuF86lTrkrFNo70NfVKYcUwpKiQZ0Kt_6Db00Q_fKUyERDmj9EDdHCkTQ0rR1moXXavjXmGkDqrVj2p1UE2_AVXdbfc</recordid><startdate>20130101</startdate><enddate>20130101</enddate><creator>Banerjee, Sagnik</creator><creator>Chakrabarti, Tamal</creator><creator>Sinha, Devadatta</creator><general>Foundation of Computer Science</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20130101</creationdate><title>Finding All Occurrences of a Pattern by a Genetic Algorithm Based Divide-and-Conquer Method</title><author>Banerjee, Sagnik ; Chakrabarti, Tamal ; Sinha, Devadatta</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c1324-73a12a47c9023627af1c73b7fa0b09c1e686aeb51c89f6dc2d07583c8b1f6cc03</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Algorithms</topic><topic>Division</topic><topic>Genetic algorithms</topic><topic>Matching</topic><topic>Texts</topic><toplevel>online_resources</toplevel><creatorcontrib>Banerjee, Sagnik</creatorcontrib><creatorcontrib>Chakrabarti, Tamal</creatorcontrib><creatorcontrib>Sinha, Devadatta</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>International journal of computer applications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Banerjee, Sagnik</au><au>Chakrabarti, Tamal</au><au>Sinha, Devadatta</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Finding All Occurrences of a Pattern by a Genetic Algorithm Based Divide-and-Conquer Method</atitle><jtitle>International journal of computer applications</jtitle><date>2013-01-01</date><risdate>2013</risdate><volume>64</volume><issue>18</issue><spage>48</spage><epage>52</epage><pages>48-52</pages><issn>0975-8887</issn><eissn>0975-8887</eissn><abstract>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.</abstract><cop>New York</cop><pub>Foundation of Computer Science</pub><doi>10.5120/10737-5614</doi><tpages>5</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0975-8887
ispartof International journal of computer applications, 2013-01, Vol.64 (18), p.48-52
issn 0975-8887
0975-8887
language eng
recordid cdi_proquest_miscellaneous_1671330592
source Freely Accessible Journals
subjects Algorithms
Division
Genetic algorithms
Matching
Texts
title Finding All Occurrences of a Pattern by a Genetic Algorithm Based Divide-and-Conquer Method
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T13%3A09%3A30IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Finding%20All%20Occurrences%20of%20a%20Pattern%20by%20a%20Genetic%20Algorithm%20Based%20Divide-and-Conquer%20Method&rft.jtitle=International%20journal%20of%20computer%20applications&rft.au=Banerjee,%20Sagnik&rft.date=2013-01-01&rft.volume=64&rft.issue=18&rft.spage=48&rft.epage=52&rft.pages=48-52&rft.issn=0975-8887&rft.eissn=0975-8887&rft_id=info:doi/10.5120/10737-5614&rft_dat=%3Cproquest_cross%3E1671330592%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c1324-73a12a47c9023627af1c73b7fa0b09c1e686aeb51c89f6dc2d07583c8b1f6cc03%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1289046332&rft_id=info:pmid/&rfr_iscdi=true