Sciweavers

135 search results - page 3 / 27
» String Noninclusion Optimization Problems
Sort
View
ESA
2003
Springer
95views Algorithms» more  ESA 2003»
15 years 2 months ago
Sequencing by Hybridization in Few Rounds
Sequencing by Hybridization (SBH) is a method for reconstructing an unknown DNA string based on obtaining, through hybridization experiments, whether certain short strings appear ...
Dekel Tsur
MCS
2008
Springer
14 years 9 months ago
Numerical optimal control of the wave equation: optimal boundary control of a string to rest in finite time
In many real-life applications of optimal control problems with constraints in form of partial differential equations (PDEs), hyperbolic equations are involved which typically desc...
Matthias Gerdts, Günter Greif, Hans Josef Pes...
FUIN
2008
80views more  FUIN 2008»
14 years 9 months ago
External Memory Algorithms for String Problems
In this paper we present external memory algorithms for some string problems. External memory algorithms have been developed in many research areas, as the speed gap between fast ...
Kangho Roh, Maxime Crochemore, Costas S. Iliopoulo...
CORR
2011
Springer
198views Education» more  CORR 2011»
14 years 4 months ago
Pattern matching in Lempel-Ziv compressed strings: fast, simple, and deterministic
Countless variants of the Lempel-Ziv compression are widely used in many real-life applications. This paper is concerned with a natural modification of the classical pattern match...
Pawel Gawrychowski
GECCO
2009
Springer
116views Optimization» more  GECCO 2009»
15 years 1 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