Evidence map›Paper›PMID 25767296›Full record

ArticleInformation sciences2015

Forced evolution

Leonid Zamdborg, David M Holloway, Juan J Merelo, Vladimir F Levchenko, Alexander V Spirov

Abstract read
In one paragraph

Article in Information sciences, 2015. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 3 papers.

0numbers the graph read from it
0cells of the map it votes in
3citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

3 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

5 authors.

Leonid ZamdborgDepartment of Applied Mathematics and Statistics, The Stony Brook State University, NY.
David M HollowayMathematics Department, British Columbia Institute of Technology, 3700 Willingdon Avenue, Burnaby, B.C., Canada, V5G 3H2.
Juan J MereloDepartamento de Arquitectura y Tecnología de Computadores, University of Granada, Granada, Spain.
Vladimir F LevchenkoThe Sechenov Institute of Evolutionary Physiology and Biochemistry, 44 Thorez Ave., St. Petersburg, 194223, Russia.
Alexander V SpirovDepartment of Applied Mathematics and Statistics, The Stony Brook State University, NY ; The Sechenov Institute of Evolutionary Physiology and Biochemistry, 44 Thorez Ave., St. Petersburg, 194223, Russia ; Computer Science Department and Center of Excellence in Wireless & Information Technology, The Stony Brook State University, NY.

Funding

Understanding Robust Development: Experiment and TheoryR01GM072022 · NIGMS · STATE UNIVERSITY NEW YORK STONY BROOK · PI SPIROV, ALEXANDER V · 2004 to 2014
$2.7M
Understanding Embryonic Robustness: Quantitative Experiments and TheoryR56GM072022 · NIGMS · STATE UNIVERSITY NEW YORK STONY BROOK · PI SPIROV, ALEXANDER V · 2009 to 2009
$312k
NIGMS NIH HHS R01 GM072022NIGMS NIH HHS R56 GM072022
6 · The paper itself

Abstract

Modern evolutionary computation utilizes heuristic optimizations based upon concepts borrowed from the Darwinian theory of natural selection. Their demonstrated efficacy has reawakened an interest in other aspects of contemporary biology as an inspiration for new algorithms. However, amongst the many excellent candidates for study, contemporary models of biological macroevolution attract special attention. We believe that a vital direction in this field must be algorithms that model the activity of "genomic parasites", such as transposons, in biological evolution. Many evolutionary biologists posit that it is the co-evolution of populations with their genomic parasites that permits the high efficiency of evolutionary searches found in the living world. This publication is our first step in the direction of developing a minimal assortment of algorithms that simulate the role of genomic parasites. Specifically, we started in the domain of genetic algorithms (GA) and selected the Artificial Ant Problem as a test case. This navigation problem is widely known as a classical benchmark test and possesses a large body of literature. We add new objects to the standard toolkit of GA - artificial transposons and a collection of operators that operate on them. We define these artificial transposons as a fragment of an ant's code with properties that cause it to stand apart from the rest. The minimal set of operators for transposons is a transposon mutation operator, and a transposon reproduction operator that causes a transposon to multiply within the population of hosts. An analysis of the population dynamics of transposons within the course of ant evolution showed that transposons are involved in the processes of propagation and selection of blocks of ant navigation programs. During this time, the speed of evolutionary search increases significantly. We concluded that artificial transposons, analogous to real transposons, are truly capable of acting as intelligent mutators that adapt in response to an evolutionary problem in the course of co-evolution with their hosts.

Indexed as

animatsant pathfinderartificial transposonsevolutionary computationsgenetic algorithms

Identifiers

PMID25767296
PMCPMC4353400

What Socratic holds

Textmetadata
LicenceTDM
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the Socratic graph.