Parallel String Matching with Multi Core Processors-A Comparative Study for Gene Sequences

α
Chinta Someswara Rao
Chinta Someswara Rao
σ
K Butchi Raju
K Butchi Raju
ρ
Dr. S. Viswanadha Raju
Dr. S. Viswanadha Raju
α Andhra University Andhra University
σ Jawaharlal Nehru Technological University, Hyderabad

Send Message

To: Author

Parallel String Matching with Multi Core Processors-A Comparative Study for Gene Sequences

Article Fingerprint

ReserarchID

28W64

Parallel String Matching with Multi Core Processors-A Comparative Study for Gene Sequences Banner

AI TAKEAWAY

Connecting with the Eternal Ground
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu

Abstract

The increase in huge amount of data is seen clearly in present days because of requirement for storing more information. To extract certain data from this large database is a very difficult task, including text processing, information retrieval, text mining, pattern recognition and DNA sequencing. So we need concurrent events and high performance computing models for extracting the data. This will create a challenge to the researchers. One of the solutions is parallel algorithms for string matching on computing models. In this we implemented parallel string matching with JAVA Multi threading with multi core processing, and performed a comparative study on Knuth Morris Pratt, Boyer Moore and Brute force string matching algorithms. For testing our system we take a gene sequence which consists of lacks of records. From the test results it is shown that the multicore processing is better compared to lower versions. Finally this proposed parallel string matching with multicore processing is better compared to other sequential approaches.

References

18 Cites in Article
  1. (2013). matching algorithms-A survey and experimental results.
  2. S Raju (2012). parallel string matching algorithm using grid.
  3. Hyunjin Kim,Kang (2010). A pattern group partitioning for parallel string matching using a pattern grouping metric.
  4. Daniel Luchaup (2011). l "speculative parallel pattern matching.
  5. Hyunjin Kim,Hong-Sik Kim,Sungho Kang (2011). A Memory-Efficient Bit-Split Parallel String Matching Using Pattern Dividing for Intrusion Detection Systems.
  6. S Charalampos String matching on a multicore gpu using cuda.
  7. Thierry Lecroq (2007). Fast exact string matching algorithms.
  8. Derek Pao,Xing Wang,Xiaoran Wang,Cong Cao,Yuesheng Zhu (2011). String Searching Engine for Virus Scanning.
  9. Hassan Ghasemzadeh (2010). structural action recognition in body sensor networks: distributed classification based on string matching.
  10. Hyunjin Kim,Seung-Woo Lee (2013). A Hardware-Based String Matching Using State Transition Compression for Deep Packet Inspection.
  11. Ali Peiravi,Mohammad Javed,Rahimzadeh (2009). A novel scalable and storage-efficient architecture for high speed exact string matching.
  12. Al Geist,Adam Beguelin,Jack Dongarra,Weicheng Jiang,Robert Manchek,Vaidyalingam Sunderam (1994). PVM.
  13. A Grama,G Karypis,V Kumar,A Gupta (2003). Introduction to Parallel Computing.
  14. Y Leow,C Ng,W (2006). Generating hardware from OpenMP programs.
  15. D Marr,F Binns,D Hill,G Hinton,D Koufaty,J Miller,M Upton (2002). Hyper-Threading Technology Architecture and Microarchitecture.
  16. Robert Boyer,J Moore (1977). A fast string searching algorithm.
  17. Donald Knuth,; James,H Morris,Vaughan Jr,Pratt (1977). Fast pattern matching in strings.
  18. Z Galil (1984). Optimal parallel algorithms for string matching.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

How to Cite This Article

Chinta Someswara Rao. 2013. \u201cParallel String Matching with Multi Core Processors-A Comparative Study for Gene Sequences\u201d. Global Journal of Computer Science and Technology - A: Hardware & Computation GJCST-A Volume 13 (GJCST Volume 13 Issue A1): .

Download Citation

Issue Cover
GJCST Volume 13 Issue A1
Pg. 27- 41
Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Version of record

v1.2

Issue date

August 1, 2013

Language
en
Experiance in AR

Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.

Read in 3D

Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.

Article Matrices
Total Views: 9663
Total Downloads: 2560
2026 Trends
Related Research

Published Article

The increase in huge amount of data is seen clearly in present days because of requirement for storing more information. To extract certain data from this large database is a very difficult task, including text processing, information retrieval, text mining, pattern recognition and DNA sequencing. So we need concurrent events and high performance computing models for extracting the data. This will create a challenge to the researchers. One of the solutions is parallel algorithms for string matching on computing models. In this we implemented parallel string matching with JAVA Multi threading with multi core processing, and performed a comparative study on Knuth Morris Pratt, Boyer Moore and Brute force string matching algorithms. For testing our system we take a gene sequence which consists of lacks of records. From the test results it is shown that the multicore processing is better compared to lower versions. Finally this proposed parallel string matching with multicore processing is better compared to other sequential approaches.

Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

Parallel String Matching with Multi Core Processors-A Comparative Study for Gene Sequences

Chinta Someswara Rao
Chinta Someswara Rao Andhra University
K Butchi Raju
K Butchi Raju Jawaharlal Nehru Technological University, Hyderabad
Dr. S. Viswanadha Raju
Dr. S. Viswanadha Raju

Research Journals