216 search results - page 1 / 44 » Fast Optimal Algorithms for Computing All the Repeats in a S... |
STRINGOLOGY
2008
14 years 8 months ago
2008
ISMB
1998
14 years 8 months ago
1998
We describe a model for strings of characters that is loosely based on the Lempel Ziv model with the addition that a repeated substring can be an approximate match to the original...
GECCO
2009
Springer
14 years 11 months ago
2009
Springer
In the Weapon-Target Assignment Problem, m enemy targets are inbound, each with a value Vj representing the damage it may do. The defense has n weapons, and the probability that w...
GECCO
2006
Springer
14 years 10 months ago
2006
Springer
A genetic algorithm for the longest common subsequence problem encodes candidate sequences as binary strings that indicate subsequences of the shortest or first string. Its fitnes...
RECOMB
2006
Springer
15 years 7 months ago
2006
Springer
For as long as biologists have been computing alignments of sequences, the question of what values to use for scoring substitutions and gaps has persisted. While some choices for s...