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

Survival Tree01:19

Survival Tree

86
Survival trees are a non-parametric method used in survival analysis to model the relationship between a set of covariates and the time until an event of interest occurs, often referred to as the "time-to-event" or "survival time." This method is particularly useful when dealing with censored data, where the event has not occurred for some individuals by the end of the study period, or when the exact time of the event is unknown.
 Building a Survival Tree
Constructing a...
86
Quantifying and Rejecting Outliers: The Grubbs Test01:02

Quantifying and Rejecting Outliers: The Grubbs Test

1.6K
Sometimes, a data set can have a recorded numerical observation that greatly  deviates from the rest of the data. Assuming that the data is normally distributed, a statistical method called the Grubbs test can be used to determine whether the observation is truly an outlier.  To perform a two-tailed Grubbs test, first, calculate the absolute difference between the outlier and the mean. Then, calculate the ratio between this difference and the standard deviation of the sample. This...
1.6K
Sieve Analysis and Grading Curves01:19

Sieve Analysis and Grading Curves

364
Sieve analysis is a method used to determine the particle size distribution of aggregate materials. This process involves the following steps:
364
Types of Aggregate Grading01:15

Types of Aggregate Grading

511
Aggregate grading is crucial in economically obtaining a concrete mix with adequate strength, reasonable workability, and minimal segregation. There are four types of aggregate gradation: well-graded, uniformly (or one-sized) graded, gap-graded, and open-graded.
Well-graded aggregates include a complete range of necessary size fractions that fit together to create a dense matrix with minimal voids, represented by a smooth, continuous gradation curve. This type of grading ensures good...
511
Pedigree Analysis01:35

Pedigree Analysis

84.3K
Overview
84.3K
Ranks01:02

Ranks

236
Unlike parametric methods, nonparametric statistics are ideal for nominal and ordinal data, requiring fewer assumptions about the population's nature or distribution. This makes nonparametric methods easier to apply and interpret, as they do not depend on parameters like mean or standard deviation. One common approach in nonparametric analysis is to sort data according to a specific criterion. For instance, we might arrange weather data from hottest to coldest days in a month or rank cities...
236

You might also read

Related Articles

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

Sort by
Same author

Unifying phylogenetic traversal and deep learning to guide tree exploration.

bioRxiv : the preprint server for biology·2026
Same author

Phylogenetic Tree Instability After Taxon Addition: Empirical Frequency, Predictability, and Consequences For Online Inference.

Systematic biology·2024
Same author

The Fossilized Birth-Death Model Is Identifiable.

Systematic biology·2024
Same author

Estimating the mean in the space of ranked phylogenetic trees.

Bioinformatics (Oxford, England)·2024
Same author

A fast lasso-based method for inferring higher-order interactions.

PLoS computational biology·2022
Same author

Testing for Phylogenetic Signal in Single-Cell RNA-Seq Data.

Journal of computational biology : a journal of computational molecular cell biology·2022
Same journal

Slow Evolution Towards Generalism in a Model of Variable Dietary Range.

Bulletin of mathematical biology·2026
Same journal

CBINN: Cancer Biology-Informed Neural Network for Unknown Parameter Estimation and Missing Physics Identification.

Bulletin of mathematical biology·2026
Same journal

A Cost-Sensitive Behavioral Modeling Analysis of the Early Identification and Control of Infectious Diseases.

Bulletin of mathematical biology·2026
Same journal

Tracking Dynamics of Superspreading Through Contacts, Exposures, and Transmissions in Edge-Based Network Epidemics.

Bulletin of mathematical biology·2026
Same journal

The Exact Hypergeometric Posterior Method for Accurate Inference of Population Size from Mark-Recapture Data.

Bulletin of mathematical biology·2026
Same journal

Modeling, Analysis, and Optimal Control of Leukemic Cell Population Dynamics Under Therapy.

Bulletin of mathematical biology·2026
See all related articles

Related Experiment Video

Updated: Jul 4, 2025

Scalable, Flexible, and Cost-Effective Seedling Grafting
09:33

Scalable, Flexible, and Cost-Effective Seedling Grafting

Published on: January 6, 2023

1.9K

Ranked Subtree Prune and Regraft.

Lena Collienne1, Chris Whidden2, Alex Gavryushkin3,4

  • 1Biological Data Science Laboratory, School of Mathematics and Statistics, University of Canterbury, Christchurch, New Zealand. lena@lenacoll.de.

Bulletin of Mathematical Biology
|January 31, 2024
PubMed
Summary
This summary is machine-generated.

We introduce novel ranked Subtree Prune and Regraft (SPR) treespaces for analyzing phylogenetic time trees. Surprisingly, adding leaves can decrease ranked SPR distance, impacting evolutionary inference algorithms.

Keywords:
PhylogeneticsRanked treesTime treesTree RearrangementsTree distanceTreespace

More Related Videos

Use of Principal Components for Scaling Up Topographic Models to Map Soil Redistribution and Soil Organic Carbon
09:44

Use of Principal Components for Scaling Up Topographic Models to Map Soil Redistribution and Soil Organic Carbon

Published on: October 16, 2018

10.2K
A Simple Planting Technique for Re-establishing Trees Where Frequent Inundation Occurs
04:41

A Simple Planting Technique for Re-establishing Trees Where Frequent Inundation Occurs

Published on: January 26, 2018

6.2K

Related Experiment Videos

Last Updated: Jul 4, 2025

Scalable, Flexible, and Cost-Effective Seedling Grafting
09:33

Scalable, Flexible, and Cost-Effective Seedling Grafting

Published on: January 6, 2023

1.9K
Use of Principal Components for Scaling Up Topographic Models to Map Soil Redistribution and Soil Organic Carbon
09:44

Use of Principal Components for Scaling Up Topographic Models to Map Soil Redistribution and Soil Organic Carbon

Published on: October 16, 2018

10.2K
A Simple Planting Technique for Re-establishing Trees Where Frequent Inundation Occurs
04:41

A Simple Planting Technique for Re-establishing Trees Where Frequent Inundation Occurs

Published on: January 26, 2018

6.2K

Area of Science:

  • Computational Biology
  • Evolutionary Biology
  • Bioinformatics

Background:

  • Phylogenetic time trees model evolutionary histories, crucial for understanding virus transmission and cancer evolution.
  • Reconstructing time trees often uses Bayesian inference with Markov Chain Monte Carlo (MCMC) sampling.
  • Existing tree rearrangement operations like Subtree Prune and Regraft (SPR) are well-studied, but time tree variants are less understood.

Purpose of the Study:

  • To introduce and study novel treespaces based on ranked Subtree Prune and Regraft (SPR) operations for phylogenetic time trees.
  • To analyze algorithmic properties, computational complexity, and distances within these new treespaces.
  • To compare these novel treespaces with existing tree rearrangement spaces.

Main Methods:

  • Modification of the classical SPR rearrangement operation applied to ranked phylogenetic trees.
  • Analysis of algorithmic properties, focusing on distance computation complexity.
  • Comparison with established tree rearrangement based treespaces.

Main Results:

  • Introduction of two novel treespaces based on ranked SPR operations.
  • Characterization of algorithmic properties, including distance computation complexity.
  • Demonstration of the counterintuitive finding that adding leaves can decrease ranked SPR distance.

Conclusions:

  • The newly defined ranked SPR treespaces offer a framework for analyzing time tree algorithms.
  • The counterintuitive distance property has implications for time tree sampling, particularly with uncertain taxa.
  • Further study of these treespaces can enhance comparative analysis of phylogenetic inference methods.