DNA coding using the subword closure operation

Authors:
Bo Cui;Stavros Konstantinidis
Affiliations:
Department of Mathematics and Computing Science, Saint Mary's University, Halifax, Nova Scotia, Canada;Department of Mathematics and Computing Science, Saint Mary's University, Halifax, Nova Scotia, Canada
Venue:
DNA13'07 Proceedings of the 13th international conference on DNA computing
Year:
2007

Citing 6
Cited 2

Regular languages

Handbook of formal languages, vol. 1
Developing Support System for Sequence Design in DNA Computing

DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
On Template Method for DNA Sequence Design

DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
Codes, involutions, and DNA encodings

Formal and natural computing
Descriptional complexity of error/edit systems

Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
Proceedings of the 10th international conference on DNA computing

DNA'04 Proceedings of the 10th international conference on DNA computing

Computing maximal Kleene closures that are embeddable in a given constrained DNA language

DNA'11 Proceedings of the 17th international conference on DNA computing and molecular programming
Computing maximal Kleene closures that are embeddable in a given subword-closed language

Natural Computing: an international journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the problem of encoding arbitrary data into the words of a DNA language that is defined via the subword closure operation, which appears to be useful in various situations related to data encodings. We present a few theoretical results on the subword closure operation as well as an initial implementation of a web-system that computes DNA languages according to the user's parameters, and performs encodings of data into these languages.