Theoretical and Experimental DNA Computation (Natural ...

More documents

Recommendations

Info

Contents XIII 6.5 ModelsofGeneConstruction .............................153 6.6 Summary...............................................155 6.7 BibliographicalNotes ....................................156 References .....................................................157 Index ..........................................................167
Page 2 and 3: Natural Computing Series Series Edi
Page 4: Martyn Amos Department of Computer
Page 8 and 9: Preface DNA computation has emerged
Page 10: Preface IX acknowledged. Finally, I
Page 13: XII Contents 4 Complexity Issues ..
Page 17 and 18: 2 Introduction the number of cars m
Page 19 and 20: 4 Introduction The initial rush of
Page 21 and 22: 6 1 DNA: The Molecule of Life 1.2 T
Page 23 and 24: 8 1 DNA: The Molecule of Life catal
Page 25 and 26: 10 1 DNA: The Molecule of Life proc
Page 27 and 28: 12 1 DNA: The Molecule of Life (a)
Page 29 and 30: 14 1 DNA: The Molecule of Life appe
Page 31 and 32: 16 1 DNA: The Molecule of Life The
Page 33 and 34: 18 1 DNA: The Molecule of Life DNA
Page 35 and 36: 20 1 DNA: The Molecule of Life (c)
Page 38 and 39: 2 Theoretical Computer Science: A P
Page 40 and 41: Boolean algebra 2.2 Algorithms and
Page 42 and 43: 2.3 The Turing Machine 27 So, this
Page 44 and 45: 2.4 The Random Access Machine 29 Th
Page 46 and 47: 2.4 The Random Access Machine 31 1.
Page 48 and 49: JUMP while endwhile: WRITE 2 write
Page 50 and 51: Fig. 2.7. Fragment of county map 2.
Page 52 and 53: 2.5 Data Structures 37 tions and pe
Page 54 and 55: 2.6 Computational Complexity 39 Ano
Page 56 and 57: 2.6 Computational Complexity 41 sta
Page 58 and 59: 2.8 Summary 43 Table 2.6. Running t
Page 60 and 61: 3 Models of Molecular Computation
Page 62 and 63: Unrestricted model 3.2 Filtering Mo
Page 64 and 65:
3.2 Filtering Models 49 variable, v
Page 66 and 67:
3.2 Filtering Models 51 which are n
Page 68 and 69:
k=red For each edge {j,k} In parall
Page 70 and 71:
3.2 Filtering Models 55 The maximum
Page 72 and 73:
3.2 Filtering Models 57 We now illu
Page 74 and 75:
Separate on 1 Separate on 2 Separat
Page 76 and 77:
S T S T α β γ α γ δ δ β 3.4
Page 78 and 79:
3.5 Membrane Models 63 tiles within
Page 80 and 81:
3.5 Membrane Models 65 while the se
Page 82 and 83:
3.5 Membrane Models 67 objects, and
Page 84 and 85:
1 2 3 a f 1 2 3 a b 2 f 3.6 Summary
Page 86 and 87:
4 Complexity Issues “Out of inten
Page 88 and 89:
4.2 An Existing Model of DNA Comput
Page 90 and 91:
4.2 An Existing Model of DNA Comput
Page 92 and 93:
4.4 Ogihara and Ray’s Boolean Cir
Page 94 and 95:
4.4 Ogihara and Ray’s Boolean Cir
Page 96 and 97:
x 1 e 1,5 (a) g 5 4.4 Ogihara and R
Page 98 and 99:
4.5 An Alternative Boolean Circuit
Page 100 and 101:
j k 4.6 Proposed Physical Implement
Page 102 and 103:
1 0 1 1 g 1 g 2 1 2 (a) (b) g 3 g 1
Page 104 and 105:
4.8 Example Application: Transitive
Page 106 and 107:
4.9 P-RAM Simulation 91 algorithm m
Page 108 and 109:
and repeat repeat-value times instr
Page 110 and 111:
4.10 The Translation Process 95 pro
Page 112 and 113:
4.10 The Translation Process 97 blo
Page 114 and 115:
4.10 The Translation Process 99 MUL
Page 116 and 117:
Contents of M at start of simulatio
Page 118 and 119:
4.12 A Worked Example: The List Ran
Page 120 and 121:
4.12 A Worked Example: The List Ran
Page 122:
4.14 Bibliographical Notes 107 We h
Page 125 and 126:
110 5 Physical Implementations not
Page 127 and 128:
112 5 Physical Implementations 5.4
Page 129 and 130:
114 5 Physical Implementations Stag
Page 131 and 132:
116 5 Physical Implementations or e
Page 133 and 134:
118 5 Physical Implementations (Fig
Page 135 and 136:
120 5 Physical Implementations 3. T
Page 137 and 138:
122 5 Physical Implementations sinc
Page 139 and 140:
124 5 Physical Implementations Tabl
Page 141 and 142:
126 5 Physical Implementations Expe
Page 143 and 144:
128 5 Physical Implementations thre
Page 145 and 146:
130 5 Physical Implementations Resu
Page 147 and 148:
132 5 Physical Implementations Fig.
Page 149 and 150:
134 5 Physical Implementations We a
Page 151 and 152:
136 5 Physical Implementations 5.9.
Page 153 and 154:
138 5 Physical Implementations stra
Page 155 and 156:
140 5 Physical Implementations proc
Page 157 and 158:
142 5 Physical Implementations The
Page 159 and 160:
144 5 Physical Implementations 1 =
Page 162 and 163:
6 Cellular Computing “The punched
Page 164 and 165:
PROMOTER STRUCTURAL GENE(S) TERMINA
Page 166 and 167:
6.4 Biological Background 151 Fig.
Page 168 and 169:
6.5 Models of Gene Construction 153
Page 170 and 171:
z z x w x w y y u (a) (b) u (c) Fig
Page 172 and 173:
References 1. Roger L.P. Adams, Joh
Page 174 and 175:
References 159 33. Ravinderjit S. B
Page 176 and 177:
References 161 75. M.A. Harrison. I
Page 178 and 179:
References 163 Computational Molecu
Page 180:
References 165 157. Ingo Wegener. T
Page 183 and 184:
168 Index clause, 42, 49, 139-141,
Page 185 and 186:
170 Index maximum independent set,
Page 187 and 188:
172 Index Taq, see enzyme, Taq targ
show all

Theoretical and Experimental DNA Computation (Natural ...

Create successful ePaper yourself

Delete template?

Save as template?