Bounds for DNA codes with constant GC-content
The electronic journal of combinatorics, Tome 10 (2003)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We derive theoretical upper and lower bounds on the maximum size of DNA codes of length $n$ with constant GC-content $w$ and minimum Hamming distance $d$, both with and without the additional constraint that the minimum Hamming distance between any codeword and the reverse-complement of any codeword be at least $d$. We also explicitly construct codes that are larger than the best previously-published codes for many choices of the parameters $n$, $d$ and $w$.
DOI : 10.37236/1726
Classification : 94B65
Mots-clés : constant-weight codes, DNA codes
@article{10_37236_1726,
     author = {Oliver D. King},
     title = {Bounds for {DNA} codes with constant {GC-content}},
     journal = {The electronic journal of combinatorics},
     year = {2003},
     volume = {10},
     doi = {10.37236/1726},
     zbl = {1030.94049},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1726/}
}
TY  - JOUR
AU  - Oliver D. King
TI  - Bounds for DNA codes with constant GC-content
JO  - The electronic journal of combinatorics
PY  - 2003
VL  - 10
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1726/
DO  - 10.37236/1726
ID  - 10_37236_1726
ER  - 
%0 Journal Article
%A Oliver D. King
%T Bounds for DNA codes with constant GC-content
%J The electronic journal of combinatorics
%D 2003
%V 10
%U http://geodesic.mathdoc.fr/articles/10.37236/1726/
%R 10.37236/1726
%F 10_37236_1726
Oliver D. King. Bounds for DNA codes with constant GC-content. The electronic journal of combinatorics, Tome 10 (2003). doi: 10.37236/1726

Cité par Sources :