Name
Abstract | ||
|---|---|---|
In this study, we construct a cyclic DNA code that satisfies the Watson−Crick model, i.e., the reverse and the complement of any codeword are codewords. Similar to irreducible cyclic codes, we use the trace function over a finite field extension to generate our DNA code. MacWilliams–Seery algorithm to evaluate the weight distribution of binary irreducible cyclic codes is used to observe the GC-content distribution of our code. Then, a simple algorithm is proposed to select a sub-code with constant GC-content. Therefore, this sub-code would be a cyclic, reverse-complement, and constant GC-content DNA code. A few illustrative examples show the appropriateness of our algorithm for generating over 100000 DNA strands of length n > 1000 and a predefined constant GC-content. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.23919/ISITA.2018.8664300 | 2018 International Symposium on Information Theory and Its Applications (ISITA) |
Keywords | Field | DocType |
DNA,Generators,Organisms,Computational modeling,Zinc,Parity check codes,Mathematics | Discrete mathematics,Finite field,Computer science,Genetic code,Code word,Trace (linear algebra),GC-content,SIMPLE algorithm,Weight distribution,Binary number | Conference |
ISBN | Citations | PageRank |
978-4-88552-318-2 | 0 | 0.34 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ramy F. Taki El-Din | 1 | 3 | 1.12 |
| Hajime Matsui | 2 | 18 | 8.14 |