Approximate string matching: A simpler faster algorithm

Richard Cole, Ramesh Hariharan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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(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.

Original languageEnglish (US)
Title of host publicationProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
Editors Anon
PublisherSIAM
Pages463-472
Number of pages10
StatePublished - 1998
EventProceedings of the 1998 9th Annual ACM SIAM Symposium on Discrete Algorithms - San Francisco, CA, USA
Duration: Jan 25 1998Jan 27 1998

Other

OtherProceedings of the 1998 9th Annual ACM SIAM Symposium on Discrete Algorithms
CitySan Francisco, CA, USA
Period1/25/981/27/98

Fingerprint

Approximate String Matching
Fast Algorithm
Edit Distance
Strings

ASJC Scopus subject areas

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

Cite this

Cole, R., & Hariharan, R. (1998). Approximate string matching: A simpler faster algorithm. In Anon (Ed.), 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.

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. ed. / Anon. SIAM, 1998. p. 463-472.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Cole, R & Hariharan, R 1998, Approximate string matching: A simpler faster algorithm. in Anon (ed.), 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.
Cole R, Hariharan R. Approximate string matching: A simpler faster algorithm. In Anon, editor, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM. 1998. p. 463-472
Cole, Richard ; Hariharan, Ramesh. / Approximate string matching : A simpler faster algorithm. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. editor / Anon. SIAM, 1998. pp. 463-472
@inproceedings{58123ad0fdc64ae08dc6831fa2d97855,
title = "Approximate string matching: A simpler faster algorithm",
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(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.",
author = "Richard Cole and Ramesh Hariharan",
year = "1998",
language = "English (US)",
pages = "463--472",
editor = "Anon",
booktitle = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",
publisher = "SIAM",

}

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 -