Modified Suffix Search Algorithm for Multiple String Matching

Abstract

String Matching is now a prominent field in the area of Computer Science and it has many applications in the real world. A new algorithm for Suffix Search which uses chained hashing is proposed and this works well in matched case and mismatched case. A separate hash function is introduced in this paper. Hash functions can be declared in many ways. In this, radix hashing is used and the need of the shift table used in these algorithms can be avoided. Every pattern matching algorithm consists of mainly two phases. They are the preprocessing phase and the matching phase. Each of these phases has its own time complexity as well as space complexity. The proposed method has very low time complexity in average case.

Authors and Affiliations

Jini Raju

Keywords

Related Articles

Closed Regular Pattern Mining Using Vertical Format

Discovering interesting patterns in transactional databases is often a challenging area by the length of patterns and number of transactions in data mining, which is prohibitively expensive in both time and space. Closed...

TOWARDS DEVELOPMENT OF CLOUD OPERATING SYSTEMS

Cloud operating system provides the abstraction of complex physical datacenter infrastructure by providing different interfaces for local and remote users. It manages the interaction between aplications and their interfa...

Automata-Based Software Reliability Paradigm for Ubiquitous Systems

The paper proposes a novel paradigm for accurate reliability estimation of ubiquitous systems. The proposed prototype differs from all conventional software reliability models as it does not rely on any kind of post fail...

A Novel Approach for Web Document Classification

The web is a huge repository of information and there is a need for categorizing web documents to facilitate the search and retrieval of documents. Web document classification plays an important role in information organ...

Routing and Security in Self Organizing Mobile Ad Hoc Networks (MANET): Challenges and Solutions

Ad hoc networks in general have to deal with a highly decentralized as well as a continuously changing topology due to the mobility of the nodes. MANET is not a new paradigm in wireless community. The technology is quite...

Download PDF file
  • EP ID EP87771
  • DOI -
  • Views 158
  • Downloads 0

How To Cite

Jini Raju (2013). Modified Suffix Search Algorithm for Multiple String Matching. International Journal of Computer Science & Engineering Technology, 4(9), 1212-1215. https://europub.co.uk/articles/-A-87771