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

Heuristics01:21

Heuristics

Heuristics are problem-solving strategies that use mental shortcuts to simplify decision-making. Unlike algorithms, which must be followed precisely to achieve a correct result, heuristics offer a general problem-solving framework. They save time and energy but can sometimes lead to less rational decisions.
People often rely on heuristics when faced with an overload of information, limited time, low importance of the decision, limited information, or when a heuristic readily comes to mind. For...
Optimization Problems01:26

Optimization Problems

Optimization problems often involve identifying maximum or minimum values under specific constraints. A well-known example is determining the longest horizontal pipe that can be moved around a right-angled corner, where a 3-meter-wide hallway meets a 2-meter-wide hallway. This scenario, common in architectural design and industrial transport, can be understood conceptually through geometric and trigonometric reasoning.To visualize the problem, consider the pipe as a straight line that touches...
Extended Versions of Green’s Theorem01:27

Extended Versions of Green’s Theorem

Green’s Theorem connects the circulation of a vector field around a closed curve with the behavior of the field across the region enclosed by that curve. It provides a way to replace a line integral around a boundary with a double integral over the interior region, making it especially useful in plane geometry, fluid flow, and vector calculus.Although Green’s Theorem is often introduced using simple regions without gaps, it can also be applied to regions made from several simple parts. This...
Woodward–Hoffmann Selection Rules and Microscopic Reversibility01:34

Woodward–Hoffmann Selection Rules and Microscopic Reversibility

Electrocyclic reactions, cycloadditions, and sigmatropic rearrangements are concerted pericyclic reactions that proceed via a cyclic transition state. These reactions are stereospecific and regioselective. The stereochemistry of the products depends on the symmetry characteristics of the interacting orbitals and the reaction conditions. Accordingly, pericyclic reactions are classified as either symmetry-allowed or symmetry-forbidden. Woodward and Hoffmann presented the selection criteria for...
Green’s Theorem01:27

Green’s Theorem

Green’s Theorem establishes a relationship between a line integral around a closed plane curve and a double integral over the region enclosed by that curve. It applies to a vector field F(x, y) = 〈P(x, y), Q(x, y)〉, where P and Q have continuous first partial derivatives on an open set containing the region.Let C be a positively oriented, simple, closed, piecewise smooth curve, and let R be the plane region bounded by C. Green’s Theorem states that\begin{equation*}\oint_C P\,dx+Q\,dy =\iint_R...
Theorems of Pappus and Guldinus: Problem Solving01:12

Theorems of Pappus and Guldinus: Problem Solving

Pappus and Guldinus's theorems are powerful mathematical principles that are used for finding the surface area and volume of composite shapes. For example, consider a cylindrical storage tank with a conical top. Finding the surface area or volume can be challenging for such complex shapes. These theorems are particularly useful in calculating the volume and surface area of such systems. Here, the cylindrical storage tank with a conical top can be broken down into two simple shapes: a cylinder...

You might also read

Related Articles

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

Sort by
Same author

A PLUM Job: Peptide modeLs for Understanding and engineering antiMicrobial therapeutics.

bioRxiv : the preprint server for biology·2026
Same author

Phylo-rs: an extensible phylogenetic analysis library in rust.

BMC bioinformatics·2025
Same author

Computing generalized cophenetic distances under all Lp norms: A near-linear time algorithmic framework.

PLoS computational biology·2025
Same author

Ancient reticulation, incomplete lineage sorting and the evolution of the pyrenoid at the dawn of hornwort diversification.

Annals of botany·2025
Same author

All tangled up: Unraveling phylogenetics and reticulate evolution in the vining ferns, Lygodium (Schizaeales).

American journal of botany·2024
Same author

Discovering genomic islands in unannotated bacterial genomes using sequence embedding.

Bioinformatics advances·2024
Same journal

Proteins Rich in Prime Mass Residues and Their Role in Cell Biology.

Evolutionary bioinformatics online·2026
Same journal

Hybrid Feature Selection-Based Machine Learning and Deep Learning Framework for Biomarker Prediction From RNA-seq Data During Dengue Fever to Severe Dengue Progression.

Evolutionary bioinformatics online·2026
Same journal

Functional Annotation and Molecular Characterization of a Hypothetical Protein From <i>Mycobacterium leprae</i> Through <i>In Silico</i> Approaches: A Potential Therapeutic Target.

Evolutionary bioinformatics online·2026
Same journal

Evolutionary Bioinformatics Expands its Breadth.

Evolutionary bioinformatics online·2026
Same journal

Gene Expression Underlying Teloblast Formation in Leech (Annelida: Hirudinae).

Evolutionary bioinformatics online·2026
Same journal

Computational Optimization of CRISPR-Cas13a sgRNAs Targeting the SARS-CoV-2 Spike Gene for SHERLOCK-Based Diagnostics.

Evolutionary bioinformatics online·2026
See all related articles

Related Experiment Video

Updated: Jun 23, 2026

Evaluation of an Exclusive Spur Dike U-Turn Design with Radar-Collected Data and Simulation
11:41

Evaluation of an Exclusive Spur Dike U-Turn Design with Radar-Collected Data and Simulation

Published on: February 1, 2020

Improved heuristics for minimum-flip supertree construction.

Duhong Chen1, Oliver Eulenstein, David Fernández-Baca

  • 1Department of Computer Science, Iowa State University, Ames, IA 50011, U.S.A. duhong@iastate.edu

Evolutionary Bioinformatics Online
|May 21, 2009
PubMed
Summary
This summary is machine-generated.

A new heuristic algorithm significantly speeds up the matrix representation with flipping (MRF) supertree method. This advancement makes MRF practical for large datasets and shows it can be more accurate than other methods like matrix representation with parsimony (MRP).

Keywords:
Supertreematrix representation with flippingmatrix representation with parsimonyphylogenetic treestree search heuristics

More Related Videos

Novel and Innovative Hybrid Technique for Type A Aortic Dissection
06:26

Novel and Innovative Hybrid Technique for Type A Aortic Dissection

Published on: March 28, 2025

Related Experiment Videos

Last Updated: Jun 23, 2026

Evaluation of an Exclusive Spur Dike U-Turn Design with Radar-Collected Data and Simulation
11:41

Evaluation of an Exclusive Spur Dike U-Turn Design with Radar-Collected Data and Simulation

Published on: February 1, 2020

Novel and Innovative Hybrid Technique for Type A Aortic Dissection
06:26

Novel and Innovative Hybrid Technique for Type A Aortic Dissection

Published on: March 28, 2025

Area of Science:

  • Phylogenetics
  • Computational Biology
  • Bioinformatics

Background:

  • The matrix representation with flipping (MRF) supertree method is valuable but computationally limited by slow heuristic algorithms.
  • Previous MRF algorithms were not efficient for large-scale phylogenetic analyses.

Purpose of the Study:

  • To introduce a novel, faster heuristic algorithm for MRF supertree construction.
  • To enable practical, large-scale supertree analyses using the MRF method.
  • To compare the performance and accuracy of MRF with other supertree methods.

Main Methods:

  • Development of a new heuristic algorithm for MRF supertree construction.
  • Application of the new algorithm to three published supertree datasets (267-571 taxa).
  • Comparison of MRF supertrees with matrix representation with parsimony (MRP) and modified min-cut supertrees.

Main Results:

  • The new heuristic algorithm improves MRF construction speed by a factor of n (number of taxa).
  • MRF supertrees demonstrated equal or greater similarity to input trees compared to MRP and modified min-cut methods on average.
  • Significant differences were observed between MRF and MRP supertrees.

Conclusions:

  • The enhanced MRF algorithm makes supertree construction tractable for large datasets.
  • MRF is a practical and potentially more accurate alternative to the widely used MRP supertree method.
  • This work facilitates broader application and comparison of MRF in phylogenetics.