𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fast parallel and serial approximate string matching

✍ Scribed by Gad M Landau; Uzi Vishkin

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
755 KB
Volume
10
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Word-oriented approximate string matchin
Word-oriented approximate string matching using occurrence heuristic tables: A heuristic for searching Arabic text
✍ Suleiman H. Mustafa πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 143 KB πŸ‘ 2 views

## Abstract In this article, a word‐oriented approximate string matching approach for searching Arabic text is presented. The distance between a pair of words is determined on the basis of aligning the two words by using occurrence heuristic tables. Two words are considered related if they have the

A fast BNM (Best Neighborhood Matching):
A fast BNM (Best Neighborhood Matching): Algorithm and parallel processing for image restoration
✍ Wen Li; David Zhang; Zhiyong Liu; Xiangzhen Qiao πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 744 KB

## Abstract Best Neighborhood Matching (BNM) algorithm is a good approach of error concealment in terms of restored image quality. However, this kind of error concealment algorithm is commonly computation‐intensive, which restricts their real applications on large‐scale image or video sequence rest