Results 251 to 260 of about 148,669 (285)

Simple Optimal String Matching Algorithm

Journal of Algorithms, 2000
Summary: We present a new string matching algorithm optimal on average (with equiprobability and independence of letters, in \(O(m+ n\log_{|\Sigma|} m/m)\), where \(n\) is the size of the text and \(m\) the size of the searched word, both taken on an alphabet \(\Sigma\)) and linear in the worst case (in \(O(m+ n)\)).
Allauzen, Cyril, Raffinot, Mathieu
openaire   +2 more sources

String matching algorithms and automata

1994
In this paper we study the structure of finite automata recognizing sets of the form A*p, for some word p, and use the results obtained to improve the Knuth-Morris-Pratt string searching algorithm. We also determine the average number of nontrivial edges of the above automata.
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

Algorithms for String Pattern Discovery

2007
Pattern discovery from string data is an important problem with many applications. In this paper, we give a brief overview of our work on the optimal correlated pattern discovery problem, which integrates numerical attribute information into the string pattern discovery process.
openaire   +1 more source

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

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

Algorithms for knapsacks, paths and strings

In dieser Doktorarbeit untersuchen wir drei Probleme: 1. Knapsack: Knapsack ist ein klassisches kombinatorisches Optimierungsproblem. Wir präsentieren eine Sammlung von verbesserten exakten und approximativen Algorithmen für Knapsack und einige seiner Varianten.
openaire   +2 more sources

Efficient pattern matching in elastic-degenerate strings

Information and Computation, 2021
Costas S Iliopoulos, Ritu Kundu, Solon P Pissis   +2 more
exaly  

Algorithms on strings

Choice Reviews Online, 2008
openaire   +1 more source

Analysis of Algorithms for Listing Equivalence Classes of k-ary Strings

SIAM Journal on Discrete Mathematics, 1998
Andrzej Proskurowski, Frank Ruskey
exaly