Chitra Upadhyay - Academia.edu (original) (raw)

Chitra Upadhyay

Related Authors

Science Park Research Organization & Counselling

Christian Lovis

IJERA Journal

IJERA Journal

International Journal of Engineering Research and Applications (IJERA)

Saad Ali Qureshi

IJSRD - International Journal for Scientific Research and Development

Daniel Matthias

Adiela Samuel R.

Ikechi Oriji

Suleiman H Mustafa

Er Kumari

Uploads

Papers by Chitra Upadhyay

Research paper thumbnail of COMPARATIVE ANALYSIS ON EFFICIENCY OF SINGLE STRING PATTERN MATCHING ALGORITHMS

Abstract-Data is stored in different forms but, text remains the main form of exchanging informat... more Abstract-Data is stored in different forms but, text remains the main form of exchanging information. The manipulation of text involves several problems among which pattern matching is one of them.Pattern-matching is routinely used in various computer applications, like editors, retrieval of information etc. Pattern-matching algorithm matches the pattern exactly or approximately within the text. This paper presents the Comparative Analysis of various Pattern String matching algorithms. The highly efficient algorithms like The Brute Force Algorithm, The Karp-Rabin Algorithm, and The Boyer Moore Algorithm are used for exact or approximate patternmatching on diverse systems. After performing a detailed study on the above mentioned algorithms

Research paper thumbnail of COMPARATIVE ANALYSIS ON EFFICIENCY OF SINGLE STRING PATTERN MATCHING ALGORITHMS

Abstract-Data is stored in different forms but, text remains the main form of exchanging informat... more Abstract-Data is stored in different forms but, text remains the main form of exchanging information. The manipulation of text involves several problems among which pattern matching is one of them.Pattern-matching is routinely used in various computer applications, like editors, retrieval of information etc. Pattern-matching algorithm matches the pattern exactly or approximately within the text. This paper presents the Comparative Analysis of various Pattern String matching algorithms. The highly efficient algorithms like The Brute Force Algorithm, The Karp-Rabin Algorithm, and The Boyer Moore Algorithm are used for exact or approximate patternmatching on diverse systems. After performing a detailed study on the above mentioned algorithms

Log In