DNA Sequence Design by Dynamic Neighborhood Searches
- 1 January 2006
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 157-171
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Hairpin-based state machine and conformational addressing: Design and experimentNatural Computing, 2005
- Linear constructions for DNA codesTheoretical Computer Science, 2005
- Stochastic Local Search Algorithms for DNA Word Design2003
- On Template Method for DNA Sequence DesignLecture Notes in Computer Science, 2003
- DNA sequence design using templatesNew Generation Computing, 2002
- On Combinatorial DNA Word DesignJournal of Computational Biology, 2001
- Ejection chains, reference structures and alternating path methods for traveling salesman problemsDiscrete Applied Mathematics, 1996
- Molecular Computation of Solutions to Combinatorial ProblemsScience, 1994
- An Effective Heuristic Algorithm for the Traveling-Salesman ProblemOperations Research, 1973
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970