✦ LIBER ✦

On-line string matching with feedback

✍ Scribed by Peter Johansen

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 916 KB
Volume: 141
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)00184-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

String-matching on ordered alphabets

✍ Maxime Crochemore 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 975 KB

Fast string matching with k differences

✍ Gad M. Landau; Uzi Vishkin 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 953 KB

Efficient string matching with k mismatc

Efficient string matching with k mismatches

✍ Gad M. Landau; Uzi Vishkin 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 575 KB

Parallel string matching with k mismatch

Parallel string matching with k mismatches

✍ Zvi Galil; Raffaele Giancarlo 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 928 KB

String matching with left-to-right netwo

String matching with left-to-right networks

✍ Jens Gregor; Robert S. Harris 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 409 KB

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