Sciweavers

697 search results - page 48 / 140
» Improving EAs for Sequencing Problems
Sort
View
EVOW
2005
Springer
14 years 2 months ago
Population Training Heuristics
This work describes a new way of employing problem-specific heuristics to improve evolutionary algorithms: the Population Training Heuristic (PTH). The PTH employs heuristics in ...
Alexandre César Muniz de Oliveira, Luiz Ant...
BMCBI
2008
178views more  BMCBI 2008»
13 years 9 months ago
A discriminative method for protein remote homology detection and fold recognition combining Top-n-grams and latent semantic ana
Background: Protein remote homology detection and fold recognition are central problems in bioinformatics. Currently, discriminative methods based on support vector machine (SVM) ...
Bin Liu, Xiaolong Wang, Lei Lin, Qiwen Dong, Xuan ...
TCS
2008
13 years 9 months ago
Algorithms for computing variants of the longest common subsequence problem
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
Costas S. Iliopoulos, M. Sohel Rahman
GECCO
2010
Springer
206views Optimization» more  GECCO 2010»
14 years 15 days ago
Development of efficient particle swarm optimizers by using concepts from evolutionary algorithms
Particle swarm optimization (PSO) has been in practice for more than 10 years now and has gained wide popularity in various optimization tasks. In the context to single objective ...
Kalyanmoy Deb, Nikhil Padhye
ALMOB
2006
155views more  ALMOB 2006»
13 years 9 months ago
Refining motifs by improving information content scores using neighborhood profile search
The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The mo...
Chandan K. Reddy, Yao-Chung Weng, Hsiao-Dong Chian...