Greedy construction of DNA codes and new bounds

DOI10.1007/s00200-019-00386-yzbMath1418.94070arXiv1505.06262OpenAlexW2201326897WikidataQ128207615 ScholiaQ128207615MaRDI QIDQ2002146

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)

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

zbMATH Keywords

upper and lower boundsedit distanceDNA codes\textit{GC}-content

Mathematics Subject Classification ID

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

Related Items

A genetic algorithm using triplet nucleotide encoding and DNA reproduction operations for unconstrained optimization problems, On codes over \(\mathbb {F}_{q}+v\mathbb {F}_{q}+v^{2}\mathbb {F}_{q}\)

Cites Work

• Unnamed Item
• Deterministic polynomial-time algorithms for designing short DNA words
• 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
• Construction of constant GC-content DNA codes via a variable neighbourhood search algorithm
• Bounds for DNA codes with constant GC-content
• Linear constructions for DNA codes
• Lexicodes over rings
• Codes for DNA Sequence Profiles
• Improved Lower Bounds for Constant GC-Content DNA Codes
• Coding and Cryptography