Bounds for DNA codes with constant GC-content

Electronic Journal of Combinatorics

Volumn 10, Issue 1 R, 2003, Pages

  King, Oliver D ^a  

^a HARVARD MEDICAL SCHOOL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 3042524729     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1726     Document Type: Article

References (25)

1. M. Arita and S. Kobayashi. DNA sequence design using templates. New Generation Computing, vol. 20 (2002), 263-277.
2. G. T. Bogdanova, A. E. Brouwer, S. N. Kapralov, and P. R. J. Östergård. Error-correcting codes over an alphabet of four elements. Designs, Codes and Cryptography, vol. 23 (2001), 333-342.
3. A. E. Brouwer. Bounds on the size of linear codes. In Handbook of Coding Theory (editors V. S. Pless and W. C. Huffman), North-Holland, 1998, pp. 295-461,
4. A. E. Brouwer, J. B. Shearer, N. J. A. Sloane, and W. D. Smith. A new table of constant weight codes. IEEE Trans. Inform. Theory, vol. 36 (1990), 1334-1380.
5. A. R. Calderbank, E. M. Rains, P. W. Shor, and N. J. A. Sloane. Quantum error correction via codes over GF(4), IEEE Trans. Inform. Theory, vol. 44 (1998) 1369-1387.
6. J. H. Conway and N. J. A. Sloane. Lexicographic codes: error-correcting codes from game theory. IEEE Trans. Inform. Theory, vol. 32 (1986), 337-348.
7. k and generalized designs. Discrete Math., vol. 169 (1997), 55-82.
8. D. Faulhammer, A. R. Cukras, R. J. Lipton, and L. F. Landweber. Molecular computation: RNA solutions to chess problems. PNAS, vol. 97 (2000), 1385-1389.
9. A. G. Frutos, Q. Liu, A. J. Thiel, A. M. W. Sanner, A. E. Condon, L. M. Smith and R. M. Corn. Demonstration of a word design strategy for DNA computing on surfaces. Nucleic Acids Research, vol. 25 (1997), 4748-4757.
10. G. Höhn. Self-dual codes over the Kleinian four group. Preprint, available electronically at arXiv:math.CO/0005266.
11. S. M. Johnson. A new upper bound for error-correcting codes. IRE Trans. Inform. Theory, vol. 8 (1962), 203-207.
12. S. M. Johnson. Upper bounds for constant weight error-correcting codes. Discrete Math., vol. 3 (1972), 109-124.
13. S. Kobayashi, T. Kondo, M. Arita. On template method for DNA sequence design. In DNA Computing: 8th International Workshop on DNA-Based Computers (editors M. Hagiya and A. Ohuchi), Springer LNCS vol. 2568, 2002, pp. 205-214.
14. M. Li, H. J. Lee, A. E. Condon, and R. M. Corn. DNA word design strategy for creating sets of non-interacting oligonucleotides for DNA microarrays. Langmuir, vol. 18 (2002), 805-812.
15. S. Litsyn. An updated tables of the best binary codes known. In Handbook of Coding Theory (editors V. S. Pless and W. C. Huffman), North-Holland, 1998, pp. 463-498,
16. F. J. MacWilliams and N. J. A. Sloane. The Theory of Error-Correcting Codes, North Holland, 1977.
17. A. Marathe, A. E. Condon, and R. M. Corn. On combinatorial DNA word design. Journal of Computational Biology, vol. 8 (2001), 201-220.
18. K. U. Mir. A restricted genetic alphabet for DNA computing. In DNA Based Computers II (editors L. F. Landweber and E. B. Baum), AMS/DIMACS, 1999, pp. 243-246.
19. P. R. J. Östergård and M. Svanström. Ternary constant weight codes. Electronic Journal of Combinatorics, vol. 9 (2002), R41, 23pp.
20. V. S. Pless, W. C. Huffman and R. A. Brualdi. An introduction to algebraic codes. In Handbook of Coding Theory (editors V. S. Pless and W. C. Huffman), North-Holland, 1998, pp. 3-139,
21. N. V. Semakov and V. A. Zinoviev. Balanced codes and tactical configurations. Problems Inform. Transmission, vol. 5 (1969), 22-28.
22. M. Svanström, P. R. J. Östergård, and G. T. Bogdanova. Bounds and constructions for ternary constant-composition codes. IEEE Trans. Inform. Theory, vol. 48 (2002), 101-111.
23. D. C. Tulpan, H. H. Hoos, and A. E. Condon. Stochastic local search algorithms for DNA word design. In DNA Computing: 8th International Workshop on DNA-Based Computers (editors M. Hagiya and A. Ohuchi), Springer LNCS vol. 2568, 2002, pp. 229-241.
24. D. C. Tulpan and H. H. Hoos. Hybrid randomised neighbourhoods improve stochastic local search for DNA Code design. In Advances in Artificial Intelligence: 16th Conference of the Canadian Society for Computational Studies of Intelligence (editors Y. Xiang and B. Chaib-draa), Springer LNCS vol. 2671, 2003, pp. 418-433.
25. 3(n, d). Discrete Applied Math., vol. 45 (1993), 71-87.