IDEAS home Printed from https://ideas.repec.org/a/spr/aodasc/v5y2018i2d10.1007_s40745-017-0124-1.html
   My bibliography  Save this article

Parallel String Matching with Linear Array, Butterfly and Divide and Conquer Models

Author

Listed:
  • S. Viswanadha Raju

    (JNT University Hyderabad)

  • K. K. V. V. S. Reddy

    (Rayalasheema University)

  • Chinta Someswara Rao

    (SRKR Engineering College)

Abstract

String Matching is a technique of searching a pattern in a text. It is the basic concept to extract the fruitful information from large volume of text, which is used in different applications like text processing, information retrieval, text mining, pattern recognition, DNA sequencing and data cleaning etc., . Though it is stated some of the simple mechanisms perform very well in practice, plenty of research has been published on the subject and research is still active in this area and there are ample opportunities to develop new techniques. For this purpose, this paper has proposed linear array based string matching, string matching with butterfly model and string matching with divide and conquer models for sequential and parallel environments. To assess the efficiency of the proposed models, the genome sequences of different sizes (10–100 Mb) are taken as input data set. The experimental results have shown that the proposed string matching algorithms performs very well compared to those of Brute force, KMP and Boyer moore string matching algorithms.

Suggested Citation

  • S. Viswanadha Raju & K. K. V. V. S. Reddy & Chinta Someswara Rao, 2018. "Parallel String Matching with Linear Array, Butterfly and Divide and Conquer Models," Annals of Data Science, Springer, vol. 5(2), pages 181-207, June.
    • Handle: RePEc:spr:aodasc:v:5:y:2018:i:2:d:10.1007_s40745-017-0124-1
    DOI: 10.1007/s40745-017-0124-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s40745-017-0124-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s40745-017-0124-1?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Chinta Someswara Rao & S. Viswanadha Raju, 2016. "Concurrent Information Retrieval System (IRS) for Large Volume of Data with Multiple Pattern Multiple ( $$2^\mathrm{N}$$ 2 N ) Shaft Parallel String Matching," Annals of Data Science, Springer, vol. 3(2), pages 175-203, June.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      Corrections

      All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:aodasc:v:5:y:2018:i:2:d:10.1007_s40745-017-0124-1. See general information about how to correct material in RePEc.

      If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

      If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

      For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

      Please note that corrections may take a couple of weeks to filter through the various RePEc services.

      IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.