𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A comparison of three string matching algorithms

✍ Scribed by G. De V. Smit

Book ID
112209886
Publisher
John Wiley and Sons
Year
1982
Tongue
English
Weight
462 KB
Volume
12
Category
Article
ISSN
0038-0644

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

Derivation of a parallel string matching
Derivation of a parallel string matching algorithm
✍ Jayadev Misra πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 67 KB

We derive an efficient parallel algorithm to find all occurrences of a pattern string in a subject string in O(log n) time, where n is the length of the subject string. The number of processors employed is of the order of the product of the two string lengths.