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 Concept Videos

Genetic Screens02:46

Genetic Screens

5.9K
Genetic screens are tools used to identify genes and mutations responsible for phenotypes of interest. Genetic screens help identify individuals or a group of people at risk of developing  genetic diseases and help them with early intervention, targeted therapy, and reproductive options.
Forward genetic screens
Forward or “classical” genetic screens involve creating random mutations in an organism’s DNA using radiation, mutagens, or insertion of additional bases, which...
5.9K
Optimization Problems01:26

Optimization Problems

194
Optimization problems often involve identifying maximum or minimum values under specific constraints. A well-known example is determining the longest horizontal pipe that can be moved around a right-angled corner, where a 3-meter-wide hallway meets a 2-meter-wide hallway. This scenario, common in architectural design and industrial transport, can be understood conceptually through geometric and trigonometric reasoning.To visualize the problem, consider the pipe as a straight line that touches...
194
Gene Evolution - Fast or Slow?02:05

Gene Evolution - Fast or Slow?

8.4K
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...
8.4K
Gene Evolution - Fast or Slow?02:05

Gene Evolution - Fast or Slow?

3.8K
3.8K
Gaussian Elimination: Problem Solving01:30

Gaussian Elimination: Problem Solving

289
Systems of linear equations in several variables are pivotal in modeling complex scenarios involving multiple unknowns and constraints. Such systems are widely used in various fields to represent relationships where several conditions must be simultaneously satisfied. Each variable in the system corresponds to an unknown quantity, while each equation imposes a linear constraint, leading to a structured approach for analyzing and solving real-world problems.A system of three equations with three...
289
Machines: Problem Solving I01:22

Machines: Problem Solving I

824
A toggle clamp is a mechanical device commonly used for holding and clamping objects in various applications, such as woodworking, metalworking, and assembly operations. Consider a toggle clamp subjected to a force of 200 N at the handle. The vertical clamping force can be calculated, provided the dimensions of the toggle clamp are known.
The toggle clamp system is a machine structure consisting of movable, pin-connected multi-force members that form a stabilized system to transmit forces. The...
824

You might also read

Related Articles

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

Sort by
Same author

European beech reproduction is not reduced by drought, including the 2003, 2018, and 2022 extremes.

Proceedings of the National Academy of Sciences of the United States of America·2026
Same author

Climate-driven in-situ trait variation in an annual ruderal grass across Europe.

Annals of botany·2026
Same author

Autoantibodies to IL-1Ra and PGRN in severe COVID-19 are associated with inflammation-induced hyperphosphorylated antigen isoforms.

Nature communications·2026
Same author

Plasmacytic markers as immunotherapeutic targets for primary CD20-negative aggressive B-cell lymphomas.

British journal of haematology·2026
Same author

Sensory and cortical biomarkers unveil pain modulation mechanisms induced by targeted multisensory neurostimulation.

Journal of neuroengineering and rehabilitation·2026
Same author

Age-specific and time-dependent trends in health-related quality of life after minor stroke: results of a cross-sectional cohort study.

BMJ neurology open·2026

Related Experiment Video

Updated: Apr 15, 2026

The Modular Design and Production of an Intelligent Robot Based on a Closed-Loop Control Strategy
11:53

The Modular Design and Production of an Intelligent Robot Based on a Closed-Loop Control Strategy

Published on: October 14, 2017

12.4K

On the Performance of Different Genetic Programming Approaches for the SORTING Problem.

Markus Wagner1, Frank Neumann2, Tommaso Urli3

  • 1Optimisation and Logistics, University of Adelaide, Adelaide, Australia markus.wagner@adelaide.edu.au.

Evolutionary Computation
|April 15, 2015
PubMed
Summary
This summary is machine-generated.

Genetic programming bloat, where solutions grow excessively, hinders optimization. This study analyzes algorithms on the sorting problem to understand and bound bloat, improving evolutionary algorithms.

Keywords:
Computational complexitygenetic programmingmultiobjective optimizationsingle-objective optimizationsortednessvariable-length representation

More Related Videos

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances
07:35

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances

Published on: October 11, 2018

8.1K
A Visual Guide to Sorting Electrophysiological Recordings Using 'SpikeSorter'
10:31

A Visual Guide to Sorting Electrophysiological Recordings Using 'SpikeSorter'

Published on: February 10, 2017

11.7K

Related Experiment Videos

Last Updated: Apr 15, 2026

The Modular Design and Production of an Intelligent Robot Based on a Closed-Loop Control Strategy
11:53

The Modular Design and Production of an Intelligent Robot Based on a Closed-Loop Control Strategy

Published on: October 14, 2017

12.4K
Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances
07:35

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances

Published on: October 11, 2018

8.1K
A Visual Guide to Sorting Electrophysiological Recordings Using 'SpikeSorter'
10:31

A Visual Guide to Sorting Electrophysiological Recordings Using 'SpikeSorter'

Published on: February 10, 2017

11.7K

Area of Science:

  • Computer Science
  • Artificial Intelligence
  • Evolutionary Computation

Background:

  • In genetic programming, solution size is flexible but can lead to "bloat," where individuals grow without added benefit, impeding optimization.
  • Bloat can prevent variable-length evolutionary algorithms from solving even relatively simple problems.

Purpose of the Study:

  • To analyze single- and multiobjective algorithms on the sorting problem, which lacks typical fitness structures.
  • To investigate the phenomenon of bloat in genetic programming and its impact on optimization.

Main Methods:

  • Analysis of different single- and multiobjective algorithms.
  • Experimental evaluation on the sorting problem, chosen for its lack of independent and additive fitness structures.
  • Complementing theoretical results with comprehensive experiments.

Main Results:

  • The study provides insights into the performance of various algorithms on a problem susceptible to bloat.
  • Experimental results help to validate existing theoretical bounds related to bloat.
  • Identified areas where theoretical bounds for bloat are currently missing.

Conclusions:

  • Understanding and bounding bloat is crucial for improving the efficiency of genetic programming.
  • The sorting problem serves as a valuable test case for analyzing bloat in evolutionary algorithms.
  • This research contributes to the development of more robust and effective variable-length evolutionary algorithms.