A New String Matching Algorithm

In this paper a new exact string-matching algorithm with sub-linear average case complexity has been presented. Unlike other sub-linear string-matching algorithms it never performs more than n text character comparisons while working on a text of length n . It requires only O ( m +σ) extra pre-proce...

Full description

Saved in:
Bibliographic Details
Published inInternational journal of computer mathematics Vol. 80; no. 7; pp. 825 - 834
Main Authors Ahmed, Mustaq, Kaykobad, M., Chowdhury, Rezaul Alam
Format Journal Article
LanguageEnglish
Published Abingdon Taylor & Francis Group 01.07.2003
Taylor and Francis
Subjects
Algorithmics. Computability. Computer arithmetics
Applied sciences
Artificial intelligence
Boyer-Moore Algorithm
Complexity
Computer science; control theory; systems
Data processing. List processing. Character string processing
Exact sciences and technology
Memory organisation. Data processing
Pattern recognition. Digital image processing. Computational geometry
Software
String Matching
Theoretical computing
Alphabet
Text mining
String matching
Algorithm complexity
Boyer Moore algorithm
Processing time
Pattern recognition
Algorithm
Online AccessGet full text

Cover

More Information
Summary:In this paper a new exact string-matching algorithm with sub-linear average case complexity has been presented. Unlike other sub-linear string-matching algorithms it never performs more than n text character comparisons while working on a text of length n . It requires only O ( m +σ) extra pre-processing time and space, where m is the length of the pattern and σ is the size of the alphabet.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0020-7160
1029-0265
DOI:10.1080/0020716031000087113