Related Experiment Video
Updated: Aug 13, 2026
09:40
Novel Sequence Discovery by Subtractive Genomics
Published on: January 25, 2019
ptGAs-Genetic Algorithms Evolving Noncoding Segments by Means of Promoter/Terminator Sequences
1Department of Computer Science, University of Salzburg, Jakob-Haringer-Strasse 2, A5020 Salzburg, Austria. helmut@cosy.sbg.ac.at
Evolutionary Computation
|February 9, 1999
Summary
This study explores biological chromosome structures for genetic algorithms (GAs). Introducing promoter/terminator sequences (ptGAs) enhances gene adaptation and reduces crossover disruption, improving optimization performance.
Area of Science:
- Computational intelligence
- Bio-inspired computing
- Artificial intelligence
Background:
- Genetic algorithms (GAs) often use fixed-length chromosomes.
- Noncoding DNA segments can influence GA performance and reduce crossover disruption.
- Previous work has explored fixed noncoding segments, but not dynamically adapting gene structures.
Purpose of the Study:
- To investigate the impact of biologically inspired chromosome structures on GA behavior and performance.
- To compare fixed noncoding segments with dynamic gene structures using promoter/terminator sequences (ptGAs).
- To introduce and evaluate a novel, non-disruptive crossover operator tailored for ptGA structures.
Main Methods:
- Formal analysis of crossover disruption probabilities for noncoding segments.
- Development and implementation of ptGA chromosome structures with self-organizing gene locations.
- Introduction of an adaptive crossover operator for ptGA chromosomes.
- Experimental comparison using an artificial problem and an NP-complete combinatorial optimization problem.
Main Results:
- Noncoding segments, particularly those in ptGAs, significantly reduce crossover disruption.
- ptGAs enable the evolution of gene number, size, and location, leading to (sub)optimal solutions.
- Self-organization of gene locations in ptGAs enhances the formation of tightly linked building blocks.
- The novel adaptive crossover operator shows improved performance compared to conventional methods.
Conclusions:
- Biologically inspired chromosome structures, like ptGAs, offer significant advantages for genetic algorithms.
- Dynamic gene structures and adaptive operators can improve GA efficiency and solution quality.
- ptGAs demonstrate potential for solving complex combinatorial optimization problems.
Related Concept Videos
02:05Gene Evolution - Fast or Slow?
The genomes of eukaryotes are punctuated by long stretches of sequence which do not code for proteins or RNAs. Although some of these regions do contain crucial regulatory sequences, the vast majority of this DNA serves no known function. Typically, these regions of the genome are the ones in which the fastest change, in evolutionary terms, is observed, because there is typically little to no selection pressure acting on these regions to preserve their sequences.
In contrast, regions which code...
In contrast, regions which code...
03:21Genome Size and the Evolution of New Genes
While every living organism has a genome of some kind (be it RNA, or DNA), there is considerable variation in the sizes of these blueprints. One major factor that impacts genome size is whether the organism is prokaryotic or eukaryotic. In prokaryotes, the genome contains little to no non-coding sequence, such that genes are tightly clustered in groups or operons sequentially along the chromosome. Conversely, the genes in eukaryotes are punctuated by long stretches of non-coding sequence.
02:08Gene Conversion
Other than maintaining genome stability via DNA repair, homologous recombination plays an important role in diversifying the genome. In fact, the recombination of sequences forms the molecular basis of genomic evolution. Random and non-random permutations of genomic sequences create a library of new amalgamated sequences. These newly formed genomes can determine the fitness and survival of cells. In bacteria, homologous and non-homologous types of recombination lead to the evolution of new...
02:53Conservative Site-specific Recombination and Phase Variation
Because the DNA segments are cut and reorganized in a direction-specific manner, site-specific recombination has emerged as an efficient genetic engineering technique. Flippase and Cyclization recombinases or Flp and Cre, respectively, are two members of the tyrosine recombinase family derived from bacteriophages, that are used to mediate site-specific DNA insertions, deletions, and targeted expression of proteins in mammalian cell lines.
The recognition sites for Cre recombinase called LoxP...
The recognition sites for Cre recombinase called LoxP...
03:00Next-generation Sequencing
The first human genome sequencing project cost $2.7 billion and was declared complete in 2003, after 15 years of international cooperation and collaboration between several research teams and funding agencies. Today, with the advent of next-generation sequencing technologies, the cost and time of sequencing a human genome have dropped over 100 fold.
Next-Generation Sequencing Methods
Although all next-generation methods use different technologies, they all share a set of standard features.
Next-Generation Sequencing Methods
Although all next-generation methods use different technologies, they all share a set of standard features.
02:08Gene Conversion
Other than maintaining genome stability via DNA repair, homologous recombination plays an important role in diversifying the genome. In fact, the recombination of sequences forms the molecular basis of genomic evolution. Random and non-random permutations of genomic sequences create a library of new amalgamated sequences. These newly formed genomes can determine the fitness and survival of cells. In bacteria, homologous and non-homologous types of recombination lead to the evolution of new...