Results 11 to 20 of about 5,627 (286)
Compressed Indexes for Approximate String Matching [PDF]
Algorithmica, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ho-Leung Chan +4 more
core +7 more sources
An approximate string-matching algorithm
Theoretical Computer Science, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jong Yong Kim, John Shawe-Taylor
openaire +2 more sources
libFLASM: a software library for fixed-length approximate string matching. [PDF]
BMC Bioinformatics, 2016 BackgroundApproximate string matching is the problem of finding all factors of a given text that are at a distance at most k from a given pattern. Fixed-length approximate string matching is the problem of finding all factors of a text of length n that ...
Ayad LA, Pissis SP, Retha A.
europepmc +4 more sources
Approximate string-matching with q-grams and maximal matches
Theoretical Computer Science, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ukkonen, Esko
openaire +2 more sources
Approximate String Matching in Musical Sequences.
, 2001 Here we consider computational problems on δ-approximate and (δ, γ)-approximate string matching. These are two new notions of approximate matching that arise naturally in applications of computer assisted music analysis.
Crochemore, Maxime +3 more
core +5 more sources
Approximate String Matching with SIMD
The Computer Journal, 2021 Abstract We consider the $k$ mismatches version of approximate string matching for a single pattern and multiple patterns. For these problems, we present new algorithms utilizing the single instruction multiple data (SIMD) instruction set extensions for patterns of up to 32 characters. We apply SIMD computation in three ways: in counting
Fiori, Fernando J. +3 more
openaire +2 more sources
Designing a word recommendation application using the Levenshtein Distance algorithm
Matrix: Jurnal Manajemen Teknologi dan Informatika, 2021 Good scriptwriting or reporting requires a high level of accuracy. The basic problem is that the level of accuracy of the authors is not the same. The low level of accuracy allows for mistyping of words in a sentence.
Nadhia Nurin Syarafina +2 more
doaj +1 more source
A k-mismatch string matching for generalized edit distance using diagonal skipping method.
PLoS ONE, 2021 This paper proposes an approximate string matching with k-mismatches when calculating the generalized edit distance. When the edit distance is generalized, more sophisticated string matching can be provided.
HyunJin Kim
doaj +1 more source
IEEE Access, 2020 Current relational database systems are deterministic in nature and lack the support for approximate matching. The result of approximate matching would be the tuples annotated with the percentage of similarity but the existing relational database system ...
Amol S. Jumde, Ravindra B. Keskar
doaj +1 more source
Efficient and effectiveness retrieval of information using some of the approximate string matching algorithms [PDF]
مجلة التربية والعلم, 2008 The research aims at buliding integral computer database for sales ,by using six algorithms of approximate string matching with practicable example;soundex,information metaphone,longest common subsequence ,dice cofficient,levenshtein distance and fuzzy ...
Anhar Mohammed, Suhiar Essa
doaj +1 more source