Results 51 to 60 of about 5,721,874 (232)
Optimal-Hash Exact String Matching Algorithms [PDF]
, 2023 String matching is the problem of finding all the occurrences of a pattern in a text. We propose improved versions of the fast family of string matching algorithms based on hashing $q$-grams.
Lecroq, Thierry
core +2 more sources
Improving database quality through eliminating duplicate records
Data Science Journal, 2006 Redundant or duplicate data are the most troublesome problem in database management and applications. Approximate field matching is the key solution to resolve the problem by identifying semantically equivalent string values in syntactically different ...
Mingzhen Wei +2 more
doaj +1 more source
Entropy-Based Approach in Selection Exact String-Matching Algorithms
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 +1 more source
Practical Evaluation of Lyndon Factors via Alphabet Reordering
Mathematics, 2022 We evaluate the influence of different alphabet orderings on the Lyndon factorization of a string. Experiments with Pizza&Chili datasets show that for most alphabet reorderings, the number of Lyndon factors is usually small, and the length of the longest
Marcelo K. Albertini, Felipe A. Louza
doaj +1 more source
At the roots of dictionary compression: string attractors [PDF]
Symposium on the Theory of Computing, 2017 A well-known fact in the field of lossless text compression is that high-order entropy is a weak model when the input contains long repetitions. Motivated by this fact, decades of research have generated myriads of so-called dictionary compressors ...
Dominik Kempa, N. Prezza
semanticscholar +1 more source
Text Indexing for Faster Gapped Pattern Matching
AlgorithmsWe revisit the following version of the Gapped String Indexing problem, where the goal is to preprocess a text T[1..n] to enable efficient reporting of all occ occurrences of a gapped pattern P=P1[α..β]P2 in T.
Md Helal Hossen +2 more
doaj +1 more source
Multiple String Pattern Matching Algorithm Using Multi-Character Inverted Lists
AlgorithmsMultiple string matching is a fundamental operation in real-time analytics, cybersecurity, bioinformatics, and large-scale information retrieval. Nevertheless, existing approaches continue to face inherent trade-offs among preprocessing efficiency ...
Chouvalit Khancome
doaj +1 more source
Developing JSequitur to Study the Hierarchical Structure of Biological Sequences in a Grammatical Inference Framework of String Compression Algorithms [PDF]
Genomics & Informatics, 2012 Grammatical inference methods are expected to find grammatical structures hidden in biological sequences. One hopes that studies of grammar serve as an appropriate tool for theory formation.
Bulgan Galbadrakh +2 more
doaj +1 more source
Reversible programming - a case study of two string-matching algorithms [PDF]
, 2022 String matching is a fundamental problem in algorithm. This study examines the development and construction of two reversible string-matching algorithms: a naive string-matching algorithm and the Rabin-Karp algorithm. The algorithms are used to introduce
Yokoyama, Tetsuo, Glück, Robert
core +2 more sources
ALGORITHMS FOR JUMBLED PATTERN MATCHING IN STRINGS [PDF]
International Journal of Foundations of Computer Science, 2012 The Parikh vector p(s) of a string s over a finite ordered alphabet Σ = {a1, …, aσ} is defined as the vector of multiplicities of the characters, p(s) = (p1, …, pσ), where pi = |{j | sj = ai}|. Parikh vector q occurs in s if s has a substring t with p(t) = q. The problem of searching for a query q in a text s of length n can be solved simply and worst-
Peter Burcsi +3 more
openaire +4 more sources