Mutation and molecules towards mutation-based computation

PDF Version Also Available for Download.

Description

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 ... continued below

Physical Description

13 p.

Creation Information

Reidys, C.M. & Barrett, C.L. August 1, 1997.

Context

This article is part of the collection entitled: Office of Scientific & Technical Information Technical Reports and was provided by UNT Libraries Government Documents Department to Digital Library, a digital repository hosted by the UNT Libraries. More information about this article can be viewed below.

Who

People and organizations associated with either the creation of this article or its content.

Sponsor

Publisher

Provided By

UNT Libraries Government Documents Department

Serving as both a federal and a state depository library, the UNT Libraries Government Documents Department maintains millions of items in a variety of formats. The department is a member of the FDLP Content Partnerships Program and an Affiliated Archive of the National Archives.

Contact Us

What

Descriptive information to help identify this article. Follow the links below to find similar items on the Digital Library.

Description

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.

Physical Description

13 p.

Notes

OSTI as DE97003390

Source

  • Optimization and simulations conference, Singapore (Singapore), 1-4 Sep 1997

Language

Item Type

Identifier

Unique identifying numbers for this article in the Digital Library or other systems.

  • Other: DE97003390
  • Report No.: LA-UR--97-122
  • Report No.: CONF-970937--2
  • Grant Number: W-7405-ENG-36
  • Office of Scientific & Technical Information Report Number: 516044
  • Archival Resource Key: ark:/67531/metadc697885

Collections

This article is part of the following collection of related materials.

Office of Scientific & Technical Information Technical Reports

Reports, articles and other documents harvested from the Office of Scientific and Technical Information.

Office of Scientific and Technical Information (OSTI) is the Department of Energy (DOE) office that collects, preserves, and disseminates DOE-sponsored research and development (R&D) results that are the outcomes of R&D projects or other funded activities at DOE labs and facilities nationwide and grantees at universities and other institutions.

What responsibilities do I have when using this article?

When

Dates and time periods associated with this article.

Creation Date

  • August 1, 1997

Added to The UNT Digital Library

  • Aug. 14, 2015, 8:43 a.m.

Description Last Updated

  • April 21, 2016, 10:22 p.m.

Usage Statistics

When was this article last used?

Yesterday: 0
Past 30 days: 0
Total Uses: 3

Interact With This Article

Here are some suggestions for what to do next.

Start Reading

PDF Version Also Available for Download.

Citations, Rights, Re-Use

Reidys, C.M. & Barrett, C.L. Mutation and molecules towards mutation-based computation, article, August 1, 1997; New Mexico. (digital.library.unt.edu/ark:/67531/metadc697885/: accessed January 22, 2018), University of North Texas Libraries, Digital Library, digital.library.unt.edu; crediting UNT Libraries Government Documents Department.