Search of optimal locations for species- or group-specific primer design in DNA sequences: Non-dominated Sorting Genetic Algorithm II (NSGA-II).
Kwang-Seuk JeongMinhyeok KimHyunbin JoJeong-An GimDong-Kyun KimGea-Jae JooPublished in: Ecol. Informatics (2015)
Keyphrases
- nsga ii
- dna sequences
- pareto optimal
- multi objective
- optimal solution
- test problems
- multi objective optimization
- evolutionary algorithm
- multiobjective optimization
- optimization algorithm
- optimization problems
- multiobjective evolutionary algorithm
- genetic algorithm
- multiobjective optimization problems
- multi objective differential evolution
- genomic sequences
- evolutionary multiobjective optimization
- search space
- evolutionary multiobjective
- search algorithm
- differential evolution
- motif discovery
- multi objective evolutionary algorithms
- pareto optimal set
- human genome
- constrained multi objective optimization problems
- tandem repeats
- multi objective optimisation
- dna computing
- fitness function
- bi objective
- crossover operator
- benchmark problems
- particle swarm optimization
- multi objective optimization problems
- np hard
- strength pareto evolutionary algorithm
- objective function
- tabu search
- biological sequences
- multiple objectives
- pareto optimal solutions
- knapsack problem
- solution quality
- sequence patterns
- feasible solution
- branch and bound algorithm
- metaheuristic
- lower bound
- genetic programming
- worst case
- binding sites
- special case