APPLYING A Q-GRAM BASED MULTIPLE STRING MATCHING ALGORITHM FOR APPROXIMATE MATCHING
Informatyka, Automatyka, Pomiary w Gospodarce i Ochronie Środowiska, 2017 We consider the application of multiple pattern matching (Multi AOSO on q-Grams) algorithm for approximate pattern matching. We propose the on-line approach which translates the problem from approximate pattern matching into a multiple pattern one ...
Robert Susik
doaj +1 more source
Hamming Distance Tolerant Content-Addressable Memory (HD-CAM) for DNA Classification
IEEE Access, 2022 This paper proposes a novel Hamming distance tolerant content-addressable memory (HD-CAM) for energy-efficient in-memory approximate matching applications.
Esteban Garzon +7 more
doaj +1 more source
Approximate pattern matching on elastic-degenerate text [PDF]
Theoretical Computer Science, 2020 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
G. Bernardini (Giulia) +3 more
openaire +4 more sources
The Hybrid of Jaro-Winkler and Rabin-Karp Algorithm in Detecting Indonesian Text Similarity
JOIN: Jurnal Online Informatika, 2021 The String-matching technique is part of the similarity technique. This technique can detect the similarity level of the text. The Rabin-Karp is an algorithm of string-matching type.
Muhamad Arief Yulianto +1 more
doaj +1 more source
Streaming k-Edit Approximate Pattern Matching via String Decomposition [PDF]
, 2023 In this paper we give an algorithm for streaming k-edit approximate pattern matching which uses space Õ(k²) and time Õ(k²) per arriving symbol. This improves substantially on the recent algorithm of Kociumaka, Porat and Starikovskaya [Kociumaka et al.,
Bhattacharya, Sudatta, Koucký, Michal
core +1 more source
Approximate Personal Name-Matching Through Finite-State Graphs [PDF]
, 2007 This article shows how finite-state methods can be employed in a new and different task: the conflation of personal name variants in standard forms. In bibliographic databases and citation index systems, variant forms create problems of inaccuracy that ...
De-Moya-Anegón, Félix +3 more
core +1 more source
An Improved Algorithm GVSPM-F for Electrical Impedance Tomography
IEEE Access, 2021 The generalized vector sampled pattern matching (GVSPM) algorithm is widely utilized in the EIT (electrical impedance tomography) reconstruction to solve the ill-posed inverse problem. An improved algorithm, which is called the generalized vector sampled
Xi He +6 more
doaj +1 more source
On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching [PDF]
, 2016 We present parallel algorithms for exact and approximate pattern matching with suffix arrays, using a CREW-PRAM with p processors. Given a static text of length n, we first show how to compute the suffix array interval of a given pattern of length m in O(
Kurpicz, Florian +2 more
core +1 more source
A Technique for Discovering Similarities between Texts Based on Extracting Features from the Text [PDF]
مجلة جامعة الانبار للعلوم الصرفة, 2019 The discovery of the similarity between two texts is very important and useful in many applications. The similarity between texts is the core research area of dataset, data warehouse, and data mining.
Alaa Abdalqahar Jihad, Mortadha M. Hamad
doaj +1 more source
Pan-genome de Bruijn graph using the bidirectional FM-index
BMC Bioinformatics, 2023 Background Pan-genome graphs are gaining importance in the field of bioinformatics as data structures to represent and jointly analyze multiple genomes. Compacted de Bruijn graphs are inherently suited for this purpose, as their graph topology naturally ...
Lore Depuydt +3 more
doaj +1 more source