Results 171 to 180 of about 70,442,116 (202)

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   +2 more sources

A Clause String DNA Algorithm for SAT

2002
A DNA algorithm for SAT, the satisfiability of propositional formulae, is presented where the number of separation steps is given by the number of clauses of the instance. This represents a computational improvement for DNA algorithms based on Adleman and Lipton's extraction model, where the number of separations equates the number of literals of the ...
Manca, V, ZANDRON, CLAUDIO
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

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   +2 more sources

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   +3 more sources

Algorithms for string and graph layout.

2004
Many graph optimization problems can be viewed as graph layout problems. A layout of a graph is a geometric arrangement of the vertices subject to given constraints. For example, the vertices of a graph can be arranged on a line or a circle, on a two- or three-dimensional lattice, etc.
openaire   +1 more source

The WM-q Multiple Exact String Matching Algorithm for DNA Sequences

Computers in Biology and Medicine, 2021
Abdullah Ammar Karcioglu, Hasan Bulut
exaly  

Improving Hash-q Exact String Matching Algorithm With Perfect Hashing for DNA Sequences

Computers in Biology and Medicine, 2021
Abdullah Ammar Karcioglu, Hasan Bulut
exaly  

Profiling and Accelerating String Matching Algorithms in Three Network Content Security Applications

IEEE Communications Surveys and Tutorials, 2006
Ying-Dar Lin
exaly  

Algorithms on strings

Choice Reviews Online, 2008
openaire   +1 more source