Results 251 to 260 of about 5,627 (286)

Fast approximate string matching

Software: Practice and Experience, 1988
AbstractApproximate string matching is an important operation in information systems because an input string is often an inexact match to the strings already stored. Commonly known accurate methods are computationally expensive as they compare the input string to every entry in the stored dictionary. This paper describes a two‐stage process.
Olumide Owolabi, Douglas R. McGregor
openaire   +1 more source

Approximate String Matching Techniques

Proceedings of the 16th International Conference on Enterprise Information Systems, 2014
Data quality is a key to success for all kinds of businesses that have information applications involved, such as data integration for data warehouses, text and web mining, information retrieval, search engine for web applications, etc. In such applications, matching strings is one of the popular tasks. There are a number of approximate string matching
Taoxin Peng, Calum Mackay
openaire   +1 more source

Tries for approximate string matching

IEEE Transactions on Knowledge and Data Engineering, 1996
Tries offer text searches with costs which are independent of the size of the document being searched, and so are important for large documents requiring spelling checkers, case insensitivity, and limited approximate regular secondary storage. Approximate searches, in which the search pattern differs from the document by k substitutions, transpositions,
Heping Shang, T. H. Merrett
openaire   +1 more source

VECTOR ALGORITHMS FOR APPROXIMATE STRING MATCHING

International Journal of Foundations of Computer Science, 2002
Vector algorithms allow the computation of an output vector r = r1 r2 ⋯ rm given an input vector e = e1 e2 ⋯ em in a bounded number of operations, independent of m the length of the vectors. The allowable operations are usually restricted to bit-wise operations available in processors, including shifts and binary addition with carry.
Anne Bergeron, Sylvie Hamel
openaire   +1 more source

On Approximate Jumbled Pattern Matching in Strings

Theory of Computing Systems, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Peter Burcsi, Ferdinando Cicalese, Gabriele Fici, Zsuzsanna Lipták   +3 more
openaire   +6 more sources

On approximate string matching

[Proceedings] DCC `93: Data Compression Conference, 2002
Two practical universal source coding schemes are proposed. One is an approximate fixed length string matching data compression, and the other is LZ-type quasi parsing by approximate string matching. It is shown that in the former algorithm the compression rate converges to the theoretical bound of R(D) for a large class of processes as the database ...
openaire   +1 more source

Approximate Boyer–Moore String Matching

SIAM Journal on Computing, 1993
Summary: The Boyer-Moore idea applied in exact string matching is generalized to approximate string matching. Two versions of the problem are considered. The \(k\) mismatches problem is to find all approximate occurrences of a pattern string (length \(m\)) in a text string (length \(n\)) with at most \(k\) mismatches.
Jorma Tarhio, Esko Ukkonen
openaire   +2 more sources

Multiple approximate string matching

1997
We present two new algorithms for on-line multiple approximate string matching. These are extensions of previous algorithms that search for a single pattern. The single-pattern version of the first one is based on the simulation with bits of a non-deterministic finite automaton built from the pattern and using the text as input.
Ricardo A. Baeza-Yates, Gonzalo Navarro 0001   +1 more
openaire   +1 more source

Approximate string matching for music analysis

Soft Computing, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Clifford, R, Iliopoulos, C
openaire   +3 more sources

On Approximate String Matching of Unique Oligonucleotides

2001
The current research considers the approximate string matching search for important subsequences from DNA sequences, which is essential for numerous bioinformatics computation tasks. We tested several approximate string matching algorithms and furthermore developed one for DNA data. Run times of the algorithms are important, since the amount of data is
Heikki Hyyrö, Mauno Vihinen, Martti Juhola   +2 more
openaire   +2 more sources