Results 151 to 160 of about 272,212 (190)

Algorithms for string searching

ACM SIGIR Forum, 1989
We survey several algorithms for searching a string in a piece of text. We include theoretical and empirical results, as well as the actual code of each algorithm. An extensive bibliography is also included.
openaire   +1 more source

String-searching Algorithms

1990
In this chapter we introduce the abstract data type string and describe some basic string-processing operations. The purpose here is not to give a full exposition of special-purpose string-handling facilities, but instead to concentrate on string searching and emphasise the role of algorithm design. The hope is that these algorithms will further elicit
openaire   +1 more source

Algorithms for Bitmasking Strings

2006
In this paper we present algorithms for efficiently bitmasking strings. In particular, we assume a pattern (the bitmask) consisting of zeroes and ones as well as a text over an alphabet Sigma and the goal is to extract information efficiently when we apply the pattern on the text.
Bakalis, A, Iliopoulos, C, Sioutas, S, Tsichlas, K   +3 more
openaire   +1 more source

String Theory Algorithm

2021
Oscar Castillo, Luis Rodriguez
openaire   +1 more source

String searching algorithms revisited

1989
We present bounds for the average case of the Knuth-Morris-Pratt (KMP) algorithm and the Boyer-Moore-Horspool (BMH) algorithm for random text. Experimental results in both random and English text suggests that the bounds are tight. We also present a hybrid algorithm which combines the KMP and BMH algorithms, and which, in practice, is faster than the ...
openaire   +1 more source

Detecting False Matches in String-Matching Algorithms

Algorithmica, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Fast string matching algorithms for run-length coded strings

Computing, 1995
Given a run-length coded text of length 2n and a run-length coded pattern of length 2m,m≪n commonly, this paper first presents anO(n+m) time sequential algorithm for string matching, then presents anO(1) time parallel algorithm on a two-dimensionalm×n mesh with a reconfigurable bus system.
openaire   +1 more source

Noisy intermediate-scale quantum algorithms

Reviews of Modern Physics, 2022
Kishor Bharti, Alba Cervera-Lierta, Thi Ha Kyaw   +2 more
exaly  

Filter algorithms for approximate string matching

2002
In dieser Arbeit beschreiben wir neue Ergebnisse und Verfahren auf dem Gebiet der Filteralgorithmen für Aehnlichkeitssuche in Textdatenbanken. Im ersten Teil stellen wir QUASAR, die Implementierung eines verbesserten Filters basierend auf dem sogenannten q-gram Lemma, vor. Dieses Lemma basiert auf dem Vergleich von kurzen Teilwoerten und ermöglicht die
openaire   +2 more sources

Quantum Information and Algorithms for Correlated Quantum Matter

Chemical Reviews, 2021
Kade Head-Marsden, Johannes Flick, Christopher Ciccarino   +2 more
exaly