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

Maxam-Gilbert Sequencing01:05

Maxam-Gilbert Sequencing

In the same year as the discovery of the Sanger sequencing method, another group of scientists, Allan Maxam and Walter Gilbert, demonstrated their chemical-cleavage method for DNA sequencing. The Maxam-Gilbert method relies on using different chemicals that can cleave the DNA sequence at specific sites, the separation of resulting DNA fragments of variable size using electrophoresis, and deciphering the DNA sequence from the resulting gel bands.
Challenges of the Maxam-Gilbert Method
The...
Quartile01:15

Quartile

Quartiles are numbers that separate the data into quarters. Quartiles may or may not be part of the data. To find the quartiles, first, find the median or second quartile. The first quartile, Q1, is the middle value of the lower half of the data, and the third quartile, Q3, is the middle value, or median, of the upper half of the data. To get the idea, consider the same data set:
1; 1; 2; 2; 4; 6; 6.8; 7.2; 8; 8.3; 9; 10; 10; 11.5
The median or second quartile is seven. The lower half of the...
Extraction: Partition and Distribution Coefficients01:14

Extraction: Partition and Distribution Coefficients

The distribution law or Nernst's distribution law is the law that governs the distribution of a solute between two immiscible solvents. This law, also known as the partition law, states that if a solute is added to the mixture of two immiscible solvents at a constant temperature, the solute is distributed between the two solvents in such a way that the ratio of solute concentrations in the solvents remains constant at equilibrium.
For extracting a solute from an aqueous phase into an organic...
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...
Synthetic Disvision of Polynomials01:28

Synthetic Disvision of Polynomials

Synthetic division is an efficient algorithmic approach for dividing a polynomial by a linear binomial of the form x - c, where c is a real number. This method is helpful due to its streamlined process, which avoids the more cumbersome steps involved in the traditional long division of polynomials. It simplifies computation and serves as a practical tool for evaluating polynomials and identifying their factors.To perform synthetic division, one begins by listing the coefficients of the...
Fast Fourier Transform01:10

Fast Fourier Transform

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

You might also read

Related Articles

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

Sort by
Same author

The prevalence and incidence of narcolepsy in the United States: a real-world observational study using a validated narcolepsy case definition.

Sleep advances : a journal of the Sleep Research Society·2026
Same author

Clinical and quality of life consequences of regimen switching delays in HIV management: a stratified cohort analysis.

Scientific reports·2025
Same author

A graph homomorphism approach for unraveling histories of metastatic cancers and viral outbreaks under evolutionary constraints.

Nature communications·2025
Same author

Evolution of gene order in prokaryotes is driven primarily by gene gain and loss.

bioRxiv : the preprint server for biology·2025
Same author

Evolution of gene order in prokaryotes is driven primarily by gene gain and loss.

Proceedings of the National Academy of Sciences of the United States of America·2025
Same author

Early Increase in Serum Transthyretin by Acoramidis Independently Predicts Improved Survival in TTR Amyloid Cardiomyopathy.

Journal of the American College of Cardiology·2025
Same journal

Phylogenomics, introgression, and demographic history of extant flamingos (Aves: Phoenicopteridae).

Molecular phylogenetics and evolution·2026
Same journal

The biogeographic and evolutionary history of Leiosauridae lizards reveal the influence of complex environmental and geological past dynamics in the Neotropical biomes.

Molecular phylogenetics and evolution·2026
Same journal

Rapid ecological speciation in gall inducers.

Molecular phylogenetics and evolution·2026
Same journal

Integrative systematics reveal the deep evolutionary origin and familial placements of the wirrahs (Teleostei: Acanthistiidae: Acanthistius) and the toadstool grouper (Teleostei: Trachypomatidae fam. nov.: Trachypoma).

Molecular phylogenetics and evolution·2026
Same journal

Geographic distance and climate-mediated landscape resistance explain the genetic differentiation of Rhopalus sapporensis across China.

Molecular phylogenetics and evolution·2026
Same journal

Integrative taxonomic revision of Uropsilus (Uropsilinae, Talpidae) combining genomic, morphological and geographic evidence.

Molecular phylogenetics and evolution·2026
See all related articles

Related Experiment Video

Updated: May 31, 2026

Quadruple-Checkerboard: A Modification of the Three-Dimensional Checkerboard for Studying Drug Combinations
11:15

Quadruple-Checkerboard: A Modification of the Three-Dimensional Checkerboard for Studying Drug Combinations

Published on: July 24, 2021

Quartet MaxCut: a fast algorithm for amalgamating quartet trees.

Sagi Snir1, Satish Rao

  • 1Department of Evolutionary and Environmental Biology, University of Haifa, Haifa 31905, Israel. ssagi@research.haifa.ac.il

Molecular Phylogenetics and Evolution
|July 19, 2011
PubMed
Summary
This summary is machine-generated.

We developed a fast quartet amalgamation algorithm to build large phylogenetic trees from smaller ones. This method accurately reconstructs evolutionary history for many taxa, crucial for modern biological classification.

Related Experiment Videos

Last Updated: May 31, 2026

Quadruple-Checkerboard: A Modification of the Three-Dimensional Checkerboard for Studying Drug Combinations
11:15

Quadruple-Checkerboard: A Modification of the Three-Dimensional Checkerboard for Studying Drug Combinations

Published on: July 24, 2021

Area of Science:

  • Computational Biology
  • Phylogenetics
  • Evolutionary Biology

Background:

  • Accurate phylogenetic reconstruction is computationally intensive, limiting analyses to small datasets.
  • Modern genomics generates vast data, necessitating efficient methods for large-scale evolutionary history construction.
  • Supertree methods combine smaller phylogenetic trees to infer relationships across complete taxa sets.

Purpose of the Study:

  • To address the need for fast and accurate supertree construction methods.
  • To develop an efficient algorithm for quartet amalgamation, a fundamental step in supertree problems.
  • To support large-scale projects like Assembling the Tree of Life (ATOL).

Main Methods:

  • Devised a novel, extremely fast algorithm for quartet amalgamation.
  • Implemented the algorithm in highly efficient code.
  • Focused on combining minimal phylogenetic information (quartets) into a comprehensive evolutionary tree.

Main Results:

  • The new code demonstrates exceptional speed, handling over 100 million quartet trees.
  • The method is accurate for analyses involving several hundred taxa.
  • Successfully processed large numbers of quartets efficiently.

Conclusions:

  • The developed quartet amalgamation algorithm offers a significant advancement in computational phylogenetics.
  • This efficient approach enables accurate reconstruction of evolutionary histories for large, complex datasets.
  • Facilitates classification and understanding of evolutionary relationships across diverse organisms.