✦ LIBER ✦

A fast VLSI solution for approximate string matching

✍ Scribed by Roberto Grossi

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 711 KB
Volume: 13
Category: Article
ISSN: 0167-9260
DOI: 10.1016/0167-9260(92)90005-j

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fast and practical approximate string ma

Fast and practical approximate string matching

✍ Ricardo A. Baeza-Yates; Chris H. Perleberg 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 598 KB

A VLSI system for string matching

✍ Alan A. Bertossi 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 636 KB

Fast parallel and serial approximate str

Fast parallel and serial approximate string matching

✍ Gad M Landau; Uzi Vishkin 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 755 KB

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

A fast algorithm for string matching wit

A fast algorithm for string matching with mismatches

✍ A Dermouche 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 423 KB

Efficient Algorithms for Approximate Str

Efficient Algorithms for Approximate String Matching with Swaps

✍ Dong Kyue Kim; Jee-Soo Lee; Kunsoo Park; Yookun Cho 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 357 KB