I agree that this thesis shall be available in accordance with the regulations governing the University of Warwick theses. I agree that the summary of this thesis may be submitted for publication. I agree that the thesis may be photocopied (single copies for study purposes only). Theses with no restriction on photocopying will also be made available to the British Library for microfilming. The British Library may supply copies to individuals or libraries. subject to a statement from them that the copy is supplied for non-publishing purposes. All copies supplied by the British Library will carry the following statement: "Attention is drawn to the fact that the copyright of this thesis rests with its author. This copy of the thesis has been supplied on the condition that anyone who consults it is understood to recognise that its copyright rests with its author and that no quotation from the thesis and no information derived from it may be published without the author's written consent." AUTHOR'S SIGNATURE: : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : :: USER'S DECLARATION 1. I undertake not to quote or make use of any information from this thesis without making acknowledgement to the author. 2. I further undertake to allow no-one else to use this thesis while it is in my care.
|
7711
|
Computers and Intractability: A Guide to the Theory of NP-Completeness
– Garey, Johnson
- 1979
|
|
2003
|
The Design and Analysis of Computer Algorithms
– Aho, Hopcroft, et al.
- 1974
|
|
1082
|
Genetic algorithms in search, optimization and machine learning
– Goldberg
- 1989
|
|
415
|
Molecular computation of solutions of combinatorial problems
– Adleman
|
|
255
|
Parallelism in random access machines
– Fortune, Wyllie
- 1978
|
|
176
|
Algorithmic Graph Theory
– Gibbons
- 1989
|
|
166
|
Efficient parallel algorithms
– Gibbons
- 1988
|
|
137
|
Formal languages theory and DNA: an analysis of the generative capacity of specific recombinant behaviors
– Head
|
|
86
|
DNA Solution of hard computational problems
– Lipton
- 1995
|
|
67
|
Relations among complexity measures
– Pippenger, Fischer
- 1979
|
|
66
|
On constructing a molecular computer
– Adleman
- 1995
|
|
65
|
On simultaneous resource bounds
– Pippenger
- 1979
|
|
60
|
Universal computation via self-assembly of DNA: Some theory and experiments
– Winfree, Yang, et al.
- 1996
|
|
58
|
A DNA and Restriction Enzyme Implementation of Turing Machines
– Rothemund
- 1996
|
|
49
|
A universal molecular computer
– Beaver
- 1995
|
|
45
|
Simulating boolean circuits on a DNA computer
– Ogihara, Ray
- 1997
|
|
41
|
Predicting DNA duplex stability from the base sequence
– Breslauer, Frank, et al.
- 1986
|
|
41
|
Parallel molecular computation: Models and simulations
– Reif
- 1995
|
|
40
|
The Complexity of Boolean Networks
– Dunne
- 1988
|
|
40
|
Introduction to Switching and Automata Theory
– Harrison
- 1965
|
|
39
|
Molecular Structure of Nucleic Acids: A Structure For Deoxyribose Nucleic
– Watson, Crick
- 1953
|
|
38
|
DNA models and algorithms for NP-complete problems
– Bach, Condon, et al.
- 1996
|
|
37
|
The Thermodynamics of Computation – a Review
– Bennett
- 1982
|
|
34
|
DNA sequences useful for computation
– Baum
- 1996
|
|
34
|
There’s Plenty of Room at the Bottom
– Feynman
- 1960
|
|
31
|
Running dynamic programming algorithms on a DNA computer
– Baum, Boneh
- 1996
|
|
30
|
Improved M13 phage cloning vectors and host strains: nucleotide sequences of the M13mp18 and pUC19 vectors. Gene 33:103–119. Downloaded from cvi.asm.org at Penn State Univ on April 17
– Yanisch-Perron, Vieira, et al.
- 1985
|
|
29
|
DNA Computation
– Amos
- 1997
|
|
28
|
On the Weight of Computations
– Hartmanis
- 1995
|
|
27
|
Error-resistant implementation of DNA computations
– Amos, Gibbons, et al.
- 1996
|
|
26
|
Nucleic acid junctions and lattices
– Seeman
- 1982
|
|
22
|
A restricted genetic alphabet for DNA computing
– Mir
- 1996
|
|
22
|
A sticker based architecture for DNA computation
– Roweis, Winfree, et al.
- 1996
|
|
20
|
A Surface-Based Approach to DNA Computation
– Liu, Guo, et al.
- 1996
|
|
19
|
De novo design of sequences for nucleic acid structure engineering
– Seeman
- 1990
|
|
18
|
Splicing schemes and DNA
– Head
- 1992
|
|
17
|
DNA double-crossover molecules
– Fu, Seeman
- 1993
|
|
17
|
On the path to computation with DNA
– Gifford
- 1994
|
|
17
|
The network complexity and Turing machine complexity of finite functions
– Schnorr
- 1976
|
|
15
|
Molecular computation: Adleman's experiment repeated
– Kaplan, Cecchi, et al.
- 1995
|
|
13
|
The complexity and viability of DNA computations
– Amos, Gibbons, et al.
- 1997
|
|
12
|
DNA based molecular computation: Template-template interactions
– Kaplan, Cecchi, et al.
- 1996
|
|
12
|
Active transport in biological computing
– Kurtz, Mahaney, et al.
- 1996
|
|
12
|
Characterizing crossover in genetic algorithms
– Liepins, Vose
- 1992
|
|
11
|
Genetics: a molecular approach
– Brown
- 1992
|
|
11
|
Paun: DNA computing based on splicing: universality results
– Csuhaj-Varju, Freund, et al.
- 1996
|
|
9
|
Orli Waarts. Error-resilient dna computation
– Karp, Kenyon
- 1996
|
|
9
|
A procedure for the isolation of deoxyribonucleic acid from microorganisms
– Marmur
- 1961
|
|
9
|
Principles of Gene Manipulation, An Introduction to Genetic
– Old, Primrose
- 1994
|
|
9
|
The construction of a DNA truncated octahedron
– Zhang, Seeman
- 1994
|
|
