Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Quartile

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 Coefficients

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

Maxam-Gilbert Sequencing

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

Collisions in Multiple Dimensions: Problem Solving

Collisions in Multiple Dimensions: Problem Solving

In multiple dimensions, the conservation of momentum applies in each direction independently. Hence, to solve collisions in multiple dimensions, we should write down the momentum conservation in each direction separately. To help understand collisions in multiple dimensions, consider an example.
A small car of mass 1,200 kg traveling east at 60 km/h collides at an intersection with a truck of mass 3,000 kg traveling due north at 40 km/h. The two vehicles are locked together. What is the...

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

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 Polynomials

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

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

circ2DGNN: circRNA-Disease Association Prediction via Transformer-Based Graph Neural Network.

IEEE/ACM transactions on computational biology and bioinformatics·2024

Same journal

Hierarchical Hypergraph Learning in Association- Weighted Heterogeneous Network for miRNA- Disease Association Identification.

IEEE/ACM transactions on computational biology and bioinformatics·2024

Same journal

Discriminative Domain Adaption Network for Simultaneously Removing Batch Effects and Annotating Cell Types in Single-Cell RNA-Seq.

IEEE/ACM transactions on computational biology and bioinformatics·2024

Same journal

MLW-BFECF: A Multi-Weighted Dynamic Cascade Forest Based on Bilinear Feature Extraction for Predicting the Stage of Kidney Renal Clear Cell Carcinoma on Multi-Modal Gene Data.

IEEE/ACM transactions on computational biology and bioinformatics·2024

Same journal

An End-to-End Knowledge Graph Fused Graph Neural Network for Accurate Protein-Protein Interactions Prediction.

IEEE/ACM transactions on computational biology and bioinformatics·2024

Same journal

Generative Biomedical Event Extraction With Constrained Decoding Strategy.

IEEE/ACM transactions on computational biology and bioinformatics·2024

See all related articles

Search research articles

Related Experiment Video

Updated: Jun 7, 2026

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

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

Published on: July 24, 2021

Quartets MaxCut: a divide and conquer quartets algorithm.

Sagi Snir¹, Satish Rao

¹Institute of Evolution, University of Haifa, Haifa, Israel. ssagi@research.haifa.ac.il

IEEE/ACM Transactions on Computational Biology and Bioinformatics

|October 30, 2010

Summary

This summary is machine-generated.

This study introduces a novel algorithm for phylogenetic tree reconstruction using quartet trees, even with errors. It outperforms existing methods like Matrix Representation with Parsimony (MRP) for large-scale evolutionary analysis.

Related Experiment Videos

Last Updated: Jun 7, 2026

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

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

Published on: July 24, 2021

Area of Science:

Computational Biology
Phylogenetics
Bioinformatics

Background:

Accurate phylogenetic reconstruction is limited to small datasets.
Supertree methods are essential for constructing large-scale evolutionary trees, like the tree of life.
Quartet-based reconstruction is a fundamental yet challenging problem in phylogenetics.

Purpose of the Study:

To develop an algorithm for constructing phylogenetic trees from quartet trees with high error rates.
To address the challenge of conflicting and false quartet trees in supertree reconstruction.
To improve upon existing supertree methods, particularly Matrix Representation with Parsimony (MRP).

Main Methods:

A novel divide and conquer algorithm for phylogenetic tree construction.
Utilizes a semidefinite programming (SDP) formulation of MaxCut in the divide step.
Extends previous work on rooted triplet trees to unrooted quartets.

Main Results:

The algorithm successfully handles a significant fraction of errors in input quartet trees.
Empirical results show satisfactory conflict resolution.
The proposed method significantly outperforms and is faster than MRP methods.

Conclusions:

The new algorithm offers a robust solution for large-scale phylogenetic reconstruction using quartets.
It demonstrates superior performance compared to established MRP methods.
The approach provides a promising avenue for constructing the tree of life.