Sciweavers

738 search results - page 60 / 148
» Crossover can provably be useful in evolutionary computation
Sort
View
SAC
2003
ACM
15 years 3 months ago
Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
Günther R. Raidl, Bryant A. Julstrom
BMCBI
2008
133views more  BMCBI 2008»
14 years 10 months ago
CORE_TF: a user-friendly interface to identify evolutionary conserved transcription factor binding sites in sets of co-regulated
Background: The identification of transcription factor binding sites is difficult since they are only a small number of nucleotides in size, resulting in large numbers of false po...
Matthew S. Hestand, Michiel van Galen, Michel P. V...
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
15 years 3 months ago
MDGA: motif discovery using a genetic algorithm
Computationally identifying transcription factor binding sites in the promoter regions of genes is an important problem in computational biology and has been under intensive resea...
Dongsheng Che, Yinglei Song, Khaled Rasheed
BMCBI
2010
141views more  BMCBI 2010»
14 years 10 months ago
Computing and visually analyzing mutual information in molecular co-evolution
Background: Selective pressure in molecular evolution leads to uneven distributions of amino acids and nucleotides. In fact one observes correlations among such constituents due t...
Sebastian Bremm, Tobias Schreck, Patrick Boba, Ste...
BMCBI
2008
102views more  BMCBI 2008»
14 years 10 months ago
Monitoring the evolutionary aspect of the Gene Ontology to enhance predictability and usability
Background: Much effort is currently made to develop the Gene Ontology (GO). Due to the dynamic nature of information it addresses, GO undergoes constant updates whose results are...
Jong C. Park, Tak-eun Kim, Jinah Park