Mutation and molecules towards mutation-based computation
In this paper recent results on random graphs are used as a framework for a theory of mutation based computation. The paradigm for mutation based computation will be the evolution of molecular structures. The mathematical structure of {open_quotes}folding maps{close_quotes} into molecular structures is shown to guarantee an effective search by point-mutations. Detailed mathematical models for these mappings are discussed. We will show that combinatorial structures consisting of (i) a (random) contact graph and (ii) a family of relations imposed on its adjacent vertices allow for efficient search by point mutations. We will determine the graph structure of the contact-graph and discuss its relation to the optimization process. Mappings of sequences into random structure is modeled as a random graph in sequence space, the neutral network. We will analyze the graph structure of neutral networks and show how they are embedded in sequence space. Explicitely we discuss connectivity and density of neutral networks and prove that any two neutral networks come close in sequence space. Finally several experiments are shown that illustrate the prospective of using this molecular computation method.
- Research Organization:
- Los Alamos National Lab., NM (United States)
- Sponsoring Organization:
- Department of Defense, Washington, DC (United States)
- DOE Contract Number:
- W-7405-ENG-36
- OSTI ID:
- 516044
- Report Number(s):
- LA-UR--97-122; CONF-970937--2; ON: DE97003390
- Country of Publication:
- United States
- Language:
- English
Similar Records
Evolutionary optimization of biopolymers and sequence structure maps
Evolutionary dynamics on random structures