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

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Fast Decoupled and DC Powerflow01:24

Fast Decoupled and DC Powerflow

The fast decoupled power flow method addresses contingencies in power system operations, such as generator outages or transmission line failures. This method provides quick power flow solutions, essential for real-time system adjustments. Fast decoupled power flow algorithms simplify the Jacobian matrix by neglecting certain elements, leading to two sets of decoupled equations:
State Space Representation01:27

State Space Representation

The frequency-domain technique, commonly used in analyzing and designing feedback control systems, is effective for linear, time-invariant systems. However, it falls short when dealing with nonlinear, time-varying, and multiple-input multiple-output systems. The time-domain or state-space approach addresses these limitations by utilizing state variables to construct simultaneous, first-order differential equations, known as state equations, for an nth-order system.
Consider an RLC circuit, a...
Super-resolution Fluorescence Microscopy01:37

Super-resolution Fluorescence Microscopy

Super-resolution fluorescence microscopy (SRFM) provides a better resolution than conventional fluorescence microscopy by reducing the point spread function (PSF). PSF is the light intensity distribution from a point that causes it to appear blurred. Due to PSF, each fluorescing point appears bigger than its actual size, and it is the PSF interference of nearby fluorophores that causes the blurred image. Various approaches to achieving higher resolution through SRFM have recently been developed.

You might also read

Related Articles

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

Sort by
Same author

Reconciling fast Hepatitis B evolutionary rates with ancient co-divergence.

bioRxiv : the preprint server for biology·2026
Same author

Heterogeneity of Treatment Effects Across Nine Glucose-Lowering Drug Classes in Type 2 Diabetes: Extension of the LEGEND-T2DM Network Study.

Diabetes, obesity & metabolism·2026
Same author

Semaglutide and Neovascular Age-Related Macular Degeneration Among Adults with Type 2 Diabetes: An OHDSI Network Study.

Ophthalmology·2026
Same author

Global approaches to infectious disease surveillance and modeling.

Nature medicine·2026
Same author

Multimodal prediction of visual improvement in diabetic macular edema using real-world electronic health records and optical coherence tomography images.

medRxiv : the preprint server for health sciences·2026
Same author

Parallel algorithms for phylogenetic inference under a structured coalescent approximation.

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

The microlandscapes of tree trunks: the effect of lichen and tree-level characteristics on arthropod communities.

Philosophical transactions of the Royal Society of London. Series B, Biological sciences·2026
Same journal

Centimetre-scale landscapes to assess the motion behaviour and cognition of gastropods and bivalves.

Philosophical transactions of the Royal Society of London. Series B, Biological sciences·2026
Same journal

Intertidal microcosms of wave-swept rocky shores: ecological and physiological insights from a uniquely stressful environment.

Philosophical transactions of the Royal Society of London. Series B, Biological sciences·2026
Same journal

Temporal and spatial variation in temperature and oxygen at the microscale: key niche axes for aquatic life.

Philosophical transactions of the Royal Society of London. Series B, Biological sciences·2026
Same journal

Natural microcosms in ecology: fulfilling the promise of model systems?

Philosophical transactions of the Royal Society of London. Series B, Biological sciences·2026
Same journal

Microbe-induced galls and plant defence: metabolite crosstalk in a co-evolutionary battle.

Philosophical transactions of the Royal Society of London. Series B, Biological sciences·2026
See all related articles

Related Experiment Video

Updated: Jun 29, 2026

High-Throughput Analysis of Optical Mapping Data Using ElectroMap
07:36

High-Throughput Analysis of Optical Mapping Data Using ElectroMap

Published on: June 4, 2019

Fast, accurate and simulation-free stochastic mapping.

Vladimir N Minin1, Marc A Suchard

  • 1Department of Statistics, University of Washington, Seattle, WA 98195-4322, USA. vminin@u.washington.edu

Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences
|October 15, 2008
PubMed
Summary
This summary is machine-generated.

This study introduces an efficient, simulation-free algorithm for analyzing evolutionary trait changes on phylogenetic trees. It calculates the mean number of trait changes and mean evolutionary reward, aiding evolutionary biology research.

More Related Videos

Open-source Single-particle Analysis for Super-resolution Microscopy with VirusMapper
07:38

Open-source Single-particle Analysis for Super-resolution Microscopy with VirusMapper

Published on: April 9, 2017

Application of High-speed Super-resolution SPEED Microscopy in Live Primary Cilium
07:53

Application of High-speed Super-resolution SPEED Microscopy in Live Primary Cilium

Published on: January 16, 2018

Related Experiment Videos

Last Updated: Jun 29, 2026

High-Throughput Analysis of Optical Mapping Data Using ElectroMap
07:36

High-Throughput Analysis of Optical Mapping Data Using ElectroMap

Published on: June 4, 2019

Open-source Single-particle Analysis for Super-resolution Microscopy with VirusMapper
07:38

Open-source Single-particle Analysis for Super-resolution Microscopy with VirusMapper

Published on: April 9, 2017

Application of High-speed Super-resolution SPEED Microscopy in Live Primary Cilium
07:53

Application of High-speed Super-resolution SPEED Microscopy in Live Primary Cilium

Published on: January 16, 2018

Area of Science:

  • Evolutionary biology
  • Phylogenetics
  • Computational biology

Background:

  • Mapping discrete trait evolution onto phylogenies is crucial for understanding evolutionary processes.
  • Current methods often rely on computationally intensive simulations to assess evolutionary trajectories.
  • Identifying trait change locations and preferential changes is a key research interest.

Purpose of the Study:

  • To develop an efficient, simulation-free algorithm for computing key evolutionary trajectory properties.
  • To enable the calculation of the mean number of trait changes and mean evolutionary reward.
  • To facilitate new methods for testing trait correlations and analyzing selection pressures.

Main Methods:

  • Developed a novel, simulation-free algorithm for phylogenetic trait evolution analysis.
  • Algorithm computes the mean number of trait changes across specified categories.
  • Algorithm computes the mean evolutionary reward based on time spent in each trait state.

Main Results:

  • The new algorithm provides an efficient alternative to computationally expensive simulations.
  • Successfully applied the method to test for correlations between two evolutionary traits.
  • Demonstrated the mapping of synonymous and non-synonymous mutations on an HIV phylogenetic tree.

Conclusions:

  • The simulation-free algorithm offers a significant computational advantage for analyzing trait evolution.
  • The method enhances the ability to study trait correlations and evolutionary selection pressures.
  • This approach provides valuable insights into evolutionary trajectories and molecular evolution.