DNA Codes and Their Properties
From MaRDI portal
Publication:5452567
DOI10.1007/11925903_10zbMATH Open1132.68401DBLPconf/dna/KariM06OpenAlexW2124342026WikidataQ62046620 ScholiaQ62046620MaRDI QIDQ5452567FDOQ5452567
Authors: Lila Kari, Kalpana Mahalingam
Publication date: 4 April 2008
Published in: DNA Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11925903_10
Recommendations
Cited In (22)
- DNA Codes Based on Stem Similarities Between DNA Sequences
- Braid groups in genetic code
- DNA Computing
- Decidability of involution hypercodes
- Duplications and pseudo-duplications
- Codes of nucleotide sequences
- Pseudo-inversion: closure properties and decidability
- Codon and amino-acid distribution in DNA
- Generalizations of code languages with marginal errors
- Coding and Cryptography
- On decidability and closure properties of language classes with respect to bio-operations
- DNA Computing
- Some properties of involution binary relations
- An easy automata based algorithm for testing coding properties of infinite sets of (DNA) words
- Generalizations of Code Languages with Marginal Errors
- Exordium for DNA codes
- Generating DNA code words using forbidding and enforcing systems
- DNA Computing
- Embedding a \(\theta \)-invariant code into a complete one
- Title not available (Why is that?)
- Dipole codes attractively encode glue functions
- Watson-Crick powers of a word
This page was built for publication: DNA Codes and Their Properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452567)