DNA Sequence Design by Dynamic Neighborhood Searches

DOI10.1007/11925903_12MaRDI QIDQ5452570zbMATH OpenOpenAlexFDO

Authors Suguru Kawashimo, Hirotaka Ono, Kunihiko Sadakane, 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

zbMATH Keywords

Combinatorial ConstraintsDNA Sequence DesignLocal SearchVariable Depth SearchVariable Neighborhood Search

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Construction of constant GC-content DNA codes via a variable neighbourhood search algorithm
• scientific article; zbMATH DE number 1953221
• The optimization of DNA encodings based on GA/SA algorithms
• Automata, Languages and Programming
• Randomized fast design of short DNA words

Cited in

(9)

• Variable neighbourhood search: Methods and applications
• Construction of constant GC-content DNA codes via a variable neighbourhood search algorithm
• Randomized fast design of short DNA words
• scientific article; zbMATH DE number 1953219 (Why is no real title available?)
• scientific article; zbMATH DE number 1953221 (Why is no real title available?)
• scientific article; zbMATH DE number 1953222 (Why is no real title available?)
• scientific article; zbMATH DE number 2087013 (Why is no real title available?)
• DNA library screening, pooling design and unitary spaces
• Variable neighbourhood search: methods and applications

This page was built for publication: DNA Sequence Design by Dynamic Neighborhood Searches

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452570)