<?xml version="1.0" encoding="UTF-8"?>
<article article-type="research-article" xml:lang="en" xmlns:xlink="http://www.w3.org/1999/xlink">
<front>
<journal-meta>
<journal-id journal-id-type="publisher">global-journal-of-computer-science-and-technology-c-software-data-engineering</journal-id>
<journal-title-group>
<journal-title>Global Journal of Computer Science and Technology - C: Software &amp; Data Engineering</journal-title>
</journal-title-group>
<issn publication-format="print">0975-4350</issn>
<issn publication-format="electronic">0975-4172</issn>
<publisher><publisher-name>Global Journals Publishing Group Incorporated</publisher-name></publisher>
<self-uri xlink:href="https://globaljournals.org/journal-seo-export/jats/89384.xml" />
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">89384</article-id>
<title-group>
<article-title>String Matching Problems with Parallel Approaches An Evaluation for the Most Recent Studies</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author"><name><surname>Rao</surname><given-names>Chinta Someswara</given-names></name><xref ref-type="aff" rid="aff1" />
</contrib>
</contrib-group>
<aff id="aff1">INDIA, SRKR Engineering College affiliated to Andhra University</aff>
<pub-date publication-format="electronic" date-type="pub" iso-8601-date="2013-01-15">
<day>15</day>
<month>01</month>
<year>2013</year>
</pub-date>
<volume>13</volume>
<issue>C11</issue>
<fpage>9</fpage>
<lpage>18</lpage>
<abstract><p>In recent years string matching plays a functional role in many application like information retrieval, gene analysis, pattern recognition, linguistics, bioinformatics etc. For understanding the functional requirements of string matching algorithms, we surveyed the real time parallel string matching patterns to handle the current trends. Primarily, in this paper, we focus on present developments of parallel string matching, and the central ideas of the algorithms and their complexities. We present the performance of the different algorithms and their effectiveness. Finally this analysis helps the researchers to develop the better techniques.</p></abstract>
<kwd-group kwd-group-type="author-generated">
<kwd>text processing</kwd>
<kwd>irs</kwd>
<kwd>string matching</kwd>
<kwd>parallel algorithms.</kwd>
</kwd-group>
<self-uri content-type="pdf" xlink:href="https://globaljournals.org/GJCST_Volume13/1-String-Matching-Problems-with-Parallel.pdf" />
<self-uri content-type="html" xlink:href="https://globaljournals.org/scholarly-articles/string-matching-problems-with-parallel-approaches-an-evaluation-for-the-most-recent-studies/" />
</article-meta>
</front>
<body>
<sec>
<title>Full Text</title>
<p>In recent years string matching plays a functional role in many application like information retrieval, gene analysis, pattern recognition, linguistics, bioinformatics etc. For understanding the functional requirements of string matching algorithms, we surveyed the real time parallel string matching patterns to handle the current trends. Primarily, in this paper, we focus on present developments of parallel string matching, and the central ideas of the algorithms and their complexities. We present the performance of the different algorithms and their effectiveness. Finally this analysis helps the researchers to develop the better techniques.</p>
</sec>
</body>
</article>