Results 261 to 270 of about 5,627 (286)

On approximate string matching

1983
An algorithm is given for computing the edit distance as well as the corresponding sequence of editing steps (insertions, deletions, changes, transpositions of adjacent symbols) between two strings a1a2...am and b1b2...bn. The algorithm needs time 0(s·min(m,n)) and space 0(s2) where s is the edit distance, that is, the minimum number of editing steps ...
openaire   +1 more source

Fast approximate string matching in a dictionary

Proceedings. String Processing and Information Retrieval: A South American Symposium (Cat. No.98EX207), 2002
A successful technique to search large textual databases allowing errors relies on an online search in the vocabulary of the text. To reduce the time of that online search, we index the vocabulary as a metric space. We show that with reasonable space overhead we can improve by a factor of two over the fastest online algorithms, when the tolerated error
Ricardo A. Baeza-Yates, Gonzalo Navarro 0001   +1 more
openaire   +1 more source

Approximate String Matching for Self-Indexes

2016 Data Compression Conference (DCC), 2016
Self-index is a compressed data structure that stores index of T (of length n) very efficiently and allows exact string matching (to locate all occurrences of P of length m) in m steps. Moreover it allows to obtain any substring of T so it may replace the original text.
Lukas Hrbek, Jan Holub 0001
openaire   +1 more source

Indexing Structures for Approximate String Matching

2003
In this paper we give the first, to our knowledge, structures and corresponding algorithms for approximate indexing, by considering the Hamming distance, having the following properties. i) Their size is linear times a polylog of the size of the text on average. ii) For each pattern x, the time spent by our algorithms for finding the list occ(x) of all
A. GABRIELE, MIGNOSI, FILIPPO, A. RESTIVO, M. SCIORTINO   +3 more
openaire   +1 more source

Filter algorithms for approximate string matching

2002
In dieser Arbeit beschreiben wir neue Ergebnisse und Verfahren auf dem Gebiet der Filteralgorithmen für Aehnlichkeitssuche in Textdatenbanken. Im ersten Teil stellen wir QUASAR, die Implementierung eines verbesserten Filters basierend auf dem sogenannten q-gram Lemma, vor. Dieses Lemma basiert auf dem Vergleich von kurzen Teilwoerten und ermöglicht die
openaire   +3 more sources

A systolic array for approximate string matching

Proceedings of 1993 IEEE International Conference on Computer Design ICCD'93, 2002
The edit distance between two strings is defined as the minimum cost of a sequence of editing operations (insertions, deletions and substitutions) that convert one string into the other. This paper presents a linear systolic array for computing the edit distance between two strings over a given alphabet. An encoding scheme is proposed which reduces the
Raghu Sastry, N. Ranganathan
openaire   +1 more source

A faster algorithm for approximate string matching

1996
We present a new algorithm for on-line approximate string matching. The algorithm is based on the simulation of a non-deterministic finite automaton built from the pattern and using the text as input. This simulation uses bit operations on a RAM machine with word length O(log n), being n the maximum size of the text.
Ricardo A. Baeza-Yates, Gonzalo Navarro 0001   +1 more
openaire   +1 more source

Approximate string matching and local similarity

1994
The best known rigorous method for biological sequence comparison has been the algorithm of Smith and Waterman. It computes in quadratic time the highest scoring local alignment of two sequences given a (nonmetric) similarity measure and gap penalty. In this paper, we describe how the distance-based sublinear expected time algorithm of Chang and Lawler
William I. Chang, Thomas G. Marr
openaire   +1 more source

Approximate string matching by finite automata

1995
Approximate string matching is a sequential problem and therefore it is possible to solve it using finite automata. A nondeterministic finite automaton is constructed for string matching with k mismatches. It is shown, how “dynamic programming” and “shift- and” based algorithms simulate this nondeterministic finite automaton.
openaire   +1 more source

Approximate Online Matching of Circular Strings

2014
Recently a fast algorithm based on the BNDM algorithm has been presented for exact matching of circular strings. From this algorithm, we derive several sublinear methods for approximate online matching of circular strings. The applicability of the new algorithms is demonstrated with practical experiments.
Tommi Hirvola, Jorma Tarhio
openaire   +1 more source