Sciweavers

3117 search results - page 416 / 624
» The Spatially-Dispersed Genetic Algorithm
Sort
View
TCS
2008
15 years 6 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
2004
Springer
164views Optimization» more  GECCO 2004»
15 years 12 months ago
Fuzzy Dominance Based Multi-objective GA-Simplex Hybrid Algorithms Applied to Gene Network Models
Hybrid algorithms that combine genetic algorithms with the Nelder-Mead simplex algorithm have been effective in solving certain optimization problems. In this article, we apply a s...
Praveen Koduru, Sanjoy Das, Stephen Welch, Judith ...
BMCBI
2010
146views more  BMCBI 2010»
15 years 6 months ago
Genomic selection and complex trait prediction using a fast EM algorithm applied to genome-wide markers
Background: The information provided by dense genome-wide markers using high throughput technology is of considerable potential in human disease studies and livestock breeding pro...
Ross K. Shepherd, Theo H. E. Meuwissen, John A. Wo...
ESA
2001
Springer
105views Algorithms» more  ESA 2001»
15 years 11 months ago
SNPs Problems, Complexity, and Algorithms
Abstract. Single nucleotide polymorphisms (SNPs) are the most frequent form of human genetic variation. They are of fundamental importance for a variety of applications including m...
Giuseppe Lancia, Vineet Bafna, Sorin Istrail, Ross...
GECCO
2008
Springer
186views Optimization» more  GECCO 2008»
15 years 7 months ago
A pareto following variation operator for fast-converging multiobjective evolutionary algorithms
One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate...
A. K. M. Khaled Ahsan Talukder, Michael Kirley, Ra...