Results 221 to 230 of about 1,047,077 (291)

String Matching

Encyclopedia of Algorithms, 2014
International ...
Crochemore, Maxime, Lecroq, Thierry
openaire   +3 more sources

Multiple String Matching

Encyclopedia of Algorithms, 2014
International ...
Crochemore, Maxime, Lecroq, Thierry
openaire   +3 more sources

Improving hash-q exact string matching algorithm with perfect hashing for DNA sequences

Comput. Biol. Medicine, 2021
Exact string matching algorithms involve finding all occurrences of a pattern P in a text T. These algorithms have been extensively studied in computer science, primarily because of their applications in various fields such as text search and ...
Abdullah Ammar Karcioglu, H. Bulut
semanticscholar   +1 more source

Graphs Cannot Be Indexed in Polynomial Time for Sub-quadratic Time String Matching, Unless SETH Fails

Conference on Current Trends in Theory and Practice of Informatics, 2020
We consider the following string matching problem on a node-labeled graph $G=(V,E)$: given a pattern string $P$, decide whether there exists a path in $G$ whose concatenation of node labels equals $P$.
Massimo Equi, V. Mäkinen, Alexandru I. Tomescu   +2 more
semanticscholar   +1 more source

Analysis and safety engineering of fuzzy string matching algorithms.

ISA transactions, 2020
In this paper we explore fuzzy string matching in an automatic ticket classification and processing system. We compare performance of the following string similarity algorithms: Longest Common Subsequence (LCS), Dice coefficient, Cosine Similarity ...
M. Pikies, Junade Ali
semanticscholar   +1 more source

Parallel String Matching Algorithms

Kybernetes, 1988
The string searching problem is central to many information retrieval and text editing applications. The Brute Force algorithm is inefficient in some cases and in this article four other algorithms are discussed, of which the Boyer‐Moore and the Improved Boyer‐Moore are found to be the fastest.
Evans, D. J., Ghanemi, S.
openaire   +1 more source

Generalized String Matching

SIAM Journal on Computing, 1987
Summary: Given a pattern string of length n and an object string of length m, the string matching problem asks for the positions of all occurrences of the pattern in the object string. This paper investigates a generalization of string matching, in which the pattern is a sequence of pattern elements, each compatible with a set of symbols.
openaire   +1 more source

Faster Approximate String Matching

Algorithmica, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Baeza-Yates, R., Navarro, G.
openaire   +2 more sources

String matching in Lempel-Ziv compressed strings

Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC '95, 1995
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Farach, Martin, Thorup, Mikkel
openaire   +2 more sources

Constant-Space String-Matching

1988
We present a string-matching algorithm with the following properties: it is linear in time with a small multiplicative constant during all its phases; it preprocesses the string and scans the searched text with constant memory space in addition to the strings.
openaire   +2 more sources