✦ LIBER ✦

String matching with simple devices

✍ Scribed by Holger Petersen

Book ID: 108153539
Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 100 KB
Volume: 105
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2007.07.011

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Simple and efficient string matching wit

Simple and efficient string matching with k mismatches

✍ R. Grossi; F. Luccio 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 875 KB

Simple real-time constant-space string m

Simple real-time constant-space string matching

✍ Breslauer, Dany; Grossi, Roberto; Mignosi, Filippo 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 316 KB

String matching with lookahead

✍ Peltola, Hannu; Tarhio, Jorma 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 554 KB

Fast String Matching with Mismatches

✍ R.A. Baezayates; G.H. Gonnet 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 427 KB

String matching with alphabet sampling

✍ Francisco Claude; Gonzalo Navarro; Hannu Peltola; Leena Salmela; Jorma Tarhio 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 771 KB