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

Faster algorithm of string comparison

โœ Scribed by Q. X. Yang; S. S. Yuan; L. Zhao; L. Chun; S. Peng


Book ID
106256271
Publisher
Springer-Verlag
Year
2003
Tongue
English
Weight
260 KB
Volume
6
Category
Article
ISSN
1433-7541

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


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