Results 261 to 270 of about 274,129 (290)

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

q‐frame hash comparison based exact string matching algorithms for DNA sequences

Concurrency Computation Practice and Experience, 2022
Abdullah Ammar Karcioglu, Hasan Bulut
exaly  

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

Near-Optimal Quantum Algorithms for String Problems

Algorithmica, 2023
Shyan Akmal
exaly  

Quantum Algorithms for Some Strings Problems Based on Quantum String Comparator

Mathematics, 2022
Kamil Khadiev, Jevgenijs Vihrovs
exaly  

Algorithms on strings

Choice Reviews Online, 2008
openaire   +1 more source

Fast exact string matching algorithms

Information Processing Letters, 2007
Thierry Lecroq
exaly  

Subexponential algorithms for variants of the homomorphism problem in string graphs

Journal of Computer and System Sciences, 2020
Karolina Okrasa, Paweł Rzazewski
exaly  

Experimental results on string matching algorithms

Software - Practice and Experience, 1995
Thierry Lecroq
exaly  

String Algorithms

2007
openaire   +1 more source