Add to ORKGDNA 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
Information encoding and processing in DNA has proved to be an important problem for biomolecular co...
Encoding and processing information in DNA-, RNA- and other biomolecule-based devices is an importan...
We survey the origin, current progress and applications on one major roadblock to the development of...
DNA codes are sets of words of fixed length n over the alphabet {A, C, G, T} which satisfy a number ...
DNA codes are sets of words of fixed length n over the alphabet {A,C,G,T} which satisfy a number of ...
AbstractIn a previous paper, the authors used cyclic and extended cyclic constructions to obtain cod...
AbstractCoding theory has several applications in genetics and bioengineering. This paper constructs...
We consider the problem of designing DNA codes, namely sets of equi-length words over the alphabet f...
Coding theory has several applications in genetics and bioengineering. This paper constructs codes o...
AbstractIn this paper we translate in terms of coding theory constraints that are used in designing ...
The design of a large and reliable DNA codeword library is a key problem in DNA based computing. DN...
Coding theory has several applications in Genetics and Bioengineering. This thesis concentrates on a...
Nowadays, we produce an enormous amount of data and all this data needs to be stored somewhere. In o...
Humanity is producing data at exponential rates. Solutions need to be found in order to accommodate ...
The design of large libraries of oligonucleotides having constant GC-content and satisfying Hamming ...
Information encoding and processing in DNA has proved to be an important problem for biomolecular co...
Encoding and processing information in DNA-, RNA- and other biomolecule-based devices is an importan...
We survey the origin, current progress and applications on one major roadblock to the development of...
DNA codes are sets of words of fixed length n over the alphabet {A, C, G, T} which satisfy a number ...
DNA codes are sets of words of fixed length n over the alphabet {A,C,G,T} which satisfy a number of ...
AbstractIn a previous paper, the authors used cyclic and extended cyclic constructions to obtain cod...
AbstractCoding theory has several applications in genetics and bioengineering. This paper constructs...
We consider the problem of designing DNA codes, namely sets of equi-length words over the alphabet f...
Coding theory has several applications in genetics and bioengineering. This paper constructs codes o...
AbstractIn this paper we translate in terms of coding theory constraints that are used in designing ...
The design of a large and reliable DNA codeword library is a key problem in DNA based computing. DN...
Coding theory has several applications in Genetics and Bioengineering. This thesis concentrates on a...
Nowadays, we produce an enormous amount of data and all this data needs to be stored somewhere. In o...
Humanity is producing data at exponential rates. Solutions need to be found in order to accommodate ...
The design of large libraries of oligonucleotides having constant GC-content and satisfying Hamming ...
Information encoding and processing in DNA has proved to be an important problem for biomolecular co...
Encoding and processing information in DNA-, RNA- and other biomolecule-based devices is an importan...
We survey the origin, current progress and applications on one major roadblock to the development of...