coding properties of dna languages
DESCRIPTION
Coding properties of DNA languages. Salah Hussini Lila Kari Stavros Konstantinidis Summarized by Yi Seung Joon. DNA properities. Consists of 4 bases Adenine, guanine, cytosine, thymine.(A,G,C,T) Single nucleotides are linked together end-to-end to form DNA strands. - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: Coding properties of DNA languages](https://reader036.vdocuments.us/reader036/viewer/2022062322/568143e2550346895db06ae0/html5/thumbnails/1.jpg)
1
Coding properties of DNA languagCoding properties of DNA languageses
Salah Hussini
Lila Kari
Stavros Konstantinidis
Summarized by Yi Seung Joon
![Page 2: Coding properties of DNA languages](https://reader036.vdocuments.us/reader036/viewer/2022062322/568143e2550346895db06ae0/html5/thumbnails/2.jpg)
2
DNA properitiesDNA properities
Consists of 4 bases Adenine, guanine, cytosine, thymine.(A,G,C,T)
Single nucleotides are linked together end-to-end to form DNA strands.
A short single-stranded polynucleotide chain is called an oligonucleotide.
Polarity: 5’ end and 3’ end A - T and G - C: complementary. Two complementart single-stranded DNA sequences with opposite
polarity is called Watson/Crick complements and will join together to form a double helix (hybridization)
![Page 3: Coding properties of DNA languages](https://reader036.vdocuments.us/reader036/viewer/2022062322/568143e2550346895db06ae0/html5/thumbnails/3.jpg)
3
DNA-based algorithmsDNA-based algorithms
Initial DNA solution will contain some oligonucleotides which represent single ‘codewords’, and some oligonucleotides are strings of catenated codewords.
Two types of possible undesirable hybridizations– Forming a hairpin structure, which can happen if either end of th
e strand binds to another section of that same strand.
– Binding to either another codeword or to the catenation of two codeword strands.
![Page 4: Coding properties of DNA languages](https://reader036.vdocuments.us/reader036/viewer/2022062322/568143e2550346895db06ae0/html5/thumbnails/4.jpg)
4
Definitions and NotationsDefinitions and Notations
An alphabet X is a finite non-empty set of symbols. A word u over the alphabet X is a sequence of letters an
d |u| will denote the length of u. We donote by the Watson-Click complement of the w
equence u. If u=5’-AAAAGG-3’ then =5’-CCTTTT-3’
X* is the set of all words over X. X+ is the set of all non-empty words over X. A language(over X) is any subset of X*. , the DNA alphabet.
![Page 5: Coding properties of DNA languages](https://reader036.vdocuments.us/reader036/viewer/2022062322/568143e2550346895db06ae0/html5/thumbnails/5.jpg)
5
Definitions and NotationsDefinitions and Notations
For a set S, we denote by |S| the cardinality of S, the number of elements in S.
Let X* be the free monoid generated by the finite alphabet X. A mapping α:X*->X* is called a morphism(anti-morphism) of X* if α(uv)= α(u) α(v) (respectively α(uv)= α(v) α(u)) for all u,v in X*
An invoultion θ:S->S of S is a mapping that θ^2 equals the identity mapping.
IF Δ* is the free monoid generated by the DNA-alphabet Δ then two involutions can be defined on Δ*: the mirror involution μ which is an anti-morphism, and the complement involution γ which is a morphism.
![Page 6: Coding properties of DNA languages](https://reader036.vdocuments.us/reader036/viewer/2022062322/568143e2550346895db06ae0/html5/thumbnails/6.jpg)
6
Definitions and NotationsDefinitions and Notations
The complement involution γ: Δ->Δ defined by γ(A)=T, γ(T)=A, γ(C)=G, γ(G)=C can be extended in the usual way to a morphism of Δ* that is a
lso an involution of Δ*.
The mirror involution μ: Δ*->Δ* μ (u)=v defined by u=a1a2…akkk, v=akk…a2a1, ai Δ∈
The DNA involution τ=γμ
![Page 7: Coding properties of DNA languages](https://reader036.vdocuments.us/reader036/viewer/2022062322/568143e2550346895db06ae0/html5/thumbnails/7.jpg)
7
Definitions and NotationsDefinitions and Notations
If the involution θ is the DNA involution, then a language L being strictly θ-compliant(strictly prefix θ-compliant, strictly suffix θ-compliant) amounts to the fact the situations of the type depicted in Figure 3(respectively Figure 1, Fifure 2) do not occur.
![Page 8: Coding properties of DNA languages](https://reader036.vdocuments.us/reader036/viewer/2022062322/568143e2550346895db06ae0/html5/thumbnails/8.jpg)
8
Definitions and NotationsDefinitions and Notations
A code A code K is a subset of X+ satisfying the property that, for every
word w in K+, there is a unique sequence (v1,v2…vn) of words in K such that w=v1v2…vn.
A bitfix code K is a prefix and suffix code; that is, K∩KX+ =K ∩X+K =0. Every bifix code is a code.
An infix code, K, has the property that no word of K is properly contained in another word of K, that is K∩(X+KX* X*KX+)=0. ∪Every infix code is a bifix code.
A comma-free code K is a language with the property K^2∩X+KX+=0. Every coma-free code is an infix code.
![Page 9: Coding properties of DNA languages](https://reader036.vdocuments.us/reader036/viewer/2022062322/568143e2550346895db06ae0/html5/thumbnails/9.jpg)
9
Involution-freedom and Involution-freedom and involution-complianceinvolution-compliance
![Page 10: Coding properties of DNA languages](https://reader036.vdocuments.us/reader036/viewer/2022062322/568143e2550346895db06ae0/html5/thumbnails/10.jpg)
10
Involution-freedom and involution-Involution-freedom and involution-compliancecompliance
A language L is called dense if every word is a subword of some word of L; that is , L∩X*wX*≠0 for every w X+. The Language ∈L is complete if L* is dense.
For language L X+ denote by the language of non-empty proper ⊆prefixes of L and the language of non-empty proper suffixes of L
Lpref={x X+|xy L for some y X+}∈ ∈ ∈ Lsuff={y X+|xy L for some y X+}∈ ∈ ∈
![Page 11: Coding properties of DNA languages](https://reader036.vdocuments.us/reader036/viewer/2022062322/568143e2550346895db06ae0/html5/thumbnails/11.jpg)
11
Involution freedom and involution-Involution freedom and involution-compliancecompliance
![Page 12: Coding properties of DNA languages](https://reader036.vdocuments.us/reader036/viewer/2022062322/568143e2550346895db06ae0/html5/thumbnails/12.jpg)
12
Involution freedom and involution-Involution freedom and involution-compliancecompliance
![Page 13: Coding properties of DNA languages](https://reader036.vdocuments.us/reader036/viewer/2022062322/568143e2550346895db06ae0/html5/thumbnails/13.jpg)
13
Involution freedom and involution-Involution freedom and involution-compliancecompliance
![Page 14: Coding properties of DNA languages](https://reader036.vdocuments.us/reader036/viewer/2022062322/568143e2550346895db06ae0/html5/thumbnails/14.jpg)
14
Involution freedom and involution-Involution freedom and involution-compliancecompliance
![Page 15: Coding properties of DNA languages](https://reader036.vdocuments.us/reader036/viewer/2022062322/568143e2550346895db06ae0/html5/thumbnails/15.jpg)
15
Involution freedom and involution-Involution freedom and involution-compliancecompliance
![Page 16: Coding properties of DNA languages](https://reader036.vdocuments.us/reader036/viewer/2022062322/568143e2550346895db06ae0/html5/thumbnails/16.jpg)
16
Involution freedom and involution-Involution freedom and involution-compliancecompliance
![Page 17: Coding properties of DNA languages](https://reader036.vdocuments.us/reader036/viewer/2022062322/568143e2550346895db06ae0/html5/thumbnails/17.jpg)
17
Involution freedom and involution-Involution freedom and involution-compliancecompliance
Every complement-free language is anti complement-reflective Not every anti complement-reflective language is complement-free.
![Page 18: Coding properties of DNA languages](https://reader036.vdocuments.us/reader036/viewer/2022062322/568143e2550346895db06ae0/html5/thumbnails/18.jpg)
18
Involution freedom and involution-Involution freedom and involution-compliancecompliance
![Page 19: Coding properties of DNA languages](https://reader036.vdocuments.us/reader036/viewer/2022062322/568143e2550346895db06ae0/html5/thumbnails/19.jpg)
19
Involution freedom and involution-Involution freedom and involution-compliancecompliance
![Page 20: Coding properties of DNA languages](https://reader036.vdocuments.us/reader036/viewer/2022062322/568143e2550346895db06ae0/html5/thumbnails/20.jpg)
20
Involution freedom and involution-Involution freedom and involution-compliancecompliance
![Page 21: Coding properties of DNA languages](https://reader036.vdocuments.us/reader036/viewer/2022062322/568143e2550346895db06ae0/html5/thumbnails/21.jpg)
21
Involution freedom and involution-Involution freedom and involution-compliancecompliance
![Page 22: Coding properties of DNA languages](https://reader036.vdocuments.us/reader036/viewer/2022062322/568143e2550346895db06ae0/html5/thumbnails/22.jpg)
22
Involution freedom and involution-Involution freedom and involution-compliancecompliance
![Page 23: Coding properties of DNA languages](https://reader036.vdocuments.us/reader036/viewer/2022062322/568143e2550346895db06ae0/html5/thumbnails/23.jpg)
23
Involution freedom and involution-Involution freedom and involution-compliancecompliance
![Page 24: Coding properties of DNA languages](https://reader036.vdocuments.us/reader036/viewer/2022062322/568143e2550346895db06ae0/html5/thumbnails/24.jpg)
24
Decidablity issuesDecidablity issues L(E) denotes the language represented by E.
![Page 25: Coding properties of DNA languages](https://reader036.vdocuments.us/reader036/viewer/2022062322/568143e2550346895db06ae0/html5/thumbnails/25.jpg)
25
Decidablity issuesDecidablity issues
![Page 26: Coding properties of DNA languages](https://reader036.vdocuments.us/reader036/viewer/2022062322/568143e2550346895db06ae0/html5/thumbnails/26.jpg)
26
Decidablity issuesDecidablity issues
![Page 27: Coding properties of DNA languages](https://reader036.vdocuments.us/reader036/viewer/2022062322/568143e2550346895db06ae0/html5/thumbnails/27.jpg)
27
Decidablity issuesDecidablity issues
![Page 28: Coding properties of DNA languages](https://reader036.vdocuments.us/reader036/viewer/2022062322/568143e2550346895db06ae0/html5/thumbnails/28.jpg)
28
Decidablity issuesDecidablity issues
![Page 29: Coding properties of DNA languages](https://reader036.vdocuments.us/reader036/viewer/2022062322/568143e2550346895db06ae0/html5/thumbnails/29.jpg)
29
Splicing systems preserving good Splicing systems preserving good encodingsencodings We are to characterize initial sets of coderords having the feature that the good encoding properties a
re preserved during any computation (We chose splicing) starting out from the initial set.
![Page 30: Coding properties of DNA languages](https://reader036.vdocuments.us/reader036/viewer/2022062322/568143e2550346895db06ae0/html5/thumbnails/30.jpg)
30
Splicing systems preserving good Splicing systems preserving good encodingsencodings
![Page 31: Coding properties of DNA languages](https://reader036.vdocuments.us/reader036/viewer/2022062322/568143e2550346895db06ae0/html5/thumbnails/31.jpg)
31
Splicing systems preserving good Splicing systems preserving good encodingsencodings
![Page 32: Coding properties of DNA languages](https://reader036.vdocuments.us/reader036/viewer/2022062322/568143e2550346895db06ae0/html5/thumbnails/32.jpg)
32
Splicing systems preserving good Splicing systems preserving good encodingsencodings
![Page 33: Coding properties of DNA languages](https://reader036.vdocuments.us/reader036/viewer/2022062322/568143e2550346895db06ae0/html5/thumbnails/33.jpg)
33
Splicing systems preserving good Splicing systems preserving good encodingsencodings
![Page 34: Coding properties of DNA languages](https://reader036.vdocuments.us/reader036/viewer/2022062322/568143e2550346895db06ae0/html5/thumbnails/34.jpg)
34
Splicing systems preserving good Splicing systems preserving good encodingsencodings
![Page 35: Coding properties of DNA languages](https://reader036.vdocuments.us/reader036/viewer/2022062322/568143e2550346895db06ae0/html5/thumbnails/35.jpg)
35
Splicing systems preserving good Splicing systems preserving good encodingsencodings
![Page 36: Coding properties of DNA languages](https://reader036.vdocuments.us/reader036/viewer/2022062322/568143e2550346895db06ae0/html5/thumbnails/36.jpg)
36
Splicing systems preserving good Splicing systems preserving good encodingsencodings Information re of a finite code K over some alphab
et X is
![Page 37: Coding properties of DNA languages](https://reader036.vdocuments.us/reader036/viewer/2022062322/568143e2550346895db06ae0/html5/thumbnails/37.jpg)
37
Splicing systems preserving good Splicing systems preserving good encodingsencodings
![Page 38: Coding properties of DNA languages](https://reader036.vdocuments.us/reader036/viewer/2022062322/568143e2550346895db06ae0/html5/thumbnails/38.jpg)
38
Splicing systems preserving good Splicing systems preserving good encodingsencodings