๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Improving an Algorithm for Approximate Pattern Matching

โœ Scribed by G. Navarro; R. Baeza-Yates

Publisher
Springer
Year
2001
Tongue
English
Weight
446 KB
Volume
30
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An approximate string-matching algorithm
An approximate string-matching algorithm
โœ Jong Yong Kim; John Shawe-Taylor ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 774 KB
Analysis of two-dimensional approximate
Analysis of two-dimensional approximate pattern matching algorithms
โœ Park Kunsoo ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 717 KB

We present a new and more rigorous analysis of the two algorithms for two-dimensional approximate pattern matching due to KtikkEnen and Ukkonen. We also present modifications of these algorithms that use less space while keeping the same expected time.

Approximate symbolic pattern matching fo
Approximate symbolic pattern matching for protein sequence data
โœ Bill C.H. Chang; Saman K. Halgamuge ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 365 KB

In protein sequences, often two sequences that share similar substrings have similar functional properties. Learning of the characteristics and properties of an unknown protein is much easier if its likely functional properties can be predicted by finding the substrings already known from other prot

A parallel algorithm for tree pattern ma
A parallel algorithm for tree pattern matching
โœ Koji Tarora; Tomio Hirata; Yasuyoshi Inagaki ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 814 KB

## Abstract Given a text tree __t__ and a pattern tree __p__, tree pattern matching involves finding subtrees of __t__ which match __p.__ This paper proposed a parallel algorithm for tree pattern matching. The algorithm is designed to run in __O__(log __n__) parallel time using __mn__/log__n__ proc