51 search results - page 4 / 11 » A DNA Sticker Algorithm for Solving N-Queen Problem |
HEURISTICS
2002
14 years 9 months ago
2002
In the paper, a new hybrid genetic algorithm solving the DNA sequencing problem with negative and positive errors is presented. The algorithm has as its input a set of oligonucleo...
103
click to vote
ICDM
2006
IEEE
15 years 3 months ago
2006
IEEE
The problem of discovering arrangements of regions of high occurrence of one or more items of a given alphabet in a sequence, is studied, and two efficient approaches are propose...
100
click to vote
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
We show how a random mutation hill climber that does multilevel selection utilizes transposition to escape local optima on the discrete Hierarchical-If-And-Only-If (HIFF) problem....
126
click to vote
CCECE
2006
IEEE
15 years 3 months ago
2006
IEEE
During recent years there has been an explosive growth of biological data coming from genome projects, proteomics, protein structure determination, and the rapid expansion in digi...
TCBB
2008
14 years 9 months ago
2008
Abstract-- The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA sequences while minimizing the number of genetic transformations. To solve this NP-comp...