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

Bootstrapping01:24

Bootstrapping

840
The term "bootstrap" originated in the 19th century as a metaphor for self-improvement or achieving something independently, without external assistance. This concept extends to statistical bootstrapping, a self-contained method for estimating population parameters through resampling, even though it can be computationally intensive. Developed by the American statistician Dr. Bradley Efron in 1979, bootstrapping provides a robust way to perform inference when the original sample size is...
840
Improving Translational Accuracy02:07

Improving Translational Accuracy

15.2K
Base complementarity between the three base pairs of mRNA codon and the tRNA anticodon is not a failsafe mechanism. Inaccuracies can range from a single mismatch to no correct base pairing at all. The free energy difference between the correct and nearly correct base pairs can be as small as 3 kcal/ mol. With complementarity being the only proofreading step, the estimated error frequency would be one wrong amino acid in every 100 amino acids incorporated. However, error frequencies observed in...
15.2K
Improving Translational Accuracy02:07

Improving Translational Accuracy

3.7K
3.7K
Fast Fourier Transform01:10

Fast Fourier Transform

1.0K
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...
1.0K
Upsampling01:22

Upsampling

651
Managing signal sampling rates is essential in digital signal processing to maintain signal integrity. A decimated signal, characterized by a reduced frequency range due to its lower sampling rate, can be upsampled by inserting zeros between each sample. This upsampling process expands the original spectrum and introduces repeated spectral replicas at intervals dictated by the new Nyquist frequency. To refine this zero-inserted sequence, it is passed through a lowpass filter with a cutoff...
651
Linear Approximation in Time Domain01:21

Linear Approximation in Time Domain

379
Nonlinear systems often require sophisticated approaches for accurate modeling and analysis, with state-space representation being particularly effective. This method is especially useful for systems where variables and parameters vary with time or operating conditions, such as in a simple pendulum or a translational mechanical system with nonlinear springs.
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length,...
379

You might also read

Related Articles

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

Sort by
Same author

GTRspmix: Capturing Heterogeneity of Exchangeabilities Across Sites to Improve Protein Phylogenetics.

bioRxiv : the preprint server for biology·2026
Same author

The synergy of foundation technologies and computer sciences advances microbial expression systems in biomedical genetic engineering.

International review of cell and molecular biology·2026
Same author

IQ-TREE 3: phylogenomic inference software using complex evolutionary models.

Molecular biology and evolution·2026
Same author

piqtree: a python package for seamless phylogenetic inference with IQ-TREE.

Molecular biology and evolution·2026
Same author

Rate variation and recurrent sequence errors in pandemic-scale phylogenetics.

Nature methods·2026
Same author

Phylogenetic Accuracy Under Non-Stationary and Non-Homogeneous Conditions: A Simulation Study.

Systematic biology·2026
Same journal

Phylogenomic blind spots: The limits of UCE and BUSCO loci in the presence of gene flow.

Molecular biology and evolution·2026
Same journal

seqLens: optimizing language models for genomic predictions.

Molecular biology and evolution·2026
Same journal

The transcriptional and translational outcomes for pseudogenes in bacterial endosymbionts.

Molecular biology and evolution·2026
Same journal

800 million years of co-evolution in the green plant lineage - the case of LEUNIG and SEUSS transcriptional co-regulators.

Molecular biology and evolution·2026
Same journal

RNA i-motif landscapes in plant kingdom and their potential functional roles.

Molecular biology and evolution·2026
Same journal

Functional Divergence and Structural Changes of class IV Histone Deacetylases (HDACs) Across the Tree of Life.

Molecular biology and evolution·2026
See all related articles

Related Experiment Video

Updated: Feb 20, 2026

Blood Flow Imaging with Ultrafast Doppler
05:57

Blood Flow Imaging with Ultrafast Doppler

Published on: October 14, 2020

8.5K

UFBoot2: Improving the Ultrafast Bootstrap Approximation.

Diep Thi Hoang1, Olga Chernomor2, Arndt von Haeseler2,3

  • 1Faculty of Information Technology, University of Engineering and Technology, Vietnam National University, Hanoi, Vietnam.

Molecular Biology and Evolution
|October 28, 2017
PubMed
Summary
This summary is machine-generated.

The new UFBoot2 method significantly speeds up phylogenetic tree analysis, offering more accurate branch supports than standard bootstrap methods, especially for large datasets. It is a faster and more reliable alternative for evolutionary studies.

Keywords:
maximum likelihoodmodel violationphylogenetic inferencepolytomiesultrafast bootstrap

Related Experiment Videos

Last Updated: Feb 20, 2026

Blood Flow Imaging with Ultrafast Doppler
05:57

Blood Flow Imaging with Ultrafast Doppler

Published on: October 14, 2020

8.5K

Area of Science:

  • Computational Biology
  • Phylogenetics
  • Bioinformatics

Background:

  • Standard bootstrap (SBS) is computationally intensive for phylogenetic analyses.
  • Ultrafast bootstrap approximation (UFBoot) was developed to improve speed and accuracy over SBS.
  • UFBoot is widely adopted but can overestimate branch supports with polytomies or model violations.

Purpose of the Study:

  • Introduce UFBoot2, an improved ultrafast bootstrap approximation.
  • Enhance computational speed and accuracy in phylogenetic analyses.
  • Provide robust bootstrap resampling strategies for phylogenomic data.

Main Methods:

  • Developed UFBoot2, an advancement of the UFBoot algorithm.
  • Implemented UFBoot2 within the IQ-TREE software package (version 1.6).
  • Evaluated UFBoot2 performance against standard bootstrap and RAxML rapid bootstrap.

Main Results:

  • UFBoot2 substantially accelerates bootstrap approximation compared to UFBoot and SBS.
  • UFBoot2 reduces overestimation of branch supports, particularly with polytomies or model violations.
  • UFBoot2 demonstrates significant speed improvements: 778x faster than SBS and 8.4x faster than RAxML rapid bootstrap (median).

Conclusions:

  • UFBoot2 offers a highly efficient and accurate method for phylogenetic branch support estimation.
  • UFBoot2 is a suitable and recommended tool for phylogenomic data analysis.
  • UFBoot2 is freely available in IQ-TREE, promoting wider adoption in evolutionary biology research.