๐”– Bobbio Scriptorium
โœฆ   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

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A VLSI system for string matching
โœ Alan A. Bertossi ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 636 KB
A Comparison of Approximate String Match
โœ 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