Linear and nonlinear constructions of DNA codes with Hamming distance d and constant GC-content
- 6 July 2011
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 311 (13) , 1207-1219
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- An ant colony optimization algorithm for DNA sequencing by hybridizationComputers & Operations Research, 2008
- Construction of Constant GC-Content DNA Codes via a Variable Neighbourhood Search AlgorithmJournal of Mathematical Modelling and Algorithms, 2008
- The quest for error correction in biologyIEEE Engineering in Medicine and Biology Magazine, 2006
- Linear constructions for DNA codesTheoretical Computer Science, 2005
- Bounds for DNA Codes with Constant GC-ContentThe Electronic Journal of Combinatorics, 2003
- On Combinatorial DNA Word DesignJournal of Computational Biology, 2001
- Quantum error correction via codes over GF(4)IEEE Transactions on Information Theory, 1998
- Demonstration of a word design strategy for DNA computing on surfacesNucleic Acids Research, 1997
- Modular andp-adic cyclic codesDesigns, Codes and Cryptography, 1995
- Encoded combinatorial chemistry.Proceedings of the National Academy of Sciences, 1992