Relativised code concepts and multi-tube DNA dictionaries (2000) [3 citations — 0 self]
|
Abstract:
Concepts from the theory of variable length codes are relativised to a language L so that demands are made only for those strings that belong to L. Decision procedures and regularity results appropriate for the relativised forms are given. This suggests the denition of a sequence of code types: the join codes of level k (1 k). At level 1 we have precisely the familiar comma free codes. For a join code of level k, a procedure for segmenting messages into code words is observed that consists of k steps, with each step being carried out in the elementary comma free manner. An illustration of this segmentation process is given using an idealization of the Watson-Crick base pairing of complementary strands of DNA. In this process the code words appear as ssDNA molecules in k distinct test tubes with each test tube content being washed over each incoming ssDNA complemented message strand. After k washings the sequence of attached code words provides the required segmentation.
Citations
| 19 | Language theory and molecular genetics. Generative mechanisms suggested by DNA recombination – Paun - 1997 |
| 3 | Decipherability of codes – Guzmán - 1999 |
| 3 | The Finest Homophonic Partition and Related Code Concepts – Weber, Head - 1994 |
| 2 | Unique decipherability relative to a language – Head |
| 2 | and Combinatorial Theory – Lallement - 1979 |
| 2 | On multiset decipherable codes – Lempel - 1986 |
| 2 | A note on multiset decipherable codes – Restivo - 1989 |
| 1 | Hiding messages – Clelland |
| 1 | of Codes and Codi Varieties of Monoids, Doctoral Dissertation – Gumustop - 1997 |
| 1 | A complete list of small proper – Guzman |
| 1 | Vol.I Chapter 8 of: G.Rozenberg & A.Salomaa, Eds., Handbook of Formal Languages – Konstantinidis - 1997 |
| 1 | languages, Vol.I Chapter 2 of: G.Rozenberg & A.Salomaa, Eds., Handbook of Formal Languages – Yu - 1997 |
