✦ LIBER ✦

String matching with alphabet sampling

✍ Scribed by Francisco Claude; Gonzalo Navarro; Hannu Peltola; Leena Salmela; Jorma Tarhio

Book ID: 113699031
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 771 KB
Volume: 11
Category: Article
ISSN: 1570-8667
DOI: 10.1016/j.jda.2010.09.004

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Shift-or string matching with super-alph

Shift-or string matching with super-alphabets

✍ Kimmo Fredriksson 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 75 KB

Given a text T [1 . . . n] and a pattern P [1 . . . m] over some alphabet Σ of size σ , we want to find all the (exact) occurrences of P in T . The well-known shift-or algorithm solves this problem in time O(n m/w ), where w is the number of bits in machine word, using bit-parallelism. We show how t

String Matching in the DNA Alphabet

✍ JORMA TARHIO; HANNU PELTOLA 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 89 KB

Searching for long DNA strings is studied. A q-gram variation of the Boyer-Moore algorithm is considered. An alphabet transformation with precomputed tables is utilized to reduce the processing time. Experimental results show that the new algorithm is efficient in practice.

String-matching on ordered alphabets

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

Approximate Boyer-Moore String Matching

Approximate Boyer-Moore String Matching for Small Alphabets

✍ Leena Salmela; Jorma Tarhio; Petri Kalsi 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 477 KB

String matching with lookahead

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

Sampling with a String

✍ Amin Boumenirr; Ahmed I. Zayed 📂 Article 📅 2002 🏛 SP Birkhäuser Verlag Boston 🌐 English ⚖ 151 KB