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

776
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...
776
Fast Decoupled and DC Powerflow01:24

Fast Decoupled and DC Powerflow

687
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:
687
Buffers: Buffer Capacity01:09

Buffers: Buffer Capacity

2.1K
Buffer capacity is the quantitative measure of a buffer to resist the change in pH. As shown in the following equation, the buffer capacity, denoted by 'beta', is expressed as the number of moles of acid or base needed to change the pH of a one-liter buffer solution by 1 unit. Here, Ca and Cb indicate the number of moles of acid and base, respectively. Note that dpH represents the change in pH.
In the graph, pH is plotted as a function of the number of moles of base (Cb) added to a weak...
2.1K
Improving Translational Accuracy02:07

Improving Translational Accuracy

14.0K
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...
14.0K
Improving Translational Accuracy02:07

Improving Translational Accuracy

3.5K
3.5K
Fast Fourier Transform01:10

Fast Fourier Transform

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

You might also read

Related Articles

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

Sort by
Same author

Genetic affinities between the ancient Greek colony of Amvrakia and its metropolis.

Genome biology·2026
Same author

A systematic exploration of current limitations of cognate-based phylogenetic inference.

Open research Europe·2026
Same author

Bit-reproducible parallel phylogenetic tree inference.

Bioinformatics (Oxford, England)·2026
Same author

Performance assessment of phylogenetic inference tools using PhyloSmew.

Bioinformatics advances·2025
Same author

raxtax: a k-mer-based non-Bayesian taxonomic classifier.

Bioinformatics (Oxford, England)·2025
Same author

Advances and challenges in understanding evolution through genome comparison: meeting report of the European Molecular Biology Organization (EMBO) lecture course "Evolutionary and Comparative Genomics".

Bioinformatics advances·2025
Same journal

MCFST: Spatial domain identification method based on multi-view graph convolutional network and graph fusion network.

Bioinformatics (Oxford, England)·2026
Same journal

SpaBiT: Enhancing Spatial Transcriptomics Resolution via Bidirectional Attention Transformers.

Bioinformatics (Oxford, England)·2026
Same journal

EDEL: Enhancing Dense Retrievers for Curation of Biomedical Knowledge Bases.

Bioinformatics (Oxford, England)·2026
Same journal

Informative Relational Learning for Adverse Reaction Prediction with Enhanced Generalization to Novel Drugs.

Bioinformatics (Oxford, England)·2026
Same journal

An interpretable deep learning framework uncovers features governing CRISPR-Cas9 genome-editing efficiency.

Bioinformatics (Oxford, England)·2026
Same journal

3DICE: Interpretable 3D Cross-Modal Learning for Drug-Target Interaction Prediction and Large-Scale Drug Discovery.

Bioinformatics (Oxford, England)·2026
See all related articles

Related Experiment Video

Updated: Jan 3, 2026

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

Scalable, Flexible, and Cost-Effective Seedling Grafting

Published on: January 6, 2023

2.3K

A fast and memory-efficient implementation of the transfer bootstrap.

Sarah Lutteropp1, Alexey M Kozlov1, Alexandros Stamatakis1,2

  • 1Computational Molecular Evolution Group, Heidelberg Institute for Theoretical Studies, Heidelberg 69118.

Bioinformatics (Oxford, England)
|November 23, 2019
PubMed
Summary
This summary is machine-generated.

We developed a faster and more memory-efficient transfer bootstrap expectation (TBE) method for phylogenetic analysis. This new implementation significantly improves upon existing tools, making phylogenetic tree support calculations more accessible for large datasets.

More Related Videos

An Efficient In Vitro Transposition Method by a Transcriptionally Regulated Sleeping Beauty System Packaged into an Integration Defective Lentiviral Vector
10:13

An Efficient In Vitro Transposition Method by a Transcriptionally Regulated Sleeping Beauty System Packaged into an Integration Defective Lentiviral Vector

Published on: January 12, 2018

9.3K
A Simple and Effective Transplantation Device for Zebrafish Embryos
06:59

A Simple and Effective Transplantation Device for Zebrafish Embryos

Published on: August 2, 2021

4.1K

Related Experiment Videos

Last Updated: Jan 3, 2026

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

Scalable, Flexible, and Cost-Effective Seedling Grafting

Published on: January 6, 2023

2.3K
An Efficient In Vitro Transposition Method by a Transcriptionally Regulated Sleeping Beauty System Packaged into an Integration Defective Lentiviral Vector
10:13

An Efficient In Vitro Transposition Method by a Transcriptionally Regulated Sleeping Beauty System Packaged into an Integration Defective Lentiviral Vector

Published on: January 12, 2018

9.3K
A Simple and Effective Transplantation Device for Zebrafish Embryos
06:59

A Simple and Effective Transplantation Device for Zebrafish Embryos

Published on: August 2, 2021

4.1K

Area of Science:

  • Computational Biology
  • Phylogenetics
  • Bioinformatics

Background:

  • Classical phylogenetic bootstrap support is computationally intensive for large datasets.
  • The transfer bootstrap expectation (TBE) was proposed as an alternative but original implementations are resource-heavy.

Purpose of the Study:

  • To develop a fast and memory-efficient implementation of the transfer bootstrap expectation (TBE) branch support metric.
  • To overcome the computational and memory limitations of existing TBE tools.

Main Methods:

  • Algorithmic and technical optimizations were applied to the original TBE algorithm.
  • The new implementation was tested on empirical and random tree sets with varying taxon numbers.

Main Results:

  • The new TBE implementation is up to 480 times faster than the original 'booster' tool.
  • It requires only linear memory with respect to the number of taxa, achieving 10× to 40× memory savings.

Conclusions:

  • The optimized TBE implementation provides a significant computational advantage for phylogenetic analyses.
  • This enhanced tool is integrated into pll-modules and RAxML-NG, improving accessibility for large-scale phylogenetics.