A parallel approximate string matching under Levenshtein distance on graphics processing units using warp-shuffle operations. [PDF]
PLoS ONE, 2017 Approximate string matching with k-differences has a number of practical applications, ranging from pattern recognition to computational biology. This paper proposes an efficient memory-access algorithm for parallel approximate string matching with k ...
ThienLuan Ho, Seung-Rohk Oh, HyunJin Kim
doaj +3 more sources
A memory-efficient deterministic finite automaton-based bit-split string matching scheme using pattern uniqueness in deep packet inspection. [PDF]
PLoS ONE, 2015 This paper proposes a memory-efficient bit-split string matching scheme for deep packet inspection (DPI). When the number of target patterns becomes large, the memory requirements of the string matching engine become a critical issue. The proposed string
HyunJin Kim, Kang-Il Choi, Sang-Il Choi
doaj +3 more sources
A Pipelined Non-Deterministic Finite Automaton-Based String Matching Scheme Using Merged State Transitions in an FPGA. [PDF]
PLoS ONE, 2016 This paper proposes a pipelined non-deterministic finite automaton (NFA)-based string matching scheme using field programmable gate array (FPGA) implementation.
HyunJin Kim, Kang-Il Choi
doaj +3 more sources
Using fuzzy string matching for automated assessment of listener transcripts in speech intelligibility studies. [PDF]
Behav Res Methods, 2021 Many studies of speech perception assess the intelligibility of spoken sentence stimuli by means of transcription tasks (‘type out what you hear’). The intelligibility of a given stimulus is then often expressed in terms of percentage of words correctly ...
Bosker HR.
europepmc +2 more sources
A quantum algorithm for string matching
npj Quantum Information, 2021 Algorithms that search for a pattern within a larger data-set appear ubiquitously in text and image processing. Here, we present an explicit, circuit-level implementation of a quantum pattern-matching algorithm that matches a search string (pattern) of ...
Pradeep Niroula, Yunseong Nam
doaj +2 more sources
A k-mismatch string matching for generalized edit distance using diagonal skipping method. [PDF]
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 +2 more sources
Exact String Matching Algorithms: Survey, Issues, and Future Research Directions
IEEE Access, 2019 String matching has been an extensively studied research domain in the past two decades due to its various applications in the fields of text, image, signal, and speech processing.
Saqib Iqbal Hakak +5 more
doaj +2 more sources
Entropy-Based Approach in Selection Exact String-Matching Algorithms [PDF]
Entropy, 2020 The string-matching paradigm is applied in every computer science and science branch in general. The existence of a plethora of string-matching algorithms makes it hard to choose the best one for any particular case.
Ivan Markić +3 more
doaj +2 more sources
Fast algorithms for approximate circular string matching. [PDF]
Algorithms Mol Biol, 2014 Circular string matching is a problem which naturally arises in many biological contexts. It consists in finding all occurrences of the rotations of a pattern of length m in a text of length n.
Barton C, Iliopoulos CS, Pissis SP.
europepmc +2 more sources
On String Matching with Mismatches [PDF]
Algorithms, 2015 In this paper, we consider several variants of the pattern matching with mismatches problem. In particular, given a text \(T=t_1 t_2\cdots t_n\) and a pattern \(P=p_1p_2\cdots p_m\), we investigate the following problems: (1) pattern matching with ...
Marius Nicolae, Sanguthevar Rajasekaran
doaj +2 more sources