DNA codes are sets of words of fixed length n over the alphabet {A, C, G, T} which satisfy a number of combinatorial conditions. 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 three different meta-heuristic approaches for the problem are discussed, and the outcome of an extensive experimental campaign, leading to many new best-known codes, is presented.
Three metaheuristics for the construction of constant GC-content DNA codes / Montemanni, Roberto; Smith Derek, H; Koul, N. - 6(2014), pp. 167-175. ((Intervento presentato al convegno 6th International Conference on Applied Operational Research tenutosi a Vancouver Canada nel July 2014.
Data di pubblicazione: | 2014 |
Titolo: | Three metaheuristics for the construction of constant GC-content DNA codes |
Autore/i: | Montemanni, Roberto; Smith Derek, H; Koul, N |
Autore/i UNIMORE: | |
Nome del convegno: | 6th International Conference on Applied Operational Research |
Luogo del convegno: | Vancouver Canada |
Data del convegno: | July 2014 |
Volume: | 6 |
Pagina iniziale: | 167 |
Pagina finale: | 175 |
Citazione: | Three metaheuristics for the construction of constant GC-content DNA codes / Montemanni, Roberto; Smith Derek, H; Koul, N. - 6(2014), pp. 167-175. ((Intervento presentato al convegno 6th International Conference on Applied Operational Research tenutosi a Vancouver Canada nel July 2014. |
Tipologia | Relazione in Atti di Convegno |
File in questo prodotto:

I documenti presenti in Iris Unimore sono rilasciati con licenza Creative Commons Attribuzione - Non commerciale - Non opere derivate 3.0 Italia, salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris