38 search results - page 5 / 8 » Variable Length Genomes for Evolutionary Algorithms |
BMCBI
2008
13 years 7 months ago
2008
Background: Many programs have been developed to identify transcription factor binding sites. However, most of them are not able to infer two-word motifs with variable spacer leng...
BMCBI
2010
13 years 7 months ago
2010
Background: Sequence alignments form part of many investigations in molecular biology, including the determination of phylogenetic relationships, the prediction of protein structu...
RECOMB
2006
Springer
14 years 7 months ago
2006
Springer
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
GECCO
2006
Springer
13 years 10 months ago
2006
Springer
1 Learnable Evolution Model (LEM) is a form of non-Darwinian evolutionary computation that employs machine learning to guide evolutionary processes. Its main novelty are new type o...
APIN
2002
13 years 6 months ago
2002
This paper proposes a few steps to escape structured extensive representations for objects, in the context of evolutionary Topological Optimum Design (TOD) problems: early results ...