𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An approximate string-matching algorithm

✍ Scribed by Jong Yong Kim; John Shawe-Taylor

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
774 KB
Volume
92
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Simple Optimal String Matching Algorithm
Simple Optimal String Matching Algorithm
✍ Cyril Allauzen; Mathieu Raffinot πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 140 KB

We present a new string matching algorithm optimal on average (with equiprobability and independence of letters, in O m + n log m/m , where n is the size of the text and m the size of the searched word, both taken on an alphabet ) and linear in the worst case (in O m + n ). Of all the algorithms tha