Results 91 to 100 of about 5,721,874 (232)
A Survey of String Matching Algorithms [PDF]
, 2020 The concept of string matching algorithms are playing an important role of string algorithms in finding a place where one or several strings (patterns) are found in a large body of text (e.g., data streaming, a sentence, a paragraph, a book, etc.).
Koloud Al-Khamaiseh, Shadi Alshagarin
core
Improved algorithms for approximate string matching (extended abstract)
BMC Bioinformatics, 2009 Background The problem of approximate string matching is important in many different areas such as computational biology, text processing and pattern recognition.
Papamichail Georgios +1 more
doaj +1 more source
String Matching Problems with Parallel Approaches An Evaluation for the Most Recent Studies [PDF]
, 2013 In recent years string matching plays a functional role in many application like information retrieval, gene analysis, pattern recognition, linguistics, bioinformatics etc.
Chinta Someswara Rao
core +1 more source
PMS6MC: A Multicore Algorithm for Motif Discovery
Algorithms, 2013 We develop an efficient multicore algorithm, PMS6MC, for the (l; d)-motif discovery problem in which we are to find all strings of length l that appear in every string of a given set of strings with at most d mismatches. PMS6MC is based on PMS6, which is
Shibdas Bandyopadhyay +2 more
doaj +1 more source
Approximation Algorithms for String Folding Problems [PDF]
, 2000 We present polynomial-time approximation algorithms for string folding problems over any finite alphabet. Our idea is the following: describe a class of feasible solutions by means of an ambiguous context-free grammar (i.e. there is a bijection between the set of parse trees and a subset of possible embeddings of the string); give a score to every ...
Giancarlo Mauri, Giulio Pavesi
openaire +1 more source
ARO-The Scientific Journal of Koya University, 2017 This paper aims to introduce an optimized Damerau–Levenshtein and dice-coefficients using enumeration operations (ODADNEN) for providing fast string similarity measure with maintaining the results accuracy; searching to find specific words within a large
Safa S. Abdul-Jabbar, Loay E. George
doaj +1 more source
Optimal Character Distance Sampling for Exact String Matching Through Set Cover Reformulation
IEEE AccessCharacter Distance Sampling (CDS) is part of a broader class of string matching techniques that leverage sampling strategies. These methods provide an effective compromise between the prohibitive space requirements of offline approaches and the high ...
Simone Faro +2 more
doaj +1 more source
Algorithms for approximate string matching
Information and Control, 1985 This is a revised and expanded version of the author's paper in Lect. Notes Comput. Sci. 158, 487-495 (1983; Zbl 0532.68088).
openaire +2 more sources
An improved algorithm for approximate string matching
SIAM Journal on Computing, 1989 Given a text string, a pattern string, and an integer k, a new algorithm for finding all occurrences of the pattern string in the text string with at most k differences is presented. Both its theoretical and practical variants improve the known algorithms.
Galil, Zvi, Park, Kunsoo
openaire +3 more sources
An Improved String-Searching Algorithm and Its Application in Component Security Testing
Tsinghua Science and Technology, 2016 Mass monitor logs are produced during the process of component security testing. In order to mine the explicit and implicit security exception information of the tested component, the log should be searched for keyword strings.
Jinfu Chen +6 more
doaj +1 more source