Sciweavers

216 search results - page 1 / 44
» Fast Optimal Algorithms for Computing All the Repeats in a S...
Sort
View
STRINGOLOGY
2008
13 years 5 months ago
Fast Optimal Algorithms for Computing All the Repeats in a String
Simon J. Puglisi, William F. Smyth, Munina Yusufu
ISMB
1998
13 years 5 months ago
Compression of Strings with Approximate Repeats
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...
Lloyd Allison, Timothy Edgoose, Trevor I. Dix
GECCO
2009
Springer
116views Optimization» more  GECCO 2009»
13 years 7 months ago
String- and permutation-coded genetic algorithms for the static weapon-target assignment problem
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...
Bryant A. Julstrom
GECCO
2006
Springer
282views Optimization» more  GECCO 2006»
13 years 7 months ago
A genetic algorithm for the longest common subsequence problem
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...
Brenda Hinkemeyer, Bryant A. Julstrom
RECOMB
2006
Springer
14 years 3 months ago
Simple and Fast Inverse Alignment
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...
John D. Kececioglu, Eagu Kim