Scholars Central

Research articlePublished Jan 2014

STRING MATCHING RULES USED BY VARIANTS OF BOYER-MOORE ALGORITHM

Authors: Jamuna Bhandari, Anil Kumar

Journal of Global Research in Computer Sciences

Volume 5 · Issue 1 · Pages 8–11

Ask about this article

Abstract

Select any words in the title or abstract, or press this and choose a sentence.

String matching problem is widely studied problem in computer science, mainly due to its large applications used in various fields. In this regards many string matching algorithms have been proposed. Boyer-Moore is most popular algorithm. Hence, maximum variants are proposed from Boyer-Moore (BM) algorithm. This paper addresses the variant of Boyer-Moore algorithm for finding the occurrences of a given pattern P within the text T.

Ask about this article

Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.

Try:

Similar by topic

More from this journal

The newest in Journal of Global Research in Computer Sciences.

All its articles

Conferences in this field

Upcoming conferences in this field.

Follow

New articles from what you follow go into your email digest, once you agree to alert emails.

  • JournalJournal of Global Research in Computer Sciences
  • SubjectComputer Science & IT
  • BylineArticles whose byline prints “Jamuna Bhandari”
  • BylineArticles whose byline prints “Anil Kumar”

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels