Sciweavers

135 search results - page 16 / 27
» String Noninclusion Optimization Problems
Sort
View
GECCO
2003
Springer
15 years 2 months ago
A Kernighan-Lin Local Improvement Heuristic That Solves Some Hard Problems in Genetic Algorithms
We present a Kernighan-Lin style local improvement heuristic for genetic algorithms. We analyze the run-time cost of the heuristic. We demonstrate through experiments that the heur...
William A. Greene
GECCO
2006
Springer
116views Optimization» more  GECCO 2006»
15 years 1 months ago
A crossover for complex building blocks overlapping
We propose a crossover method to combine complexly overlapping building blocks (BBs). Although there have been several techniques to identify linkage sets of loci o form a BB [4, ...
Miwako Tsuji, Masaharu Munetomo, Kiyoshi Akama
TCBB
2008
103views more  TCBB 2008»
14 years 9 months ago
DNA Motif Representation with Nucleotide Dependency
The problem of discovering novel motifs of binding sites is important to the understanding of gene regulatory networks. Motifs are generally represented by matrices (PWM or PSSM) o...
Francis Y. L. Chin, Henry C. M. Leung
DIS
2001
Springer
15 years 2 months ago
A Practical Algorithm to Find the Best Episode Patterns
Episode pattern is a generalized concept of subsequence pattern where the length of substring containing the subsequence is bounded. Given two sets of strings, consider an optimiza...
Masahiro Hirao, Shunsuke Inenaga, Ayumi Shinohara,...
FSTTCS
2003
Springer
15 years 2 months ago
Comparing Sequences with Segment Rearrangements
Computational genomics involves comparing sequences based on “similarity” for detecting evolutionary and functional relationships. Until very recently, available portions of th...
Funda Ergün, S. Muthukrishnan, Süleyman ...