๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Approximate String Matching: A Simpler Faster Algorithm

โœ Scribed by Cole, Richard; Hariharan, Ramesh

Book ID
118180379
Publisher
Society for Industrial and Applied Mathematics
Year
2002
Tongue
English
Weight
235 KB
Volume
31
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Faster Approximate String Matching
Faster Approximate String Matching
โœ R. Baeza-Yates and G. Navarro ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Springer ๐ŸŒ English โš– 479 KB
An approximate string-matching algorithm
An approximate string-matching algorithm
โœ Jong Yong Kim; John Shawe-Taylor ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 774 KB
A Comparison of Approximate String Match
A Comparison of Approximate String Matching Algorithms
โœ PETTERI JOKINEN; JORMA TARHIO; ESKO UKKONEN ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 972 KB

Experimental comparisons of the running time of approximate string matching algorithms for the k differences problem are presented. Given a pattern string, a text string, and an integer k, the task is to find all approximate occurrences of the pattern in the text with at most k differences (insertio