A combinatorial optimization approach for diverse motif finding applications.
Elena ZaslavskyMona SinghPublished in: Algorithms Mol. Biol. (2006)
Keyphrases
- combinatorial optimization
- motif finding
- memetic algorithm
- combinatorial optimization problems
- traveling salesman problem
- biological sequences
- simulated annealing
- metaheuristic
- branch and bound algorithm
- motif discovery
- vehicle routing problem
- branch and bound
- job shop scheduling problem
- optimization problems
- dna sequences
- optimal solution
- sequence data
- genetic algorithm ga
- binding sites
- evolutionary algorithm
- search space