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

Design Example01:23

Design Example

401
The innovation of touch-tone telephony revolutionized the telecommunications industry by replacing the traditional rotary dial with a dual-tone multi-frequency (DTMF) signaling system. This system uses a matrix-style keypad with buttons arranged in four rows and three columns, creating 12 distinct signals each assigned to a pair of frequencies. Each button press results in a simultaneous generation of two sinusoidal tones – one from a low-frequency group (697 to 941 Hz) and one from a...
401
Woodward–Hoffmann Selection Rules and Microscopic Reversibility01:34

Woodward–Hoffmann Selection Rules and Microscopic Reversibility

3.4K
Electrocyclic reactions, cycloadditions, and sigmatropic rearrangements are concerted pericyclic reactions that proceed via a cyclic transition state. These reactions are stereospecific and regioselective. The stereochemistry of the products depends on the symmetry characteristics of the interacting orbitals and the reaction conditions. Accordingly, pericyclic reactions are classified as either symmetry-allowed or symmetry-forbidden. Woodward and Hoffmann presented the selection criteria for...
3.4K
Discrete-Time Fourier Series01:20

Discrete-Time Fourier Series

415
The Discrete-Time Fourier Series (DTFS) is a fundamental concept in signal processing, serving as the discrete-time counterpart to the continuous-time Fourier series. It allows for the representation and analysis of discrete-time periodic signals in terms of their frequency components. Unlike its continuous counterpart, which utilizes integrals, the calculation of DTFS expansion coefficients involves summations due to the discrete nature of the signal.
For a discrete-time periodic signal x[n]...
415
Properties of the z-Transform I01:17

Properties of the z-Transform I

391
The z-transform is a fundamental tool in digital signal processing, enabling the analysis of discrete-time systems through its various properties. It is an invaluable tool for analyzing discrete-time systems, offering a range of properties that simplify complex signal manipulations. One fundamental property is linearity. For any two discrete-time signals, the z-transform of their linear combination equals the same linear combination of their individual z-transforms. This property is essential...
391
Classification of Systems-II01:31

Classification of Systems-II

261
Continuous-time systems have continuous input and output signals, with time measured continuously. These systems are generally defined by differential or algebraic equations. For instance, in an RC circuit, the relationship between input and output voltage is expressed through a differential equation derived from Ohm's law and the capacitor relation,
261

You might also read

Related Articles

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

Sort by
Same author

Molecular noise modulates transitions in the cell-fate differentiation landscape.

NPJ systems biology and applications·2026
Same author

Fifty years since a simple equation described the chaos of biology.

Nature·2026
Same author

Node and edge control strategy identification via trap spaces in Boolean networks.

BMC bioinformatics·2025
Same author

Learning cell-specific networks from dynamics and geometry of single cells.

Cell systems·2025
Same author

Towards a mathematical framework for modelling cell fate dynamics.

Journal of mathematical biology·2025
Same author

The topological properties of the protein universe.

Nature communications·2025

Related Experiment Video

Updated: Oct 20, 2025

Patterning via Optical Saturable Transitions - Fabrication and Characterization
08:19

Patterning via Optical Saturable Transitions - Fabrication and Characterization

Published on: December 11, 2014

7.0K

The design principles of discrete turing patterning systems.

Thomas Leyshon1, Elisa Tonello2, David Schnoerr1

  • 1Department of Life Sciences, Imperial College London, UK.

Journal of Theoretical Biology
|September 16, 2021
PubMed
Summary

Discrete cellular automata models reveal that Turing patterns, crucial for biological development, are more robust to parameter changes than previously thought, challenging continuous model assumptions.

Keywords:
Cellular automatonDevelopmental modelPattern formationRobustness

More Related Videos

Pattern Generation for Micropattern Traction Microscopy
09:26

Pattern Generation for Micropattern Traction Microscopy

Published on: February 17, 2022

2.4K
Origami Inspired Self-assembly of Patterned and Reconfigurable Particles
12:33

Origami Inspired Self-assembly of Patterned and Reconfigurable Particles

Published on: February 4, 2013

21.9K

Related Experiment Videos

Last Updated: Oct 20, 2025

Patterning via Optical Saturable Transitions - Fabrication and Characterization
08:19

Patterning via Optical Saturable Transitions - Fabrication and Characterization

Published on: December 11, 2014

7.0K
Pattern Generation for Micropattern Traction Microscopy
09:26

Pattern Generation for Micropattern Traction Microscopy

Published on: February 17, 2022

2.4K
Origami Inspired Self-assembly of Patterned and Reconfigurable Particles
12:33

Origami Inspired Self-assembly of Patterned and Reconfigurable Particles

Published on: February 4, 2013

21.9K

Area of Science:

  • Developmental Biology
  • Mathematical Biology
  • Computational Biology

Background:

  • Spatial structure formation is key in development, but underlying mechanisms are unclear.
  • Turing patterns are a leading hypothesis, yet their sensitivity to parameters in continuous models raises questions about their natural realization.
  • Most studies use continuous partial differential equation models.

Purpose of the Study:

  • To investigate Turing patterns using discrete cellular automata models.
  • To compare the robustness and predictability of Turing patterns in discrete versus continuous models.
  • To identify robust network topologies for Turing pattern formation.

Main Methods:

  • Conducted a large-scale study of all possible two-species reaction-diffusion networks using cellular automata.
  • Compared results from discrete models with established findings from continuous models.
  • Evaluated the predictive power of diffusion-driven instabilities and a refined criterion for pattern emergence.

Main Results:

  • Identified the same network topologies for Turing pattern formation in discrete models as in continuous models.
  • Found Turing pattern topologies to be significantly more robust to parameter variations in discrete models.
  • Observed that diffusion-driven instabilities are weaker predictors of Turing patterns in discrete models compared to continuous models.
  • Demonstrated a refined criterion as a stronger predictor for pattern emergence in discrete simulations.

Conclusions:

  • Turing mechanisms may be more robust in natural systems than suggested by continuous models.
  • Discrete modeling provides a more realistic assessment of Turing pattern robustness.
  • A deeper, unifying principle likely underlies Turing pattern formation across different modeling frameworks.