Construction of constant GC-content DNA codes via a variable neighbourhood search algorithm

DOI10.1007/s10852-008-9087-8zbMath1191.68229OpenAlexW1981073765MaRDI QIDQ1040788

Roberto Montemanni, Derek H. Smith

Publication date: 25 November 2009

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10852-008-9087-8

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05) Formal languages and automata (68Q45)

Related Items (6)

Construction of DNA codes by using algebraic number theory ⋮ Greedy construction of DNA codes and new bounds ⋮ Linear and nonlinear constructions of DNA codes with Hamming distance \(d\) and constant \(GC\)-content ⋮ Variable neighbourhood search: methods and applications ⋮ Variable neighbourhood search: Methods and applications ⋮ Linear and nonlinear constructions of DNA codes with Hamming distance \(d\), constant GC-content and a reverse-complement constraint

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• DNA sequence design using templates
• An exact algorithm for the maximum clique problem
• The maximum clique problem
• Bounds for DNA codes with constant GC-content
• Linear constructions for DNA codes
• Sticky-free and overhang-free DNA languages
• A new table of constant weight codes of length greater than 28
• A new table of constant weight codes
• Improved Lower Bounds for Constant GC-Content DNA Codes
• Variable neighborhood search: Principles and applications

This page was built for publication: Construction of constant GC-content DNA codes via a variable neighbourhood search algorithm