Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Point mutations as an optimal search process in biological evolution.

B Borstnik1, D Pumpernik, G L Hofacker

  • 1Boris Kidric Institute of Chemistry, Ljubljana, Yugoslavia.

Journal of Theoretical Biology
|April 7, 1987
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Criticality of D=2 and D=3 Ising models: cluster structure versus populations.

Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics·2002
Same author

Concurrent neutral evolution of mRNA secondary structures and encoded proteins.

Journal of molecular evolution·2001
Same author

Informational properties of neural nets performing algorithmic and logical tasks.

Biological cybernetics·1996
Same author

Complementary coding conforms to the primeval comma-less code.

Journal of theoretical biology·1995
Same author

Tandemly repeated pentanucleotides in DNA sequences of eucaryotes.

Nucleic acids research·1994
Same author

Neutral adaptation of the genetic code to double-strand coding.

Journal of molecular evolution·1993

Evolutionary search for optimal amino acid sequences is modeled in a phase space. Functional requirements, not random chance, guide this search, leading to sub-maximal information gain per mutation.

Area of Science:

  • Bioinformatics
  • Evolutionary Biology
  • Computational Biology

Background:

  • Point mutations drive evolution by altering DNA and amino acid sequences.
  • Phase space models represent sequences as points, with mutations as jumps.
  • Quantifying sequence properties provides a natural metric for this phase space.

Purpose of the Study:

  • To simulate evolution via point mutations as a search in a defined phase space.
  • To investigate the characteristics of this search compared to random distributions.
  • To analyze the efficacy of natural evolutionary search processes using sequence data.

Main Methods:

  • Developing a natural metric for amino acid sequence phase space based on physicochemical properties.
  • Simulating evolutionary search by seeking high-fitness points in the phase space.

Related Experiment Videos

  • Generating distributions of allowed points and evaluating search success based on jump probabilities.
  • Comparing simulation results with analyses of DNA/mRNA sequences coding for related proteins.

    • Main Results:

    • The distribution of functionally allowed sequences in phase space is locally compact, differing from random distributions.
    • Search procedures in this space exhibit unique characteristics.
    • Analysis of nucleotide replacement frequencies reveals insights into evolutionary search efficacy.
    • Simulations show that information gain per point mutation can approach one bit but is generally sub-maximal.

    Conclusions:

    • Natural selection imposes constraints that shape the evolutionary search landscape.
    • Functional requirements lead to a non-random, optimized search for beneficial mutations.
    • The study quantifies the information gain of evolutionary processes in sequence space.