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

An Insight about Current Research Ideas in Wireless Communication-A Review

In the telecommunications sector, wireless industry has proliferated its growth to such an extent that everyone in the world is a user of some form of developing technology. Wireless communications is one of the most cel...

Optimum Design of Composite Plates under Thermal Buckling Loads using Imperialist Competitive Algorithm

Thermal buckling loads of laminated composite plates are maximized for a given total thickness. Fiber directions and relative thickness of layers are considered as design variables. Analysis of buckling temperature is ca...

Prediction of Road Accidents in Delhi using Back Propagation Neural Network Model

Road accidents cause more than 1,35,000 deaths in India every year which is higher than any other country in the world. Increasing motorization without adequate institutional mechanism is a major cause of this problem. A...

A Novel Technique for Image Compression in Hand Written Recognition using Back Propagation in Neural Network

The handwritten symbol recognition plays an important role in present communication systems. In the data communication systems, all the data have to be recorded, encoded and will be communicated with other systems. Prese...

Medical Disease Diagnosis Using Structuring Text

Medical diagnosis is an important domain of research which aids to identify the occurrence of a disease. The paper proposes a novel glide path to knowledge discovery in medical systems by acquiring relevant information f...

Download PDF file
  • EP ID EP87771
  • DOI -
  • Views 123
  • 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