Results 211 to 220 of about 1,296,078 (273)
Some of the next articles are maybe not open access.
Encyclopedia of Algorithms, 2019
International ...
Maxime Crochemore, T. Lecroq
semanticscholar +4 more sources
International ...
Maxime Crochemore, T. Lecroq
semanticscholar +4 more sources
Improving hash-q exact string matching algorithm with perfect hashing for DNA sequences
Comput. Biol. Medicine, 2021Exact 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
An accurate toponym-matching measure based on approximate string matching
Journal of Information Science, 2016Deniz Kilinc
exaly +2 more sources
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.
exaly +2 more sources
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.
exaly +2 more sources
Pseudo 2D String Matching Technique for High Efficiency Screen Content Coding
IEEE Transactions on Multimedia, 2016Liping Zhao, Tao Lin, Kailun Zhou
exaly +2 more sources
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 +2 more
semanticscholar +1 more source
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 +2 more
semanticscholar +1 more source
Analysis and safety engineering of fuzzy string matching algorithms.
ISA transactions, 2020In 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
ACM Computing Surveys, 1980
Approximate matching of strings is reviewed with the aim of surveying techniques suitable for finding an item in a database when there may be a spelling mistake or other error in the keyword. The methods found are classified as either equivalence or similarity problems. Equivalence problems are seen to be readily solved using canonical forms.
Patrick A. V. Hall, Geoff R. Dowling
openaire +1 more source
Approximate matching of strings is reviewed with the aim of surveying techniques suitable for finding an item in a database when there may be a spelling mistake or other error in the keyword. The methods found are classified as either equivalence or similarity problems. Equivalence problems are seen to be readily solved using canonical forms.
Patrick A. V. Hall, Geoff R. Dowling
openaire +1 more source
String matching in Lempel-Ziv compressed strings
Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC '95, 1995zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Martin Farach, Mikkel Thorup
openaire +2 more sources
String Matching on the Internet
2005We consider a variant of the “string searching in database” problem where the string database comes on a data stream, and processing the data is at a premium but querying is not a runtime bottleneck. Speci.cally, the strings to be searched into (let's call them the documents) have to be processed online very e.ciently, meaning the documents have to be ...
Hervé Brönnimann +2 more
openaire +1 more source