### 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(nk^{3}/m+n+m) on all patterns except mostly periodic strings (defined later). The second algorithm runs in time O(nk^{4}/m+n+m) on mostly periodic patterns. The two classes of patterns are easily distinguished in O(m) time.

Original language | English (US) |
---|---|

Title of host publication | Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms |

Editors | Anon |

Publisher | SIAM |

Pages | 463-472 |

Number of pages | 10 |

State | Published - 1998 |

Event | Proceedings of the 1998 9th Annual ACM SIAM Symposium on Discrete Algorithms - San Francisco, CA, USA Duration: Jan 25 1998 → Jan 27 1998 |

### Other

Other | Proceedings of the 1998 9th Annual ACM SIAM Symposium on Discrete Algorithms |
---|---|

City | San Francisco, CA, USA |

Period | 1/25/98 → 1/27/98 |

### Fingerprint

### ASJC Scopus subject areas

- Chemical Health and Safety
- Software
- Safety, Risk, Reliability and Quality
- Discrete Mathematics and Combinatorics

### Cite this

*Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms*(pp. 463-472). SIAM.

**Approximate string matching : A simpler faster algorithm.** / Cole, Richard; Hariharan, Ramesh.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms.*SIAM, pp. 463-472, Proceedings of the 1998 9th Annual ACM SIAM Symposium on Discrete Algorithms, San Francisco, CA, USA, 1/25/98.

}

TY - GEN

T1 - Approximate string matching

T2 - A simpler faster algorithm

AU - Cole, Richard

AU - Hariharan, Ramesh

PY - 1998

Y1 - 1998

N2 - 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(nk3/m+n+m) on all patterns except mostly periodic strings (defined later). The second algorithm runs in time O(nk4/m+n+m) on mostly periodic patterns. The two classes of patterns are easily distinguished in O(m) time.

AB - 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(nk3/m+n+m) on all patterns except mostly periodic strings (defined later). The second algorithm runs in time O(nk4/m+n+m) on mostly periodic patterns. The two classes of patterns are easily distinguished in O(m) time.

UR - http://www.scopus.com/inward/record.url?scp=0032256006&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032256006&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0032256006

SP - 463

EP - 472

BT - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

A2 - Anon, null

PB - SIAM

ER -