Construction of Constant GC-Content DNA Codes via a Variable Neighbourhood Search Algorithm

Article

DOI: 10.1007/s10852-008-9087-8

Cite this article as:
Montemanni, R. & Smith, D.H. J Math Model Algor (2008) 7: 311. doi:10.1007/s10852-008-9087-8

Abstract

DNA codes are sets of words of fixed length n over the alphabet {A,C,G,T} which satisfy a number of combinatorial conditions. They have application in DNA computing, in DNA microarray technologies and as molecular bar codes. The combinatorial conditions considered are (i) minimum Hamming distance d, (ii) fixed GC content and, in some cases (iii) minimum distance d between any codeword and the reverse Watson-Crick complement of any codeword. The problem is to find DNA codes with the maximum number of codewords. In this paper the construction of DNA codes is studied from an algorithmic perspective. Four local search algorithms are developed and combined in a variable neighbourhood search framework. The algorithm has been run extensively. Over 254 problems considered, it was able to match or improve the best known lower bounds in 180 cases, with 52 new bests.

Keywords

DNA codes Lower bounds Heuristic algorithms Variable neighbourhood search 

Mathematics Subject Classifications (2000)

94B60 68T20 92D20 

Copyright information

© Springer Science+Business Media B.V. 2008

Authors and Affiliations

  1. 1.Istituto Dalle Molle di Studi sull’Intelligenza Artificiale (IDSIA)Lugano-MannoSwitzerland
  2. 2.Division of Mathematics and StatisticsUniversity of GlamorganWalesUK