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

117
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...
117
Fast Fourier Transform01:10

Fast Fourier Transform

521
The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
521
One-Way ANOVA: Equal Sample Sizes01:15

One-Way ANOVA: Equal Sample Sizes

3.5K
One-Way ANOVA can be performed on three or more samples with equal or unequal sample sizes. When one-way ANOVA is performed on two datasets with samples of equal sizes, it can be easily observed that the computed F statistic is highly sensitive to the sample mean.
Different sample means can result in different values for the variance estimate: variance between samples. This is because the variance between samples is calculated as the product of the sample size and the variance between the...
3.5K
Friedman Two-way Analysis of Variance by Ranks01:21

Friedman Two-way Analysis of Variance by Ranks

326
Friedman's Two-Way Analysis of Variance by Ranks is a nonparametric test designed to identify differences across multiple test attempts when traditional assumptions of normality and equal variances do not apply. Unlike conventional ANOVA, which requires normally distributed data with equal variances, Friedman's test is ideal for ordinal or non-normally distributed data, making it particularly useful for analyzing dependent samples, such as matched subjects over time or repeated measures...
326
Statistical Inference Techniques in Hypothesis Testing: Parametric Versus Nonparametric Data01:16

Statistical Inference Techniques in Hypothesis Testing: Parametric Versus Nonparametric Data

251
Statistical inference techniques, paramount in hypothesis testing, differentiate into two broad categories: parametric and nonparametric statistics.
Parametric statistics, as the name suggests, assumes that data follow a specific distribution, often a normal distribution. This assumption enables robust hypothesis testing and estimation. Parametric methods, like the Student's t-test or Goodness-of-fit test, are frequently employed in biostatistics due to their robustness. For instance,...
251
Ranks01:02

Ranks

297
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...
297

You might also read

Related Articles

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

Sort by
Same author

Accuracy of occurrence and abundance estimates from insect metabarcoding.

bioRxiv : the preprint server for biology·2026
Same author

Spatial overlap and temporal synchrony between guilds of insect hosts and parasitoids.

The Journal of animal ecology·2026
Same author

HAPP: High-accuracy pipeline for processing deep metabarcoding data.

PLoS computational biology·2025
Same author

Small Bugs, Big Data: Metagenomics for Arthropod Biodiversity Monitoring.

Ecology and evolution·2025
Same author

High-throughput biodiversity surveying sheds new light on the brightest of insect taxa.

Proceedings. Biological sciences·2025
Same author

Temperature and water availability drive insect seasonality across a temperate and a tropical region.

Proceedings. Biological sciences·2024
Same journal

Phylogenetic systematics of the Homalonotidae (Trilobita): taxonomic reassessment and implications for Devonian trilobites.

Cladistics : the international journal of the Willi Hennig Society·2026
Same journal

Advancing FAIR phylogenetics for health threats: a systematic review of SARS-CoV-2 research and guidelines for future outbreaks.

Cladistics : the international journal of the Willi Hennig Society·2026
Same journal

Unravelling the phylogeny of armadillos and their kin (Mammalia, Xenarthra, Cingulata) combining morphological, molecular, and stratigraphic data.

Cladistics : the international journal of the Willi Hennig Society·2026
Same journal

Phylogenomics and the evolutionary history of the Oxyurida (pinworms).

Cladistics : the international journal of the Willi Hennig Society·2026
Same journal

Budding speciation, mitochondrial capture and introgression between surface and cave lineages in the Asellus aquaticus species complex.

Cladistics : the international journal of the Willi Hennig Society·2026
Same journal

Some considerations about Cotton and Wilkinson's "majority rule supertrees".

Cladistics : the international journal of the Willi Hennig Society·2026
See all related articles

Related Experiment Video

Updated: Oct 9, 2025

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments
08:12

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments

Published on: March 1, 2022

2.6K

Fast Fitch-Parsimony Algorithms for Large Data Sets.

Fredrik Ronquist1

  • 1Department of Zoology, Uppsala University, Villavägen 9, SE-752 36, Uppsala, Sweden.

Cladistics : the International Journal of the Willi Hennig Society
|December 21, 2021
PubMed
Summary
This summary is machine-generated.

This study introduces faster Fitch-parsimony algorithms for phylogenetic analysis. Optimized algorithms significantly speed up tree searching for large datasets, aiding systematic biology research.

More Related Videos

Simultaneous Data Collection of fMRI and fNIRS Measurements Using a Whole-Head Optode Array and Short-Distance Channels
08:19

Simultaneous Data Collection of fMRI and fNIRS Measurements Using a Whole-Head Optode Array and Short-Distance Channels

Published on: October 20, 2023

1.2K
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

7.7K

Related Experiment Videos

Last Updated: Oct 9, 2025

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments
08:12

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments

Published on: March 1, 2022

2.6K
Simultaneous Data Collection of fMRI and fNIRS Measurements Using a Whole-Head Optode Array and Short-Distance Channels
08:19

Simultaneous Data Collection of fMRI and fNIRS Measurements Using a Whole-Head Optode Array and Short-Distance Channels

Published on: October 20, 2023

1.2K
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

7.7K

Area of Science:

  • Computational Biology
  • Phylogenetics
  • Bioinformatics

Background:

  • Increasingly large datasets in systematics necessitate faster analytical algorithms.
  • Existing Fitch-parsimony tree search algorithms can be computationally intensive.

Purpose of the Study:

  • To present time-saving modifications to Fitch-parsimony tree search algorithms.
  • To enhance algorithm efficiency for large phylogenetic datasets.

Main Methods:

  • Implemented shortcuts for rapid tree length evaluation and reoptimization.
  • Developed search strategies for progressively exhaustive branch swapping.
  • Restructured algorithms for parallel processing using character packing (horizontal/vertical) and optimized instruction flow on modern microprocessors.

Main Results:

  • Multicharacter algorithms demonstrate significant speed improvements over single-character equivalents.
  • Estimated speed gains of 3.6-10 times on a PowerPC 604.
  • Greater speed enhancements observed on processors with SIMD (Single Instruction, Multiple Data) technologies like MMX and Altivec.

Conclusions:

  • Modified Fitch-parsimony algorithms offer substantial speed advantages for analyzing large datasets.
  • These computational enhancements are particularly beneficial for nucleotide character data.
  • The optimized algorithms leverage modern microprocessor capabilities for efficient phylogenetic inference.