Greedy construction of DNA codes and new bounds

DOI10.1007/S00200-019-00386-YzbMATH Open1418.94070arXiv1505.06262OpenAlexW2201326897WikidataQ128207615 ScholiaQ128207615MaRDI QIDQ2002146FDOQ2002146

Authors: Nabil Bennenni, T. Aaron Gulliver, Kenza Guenda 

Publication date: 11 July 2019

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Abstract: In this paper, we construct linear codes over $mathbb{Z}_4$ with bounded $GC$-content. The codes are obtained using a greedy algorithm over $mathbb{Z}_4$. Further, upper and lower bounds are derived for the maximum size of DNA codes of length $n$ with constant $GC$-content $w$ and edit distance $d$.

Full work available at URL: https://arxiv.org/abs/1505.06262

Recommendations

• Bounds for DNA codes with constant GC-content
• Construction of cyclic codes over \(\mathrm{GF}(4)\) for DNA computing
• Linear constructions for DNA codes
• Linear and nonlinear constructions of DNA codes with Hamming distance \(d\) and constant \(GC\)-content
• DNA codes based on additive self-dual codes over \(\mathrm{GF}(4)\)

zbMATH Keywords

edit distanceupper and lower boundsDNA codes\textit{GC}-content

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Linear codes (general theory) (94B05)

Cites Work

• Linear constructions for DNA codes
• Bounds for DNA codes with constant GC-content
• Title not available (Why is that?)
• Coding and Cryptography
• Deterministic polynomial-time algorithms for designing short DNA words
• Improved Lower Bounds for Constant GC-Content DNA Codes
• Construction of constant GC-content DNA codes via a variable neighbourhood search algorithm
• Linear and nonlinear constructions of DNA codes with Hamming distance \(d\) and constant \(GC\)-content
• Linear and nonlinear constructions of DNA codes with Hamming distance \(d\), constant GC-content and a reverse-complement constraint
• Lexicodes over rings
• Codes for DNA Sequence Profiles

Cited In (8)

• DNA Computing
• Linear and nonlinear constructions of DNA codes with Hamming distance \(d\) and constant \(GC\)-content
• Construction of constant GC-content DNA codes via a variable neighbourhood search algorithm
• Improved Lower Bounds for Constant GC-Content DNA Codes
• A genetic algorithm using triplet nucleotide encoding and DNA reproduction operations for unconstrained optimization problems
• Bounds for DNA codes with constant GC-content
• On codes over \(\mathbb {F}_{q}+v\mathbb {F}_{q}+v^{2}\mathbb {F}_{q}\)
• A Geometric Approach to Gibbs Energy Landscapes and Optimal DNA Codeword Design

This page was built for publication: Greedy construction of DNA codes and new bounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2002146)