This paper presents a new approach for automatic concept extraction, using grammatical
parsers and Latent Semantic Analysis. The methodology is described, also the tool used to …

The algorithmic task of computing the Hamming distance between a given pattern of length
m and each location in a text of length n, both over a general alphabet\Sigma, is one of the …

In many pattern matching applications the text has some properties attached to its various
parts. Pattern Matching with Properties (Property Matching, for short), involves a string …

Approximate matching is one of the fundamental problems in pattern matching, and a
ubiquitous problem in real applications. The Hamming distance is a simple and well studied …

We consider the question of finding an approximate period in a given string S of length n. Let
S′ be a periodic string closest to S under some distance metric. We consider this distance …

The algorithmic tasks of computing the Hamming distance between a given pattern of length
m and each location in a text of length n is one of the most fundamental algorithmic tasks in …

Sequence comparison is a fundamental task in pattern matching. Its applications include file
comparison, spelling correction, information retrieval, and computing (dis) similarities …

Abstract Pattern Matching with Properties (Property Matching, for short), involves a string
matching between the pattern and the text, and the requirement that the text part satisfies …

Finding the similarity between two sequences is a major problem in computer science. It is
motivated by many issues from computational biology as well as from information retrieval …

There is no known algorithm that solves the general case of the approximate edit distance
problem, where the edit operations are insertion, deletion, mismatch, and swap, in time o …