216 search results - page 6 / 44 » Fast Optimal Algorithms for Computing All the Repeats in a S... |
PR
2011
13 years 3 months ago
2011
This paper introduces a simple Sum-over-Paths (SoP) formulation of string edit distances accounting for all possible alignments between two sequences, and extends related previous...
ALGORITHMICA
2005
13 years 8 months ago
2005
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
IPPS
2003
IEEE
14 years 1 months ago
2003
IEEE
We have developed a new algorithm that allows the exhaustive determination of words of up to 12 nucleotides in DNA sequences. It is fast enough as to be used at a genomic scale ru...
GECCO
2005
Springer
14 years 2 months ago
2005
Springer
Augmenting an evolutionary algorithm with knowledge of its target problem can yield a more effective algorithm, as this presentation illustrates. The Quadratic Knapsack Problem e...
MASCOTS
2010
13 years 10 months ago
2010
Execution and communication traces are central to performance modeling and analysis. Since the traces can be very long, meaningful compression and extraction of representative beha...