Bounds for DNA codes with constant GC-content

Details Bounds for DNA codes with constant GC-content Bounds for DNA codes with constant GC-content

2003-06-12

arxiv.org/abs/math/0306197v2

Electronic Journal of Combinatorics, vol. 10 (2003), R33, 13pp

Mathematics

Combinatorics

13 pages, no figures; a few references added and typos corrected

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Bounds for DNA codes with constant GC-content does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Bounds for DNA codes with constant GC-content, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bounds for DNA codes with constant GC-content will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-408347