𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Approximate Jumbled Pattern Matching in Strings

✍ Scribed by Péter Burcsi; Ferdinando Cicalese; Gabriele Fici; Zsuzsanna Lipták

Publisher
Springer
Year
2011
Tongue
English
Weight
590 KB
Volume
50
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Experiments on string matching in memory
Experiments on string matching in memory structures
✍ Thierry Lecroq 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 59 KB 👁 1 views

Various string matching algorithms have been designed and some experimental work on string matching over bounded alphabets has been performed, but string matching over unbounded alphabets has been little investigated. We present here experimental results where symbols are taken among potentially inf