𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A string pattern—matching algorithm

✍ Scribed by Daniel K. Chang

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
944 KB
Volume
22
Category
Article
ISSN
0164-1212

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Fastest Pattern Matching in Strings
Fastest Pattern Matching in Strings
✍ L. Colussi 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 850 KB

An algorithm is presented that substantially improves the algorithm of Boyer and Moore for pattern matching in strings, both in the worst case and in the average. Both the Boyer and Moore algorithm and the new algorithm assume that the characters in the pattern and in the text are taken from a given

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