DNA Coding Using the Subword Closure Operation

DOI10.1007/978-3-540-77962-9_30MaRDI QIDQ5452702zbMATH OpenOpenAlexFDO

Authors Bo Cui, Stavros Konstantinidis

Publication date 4 April 2008

Published in DNA Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-77962-9_30

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• STATE COMPLEXITY OF THE SUBWORD CLOSURE OPERATION WITH APPLICATIONS TO DNA CODING
• Computing maximal Kleene closures that are embeddable in a given constrained DNA language
• DNA Computing
• Computing maximal Kleene closures that are embeddable in a given subword-closed language
• Aspects of Molecular Computing

Cites work

• scientific article; zbMATH DE number 1953219 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 2087013 (Why is no real title available?)
• scientific article; zbMATH DE number 2087505 (Why is no real title available?)
• scientific article; zbMATH DE number 2201366 (Why is no real title available?)
• BOND-FREE LANGUAGES: FORMALIZATIONS, MAXIMALITY AND CONSTRUCTION METHODS
• DNA Computing
• DNA Computing
• DNA computing. 10th international workshop on DNA computing, DNA10, Milan, Italy, June 7--10, 2004. Revised selected papers
• DNA computing. 7th international workshop on DNA-based computers, DNA7, Tampa, FL, USA, June 10--13, 2001. Revised papers
• DNA computing. 8th internatinal workshop on DNA-based computers, DNA8, Sapporo, Japan, June 10--13, 2002. Revised papers
• DNA computing. 9th international workshop on DNA based computers, DNA9, Madison, WI, USA, June 1--3, 2003. Revised papers.

Cited in

(5)

• Computing maximal Kleene closures that are embeddable in a given subword-closed language
• scientific article; zbMATH DE number 5722790 (Why is no real title available?)
• Aspects of Molecular Computing
• STATE COMPLEXITY OF THE SUBWORD CLOSURE OPERATION WITH APPLICATIONS TO DNA CODING
• Computing maximal Kleene closures that are embeddable in a given constrained DNA language

This page was built for publication: DNA Coding Using the Subword Closure Operation

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