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

Fast and practical approximate string matching

โœ Scribed by Ricardo A. Baeza-Yates; Chris H. Perleberg


Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
598 KB
Volume
59
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


An approximate string-matching algorithm
โœ Jong Yong Kim; John Shawe-Taylor ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 774 KB
Fast parallel string prefix-matching
โœ Dany Breslauer ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 761 KB
A Comparison of Approximate String Match
โœ 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

Fast string matching with k differences
โœ Gad M. Landau; Uzi Vishkin ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 953 KB