Results 151 to 160 of about 83,132 (184)

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,
H. Shang, T.H. Merrettal
openaire   +1 more source

Approximate Matching of Run-Length Compressed Strings

Algorithmica, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mäkinen, Veli, Ukkonen, Esko, Navarro, Gonzalo   +2 more
openaire   +2 more sources

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

Approximate string matching with gaps.

2002
Summary: We consider several new versions of approximate string matching with gaps. The main characteristic of these new versions is the existence of gaps in the matching of a given pattern in a text. Algorithms are devised for each version and their time and space complexities are stated.
Crochemore, Maxime, Iliopoulos, Costas S., Makris, C., Rytter, Wojciech, Tsakalidis, A., Tsichlas, K.   +5 more
openaire   +2 more sources

Approximate string matching using withinword parallelism

Software: Practice and Experience, 1994
AbstractGiven a text string, a pattern string, and an integer k, the problem of approximate string matching with k differences is to find all substrings of the text string whose edit distance from the pattern string is less than k. The edit distance between two strings is defined as the minimum number of differences, where a difference can be a ...
openaire   +2 more sources

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   +2 more sources

ffgrep: Scalable Approximate String Matching

SSRN Electronic Journal, 2019
Approximate substring searching is a common but computationally demanding task in bioinformatics and text analysis. We present a new approach that recasts string search as a multiple convolution problem, then exploits highly efficient fast Fourier convolution techniques.
openaire   +1 more source

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
H, Hyyrö, M, Vihinen, M, Juhola
openaire   +2 more sources

Using Signature Hashing for Approximate String Matching

Computational Mathematics and Modeling, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Integrative oncology: Addressing the global challenges of cancer prevention and treatment

Ca-A Cancer Journal for Clinicians, 2022
Jun J Mao,, Msce, Lorenzo Cohen, Karen M Mustian   +2 more
exaly