Languages of DNA based code words

DOI10.1007/978-3-540-24628-2_8MaRDI QIDQ5717673zbMATH OpenOpenAlexFDO

Authors Kalpana Mahalingam, Nataşa Jonoska

Publication date 10 January 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b95518

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Formal languages and automata (68Q45)

Recommendations

• Aspects of Molecular Computing
• scientific article; zbMATH DE number 1933226
• ITERATED MORPHISMS WITH COMPLEMENTARITY ON THE DNA ALPHABET
• Coding properties of DNA languages.
• Coding properties of DNA languages

Cited in

(19)

• Coding properties of DNA languages.
• On properties of bond-free DNA languages
• Hairpin structures defined by DNA trajectories
• Computing maximal Kleene closures that are embeddable in a given subword-closed language
• Iterated hairpin completions of non-crossing words
• Computing maximal Kleene closures that are embeddable in a given constrained DNA language
• Hairpin Structures in DNA Words
• scientific article; zbMATH DE number 1933226 (Why is no real title available?)
• Coding properties of DNA languages
• Some properties of involution binary relations
• Watson-Crick Partial Words
• Involutive Fibonacci words
• Dipole codes attractively encode glue functions
• Language Forbidding-Enforcing Systems Defining DNA Codewords
• DNA Coding Using the Subword Closure Operation
• Primitivity of atom Watson-Crick Fibonacci words
• Aspects of Molecular Computing
• Watson-Crick powers of a word
• Testing DNA code words properties of regular languages

This page was built for publication: Languages of DNA based code words

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