first
prev
toc
next
last
Download Citation
Recommend
Mark
Alert
Link
Print
A NEW STRING MATCHING ALGORITHM
Authors:
Mustaq Ahmed a;
M. Kaykobad a;
Rezaul Alam Chowdhury b
| Affiliations: | a Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology, Dhaka-1000, Bangladesh. |
| b Department of Computer Science, University of Texas at Austin, Texas, USA. |
DOI:
10.1080/0020716031000087113
Publication Frequency:
15 issues per year
Published in:
International Journal of Computer Mathematics,
Volume
80,
Issue
7
July
2003
, pages 825
- 834
International Journal of Computer Mathematics,
Volume
80,
Issue
7
July
2003
, pages 825
- 834
Subjects:
Analysis - Mathematics;
Bioinformatics;
Computer Mathematics;
Discrete Mathematics;
Mathematical Finance;
Mathematical Logic;
Mathematical Numerical Analysis;
Systems & Computer Architecture;
Number of References: 20
Formats available:
PDF
(English)
Article Requests:
Order Reprints
:
Request Permissions
-
Single Article Purchase:
US$37.00
-
buy now
-
Sign In
- Online Sample
add to cart 
[ show other buying options ]
View Article:
View Article (PDF)
Abstract
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.
|
| Keywords: String Matching; Complexity; Boyer-Moore Algorithm |
| view references (20) |
|
Bookmark with:
|
CiteULike
Del.icio.us
BibSonomy
Connotea
More bookmarks
