Cole, Richard and Hariharan, Ramesh (2000) Approximate String Matching: A Simpler Faster Algorithm. In: SIAM Journal on Computing, 31 (6). pp. 1761-1782.
![]()
|
PDF
ramesh2.pdf Download (228kB) |
Abstract
We give two algorithms for finding all approximate matches of a pattern in a text, where the edit distance between the pattern and the matching text substring is at most k. The first algorithm, which is quite simple, runs in time $O(\frac{nk^3}{m}+n+m)$ on all patterns except k-break periodic strings (defined later). The second algorithm runs in time $O(\frac{nk^4}{m}+n+m)$ on k-break periodic patterns. The two classes of patterns are easily distinguished in O(m)time.
Item Type: | Journal Article |
---|---|
Publication: | SIAM Journal on Computing |
Publisher: | Society for Industrial and Applied Mathematics |
Additional Information: | The copyright of this article belongs to the Society for Industrial and Applied Mathematics |
Keywords: | algorithms;string matching;edit distance |
Department/Centre: | Division of Electrical Sciences > Computer Science & Automation |
Date Deposited: | 08 Jun 2004 |
Last Modified: | 19 Sep 2010 04:12 |
URI: | http://eprints.iisc.ac.in/id/eprint/310 |
Actions (login required)
![]() |
View Item |