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
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
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 +2 more sources
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 +2 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 +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
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 +3 more sources
String-matching with OBDDs [PDF]
Theoretical Computer Science, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Choffrut, Christian, Haddad, Yael
openaire +3 more sources
String matching under a general matching relation [PDF]
Information and Computation, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hariharan, R., Muthukrishnan, S.
openaire +5 more sources
Parallel String Matching [PDF]
, 2017 We explore the benefits of parallelizing 7 state-of-the-art string matching algorithms. Using SIMD and multi-threading techniques we achieve a significant performance improvement of up to 43.3x over reference implementations and a speedup of up to 16.7x over the string matching program grep.
Philip Pfaffe +4 more
openaire +4 more sources