DNA Sequence Design by Dynamic Neighborhood Searches
From MaRDI portal
Publication:5452570
DOI10.1007/11925903_12zbMath1132.68402OpenAlexW1604750263MaRDI QIDQ5452570
Suguru Kawashimo, Kunihiko Sadakane, Hirotaka Ono, Masafumi Yamashita
Publication date: 4 April 2008
Published in: DNA Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11925903_12
Variable Neighborhood SearchLocal SearchCombinatorial ConstraintsDNA Sequence DesignVariable Depth Search
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (2)
Variable neighbourhood search: methods and applications ⋮ Variable neighbourhood search: Methods and applications
This page was built for publication: DNA Sequence Design by Dynamic Neighborhood Searches