Evolution as a computational engine

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1414, Issue , 1998, Pages 35-55

  Backofen, Rolf ^a   Clote, Peter ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BIOLOGY; COMPUTATION THEORY; COMPUTER CIRCUITS; ENCODING (SYMBOLS); ENGINES; MACHINERY; RECONFIGURABLE HARDWARE; SET THEORY; TURING MACHINES;

ENCODING MECHANISM; ENCODINGS; EVOLUTIONARY SYSTEM; FINITE SET; REVERSIBLE TURING MACHINES; UNIVERSAL COMPUTATIONS;

GENES;

EID: 84856610869     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0028006     Document Type: Conference Paper

References (14)

1. L. Adleman. Molecular computation of solutions to combinatorial problems. Science, 266:1021-1024, 1994.
2. S. Arora, Y. Rabani, and U. Vazirani. Simulating quadratic dynamical systems is PSP-AC-E-complete (preliminary version). In Proceedings of the 26th Annual ACM Symposium on Theory of Computing, pages 459-467, 1994.
3. C.H. Bennett. Time/space trade-offs for reversible computation. SIAM Journal on Computing, 18:766-776, 1989.
4. V. Chvatal and D. Sankoff. Longest common subsequences of two random sequences. Journal of Applied Probability, 12:306-315, 1975.
5. J. Dassow and V. Mitrana. Evolutionary grammars: a grammatical model for genome evolution. In Computer Science and Biology, pages pp. 87-92, 1996. Proceedings of the German Conference on Bioinformatics (GCB’96).
6. L. Ilie and V. Mitrana. Crossing-over on languages: A formal representation of the recombination of genes in a chromosome. Technical Report 16, Turku Centre for Computer Science, June 1996.
7. Lila Kari and Gabriel Thierrin. Contextual insertion/deletions and computability. Information and Computation, 131(1):47-61, 1996.
8. L. Kari, G. Paun, G. Thierrin, and S. Yu. At the crossroads of DNA computing and formal languages: Characterizing recursively enumerable languages by insertion-deletion systems. In Proceedings of the 3rd DIM ACS Workshop on DNA-based Computers, pages 318-333, Philadelphia, June 1997.
9. S. Yu. Maslov. The mutation calculi. Journal of Soviet Mathematics, 10:495-517, 1978.
10. S. Yu. Maslov. Absorption relation on regular sets. Journal of Soviet Mathematics, 14:1468-1475, 1980.
11. S. Yu. Maslov. Theory of Deductive Systems and its Applications. MIT Press (Cambridge), 1987.
12. G. Paun and A. Salomaa. Prom DNA recombination to DNA computing, via formal languages. In Computer Science and Biology, pages pp. 93-98, 1996. Proceedings of the German Conference on Bioinformatics (GCB’96).
13. P. Pudlak. Complexity theory and genetics. In Proceedings of 9th Annual IEEE Conference on Structure in Complexity Theory, 1994.
14. M. S. Waterman. Introduction to Computational Biology-Maps, sequences and genomes. Chapman and Hall, 1995.