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

Survival Tree01:19

Survival Tree

Survival trees are a non-parametric method used in survival analysis to model the relationship between a set of covariates and the time until an event of interest occurs, often referred to as the "time-to-event" or "survival time." This method is particularly useful when dealing with censored data, where the event has not occurred for some individuals by the end of the study period, or when the exact time of the event is unknown.
 Building a Survival Tree
Constructing a survival tree begins...
Phylogenetic Trees03:21

Phylogenetic Trees

Phylogenetic trees come in many forms. It matters in which sequence the organisms are arranged from the bottom to the top of the tree, but the branches can rotate at their nodes without altering the information. The lines connecting individual nodes can be straight, angled, or even curved.The length of the branches can depict time or the relative amount of change among organisms. For instance, the branch length might indicate the number of amino acid changes in the sequence that underlies the...
Phylogenetic Trees03:21

Phylogenetic Trees

Phylogenetic trees come in many forms. It matters in which sequence the organisms are arranged from the bottom to the top of the tree, but the branches can rotate at their nodes without altering the information. The lines connecting individual nodes can be straight, angled, or even curved.The length of the branches can depict time or the relative amount of change among organisms. For instance, the branch length might indicate the number of amino acid changes in the sequence that underlies the...
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...
Kirchoff's Rules: Application01:22

Kirchoff's Rules: Application

Kirchhoff's rules quantify the current flowing through a circuit and the voltage variations around the loop in a circuit. Applying Kirchhoff's rules generates a set of linear equations that allow us to find the unknown values in circuits. These may be currents, voltages, or resistances.
When applying Kirchhoff's first rule, the junction rule, label the current in each branch and decide its direction. If the chosen direction is wrong, it will have the correct magnitude, although the current will...

You might also read

Related Articles

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

Sort by
Same author

Stably polarized 795  nm vertical-cavity surface-emitting lasers with anti-phase SiN<sub>x</sub> surface gratings.

Applied optics·2024
Same author

Low Threshold Current and Polarization-Stabilized 795 nm Vertical-Cavity Surface-Emitting Lasers.

Nanomaterials (Basel, Switzerland)·2023
Same author

Integrative metabolomics and transcriptomics analysis reveals novel therapeutic vulnerabilities in lung cancer.

Cancer medicine·2022
Same author

MCWS-Transformers: Towards an Efficient Modeling of Protein Sequences via Multi Context-Window Based Scaled Self-Attention.

IEEE/ACM transactions on computational biology and bioinformatics·2022
Same author

Development of highly gas-permeable polymers by metathesis copolymerization of 1-(<i>p</i>-trimethylsilyl)phenyl-1-propyne with <i>tert</i>-butyl and silyl group-containing diphenylacetylenes.

RSC advances·2022
Same author

Testing the agreement of trees with internal labels.

Algorithms for molecular biology : AMB·2021
Same journal

Haplotype-aware long-read error correction.

Algorithms for molecular biology : AMB·2026
Same journal

Extension of partial atom-to-atom maps: uniqueness and algorithms.

Algorithms for molecular biology : AMB·2026
Same journal

Lossless pangenome indexing using tag arrays.

Algorithms for molecular biology : AMB·2026
Same journal

Dolphyin: a combinatorial algorithm for identifying 1-Dollo phylogenies in cancer.

Algorithms for molecular biology : AMB·2026
Same journal

Probing transcription factor subsets in gene regulatory networks.

Algorithms for molecular biology : AMB·2026
Same journal

Comparing the ability of embedding methods on metabolic hypergraphs for capturing taxonomy-based features.

Algorithms for molecular biology : AMB·2026
See all related articles

Related Experiment Video

Updated: Jun 17, 2026

A Practical Guide to Phylogenetics for Nonexperts
12:00

A Practical Guide to Phylogenetics for Nonexperts

Published on: February 5, 2014

Constructing majority-rule supertrees.

Jianrong Dong1, David Fernández-Baca, F R McMorris

  • 1Department of Computer Science, Iowa State University, Ames, IA 50011, USA. jdong@iastate.edu

Algorithms for Molecular Biology : AMB
|January 6, 2010
PubMed
Summary
This summary is machine-generated.

This study presents an exact integer linear programming method for constructing majority-rule (+) supertrees. A data reduction heuristic improves computational feasibility for larger datasets, yielding biologically meaningful phylogenies.

More Related Videos

A Concoction Pipeline for Generating Molecular Operational Taxonomic Units (MOTUs) Among Riparian and Aquatic Beetles
10:23

A Concoction Pipeline for Generating Molecular Operational Taxonomic Units (MOTUs) Among Riparian and Aquatic Beetles

Published on: July 11, 2025

Related Experiment Videos

Last Updated: Jun 17, 2026

A Practical Guide to Phylogenetics for Nonexperts
12:00

A Practical Guide to Phylogenetics for Nonexperts

Published on: February 5, 2014

A Concoction Pipeline for Generating Molecular Operational Taxonomic Units (MOTUs) Among Riparian and Aquatic Beetles
10:23

A Concoction Pipeline for Generating Molecular Operational Taxonomic Units (MOTUs) Among Riparian and Aquatic Beetles

Published on: July 11, 2025

Area of Science:

  • Computational Biology
  • Phylogenetics
  • Bioinformatics

Background:

  • Supertree methods integrate phylogenetic data from multiple trees into a single supertree.
  • Existing methods often lack specific design properties.
  • Cotton and Wilkinson proposed majority-rule consensus tree extensions for supertrees.

Purpose of the Study:

  • To study and develop computational methods for majority-rule (+) supertrees.
  • To address the NP-hard problem underlying majority-rule (+) supertree construction.

Main Methods:

  • Developed an exact integer linear programming formulation for majority-rule (+) supertree construction.
  • Introduced a data reduction heuristic to simplify subproblems.
  • Conducted computational studies on real-world phylogenetic datasets.

Main Results:

  • Proved the NP-hardness of a key problem in majority-rule (+) supertree construction.
  • Demonstrated the computational feasibility of the exact method for moderately sized inputs.
  • Showed substantial problem-size reduction using the data reduction heuristic.

Conclusions:

  • The exact method is computationally feasible for moderately large datasets.
  • The data reduction heuristic enables tackling larger, previously intractable problems.
  • Both the exact method and the heuristic yield biologically meaningful phylogenies.