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

Routh-Hurwitz Criterion II01:19

Routh-Hurwitz Criterion II

581
In the application of the Routh-Hurwitz criterion, two specific scenarios can arise that complicate stability analysis.
The first scenario occurs when a singular zero appears in the first column of the Routh table. This situation creates a division by zero issues. To resolve this, a small positive or negative number, denoted as epsilon (∈), is substituted for the zero. The stability analysis proceeds by assuming a sign for ∈. If ∈ is positive, any sign change in the first...
581
Routh-Hurwitz Criterion I01:15

Routh-Hurwitz Criterion I

390
Consider an electrical power grid, where stability is essential to prevent blackouts. The Routh-Hurwitz criterion is a valuable tool for assessing system stability under varying load conditions or faults. By analyzing the closed-loop transfer function, the Routh-Hurwitz criterion helps determine whether the system remains stable.
To apply the Routh-Hurwitz criterion, a Routh table is constructed. The table's rows are labeled with powers of the complex frequency variable s, starting from the...
390
Second Uniqueness Theorem01:16

Second Uniqueness Theorem

1.2K
Consider a region consisting of several individual conductors with a definite charge density in the region between these conductors. The second uniqueness theorem states that if the total charge on each conductor and the charge density in the in-between region are known, then the electric field can be uniquely determined.
In contrast, consider that the electric field is non-unique and apply Gauss's law in divergence form in the region between the conductors and the integral form to the surface...
1.2K
Theorems of Pappus and Guldinus: Problem Solving01:12

Theorems of Pappus and Guldinus: Problem Solving

892
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...
892
Construction of Root Locus01:15

Construction of Root Locus

220
The construction of a root locus involves several key steps to analyze and visualize the behavior of a system's poles with varying gain. The number of branches in the root locus equals the number of closed-loop poles and is symmetrical about the real axis.
For positive gain values, the root locus exists on the real axis to the left of an odd number of finite open-loop poles or zeros. The root locus starts at the open-loop poles and traces the paths of the closed-loop poles as the gain...
220
Maxam-Gilbert Sequencing01:05

Maxam-Gilbert Sequencing

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

You might also read

Related Articles

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

Sort by
Same author

A hybrid model for image forgery detection using deep learning with block and keypoint methods.

Scientific reports·2026
Same author

A novel deep learning approach for mosquito species classification via a dual-head structure and calibration-aware fusion architecture.

Scientific reports·2026
Same author

Correction to: Graphene oxide-enhanced photothermal therapy: laser parameter optimization and temperature modeling for HeLa cancer cell mortality.

Lasers in medical science·2025
Same author

Graphene oxide-enhanced photothermal therapy: laser parameter optimization and temperature modeling for hela cancer cell mortality.

Lasers in medical science·2025
Same author

ACHENY: A standard <i>Chenopodiaceae</i> image dataset for deep learning models.

Data in brief·2021
Same author

ICPTC: Iranian commercial pistachio tree cultivars standard dataset.

Data in brief·2021

Related Experiment Video

Updated: Nov 9, 2025

Author Spotlight: Optimizing Hairy Root-Based Transformation Protocols for Enhanced Efficiency in Brassicaceae
08:52

Author Spotlight: Optimizing Hairy Root-Based Transformation Protocols for Enhanced Efficiency in Brassicaceae

Published on: December 22, 2023

4.4K

CBTH: A New Algorithm for Maximum Rooted Triplets Consistency Problem.

Hadi Poor Mohammadi1, Mohsen Sardari Zarchi1

  • 1Department of Computer Engineering, Meybod University, Meybod, Iran.

Iranian Journal of Biotechnology
|April 14, 2021
PubMed
Summary
This summary is machine-generated.

A new algorithm, CBTH, efficiently solves the maximum rooted triplets consistency (MRTC) problem in phylogenetics. CBTH improves rooted phylogenetic tree construction by maximizing input triplet consistency without increasing time complexity.

Keywords:
Biological sequenceConsistencyHeight functionMRTC problemRooted phylogenetic treeRooted triplet

More Related Videos

Extracting Metrics for Three-dimensional Root Systems: Volume and Surface Analysis from In-soil X-ray Computed Tomography Data
09:37

Extracting Metrics for Three-dimensional Root Systems: Volume and Surface Analysis from In-soil X-ray Computed Tomography Data

Published on: April 26, 2016

8.8K
Construction and Systematical Symmetric Studies of a Series of Supramolecular Clusters with Binary or Ternary Ammonium Triphenylacetates
06:35

Construction and Systematical Symmetric Studies of a Series of Supramolecular Clusters with Binary or Ternary Ammonium Triphenylacetates

Published on: February 15, 2016

8.3K

Related Experiment Videos

Last Updated: Nov 9, 2025

Author Spotlight: Optimizing Hairy Root-Based Transformation Protocols for Enhanced Efficiency in Brassicaceae
08:52

Author Spotlight: Optimizing Hairy Root-Based Transformation Protocols for Enhanced Efficiency in Brassicaceae

Published on: December 22, 2023

4.4K
Extracting Metrics for Three-dimensional Root Systems: Volume and Surface Analysis from In-soil X-ray Computed Tomography Data
09:37

Extracting Metrics for Three-dimensional Root Systems: Volume and Surface Analysis from In-soil X-ray Computed Tomography Data

Published on: April 26, 2016

8.8K
Construction and Systematical Symmetric Studies of a Series of Supramolecular Clusters with Binary or Ternary Ammonium Triphenylacetates
06:35

Construction and Systematical Symmetric Studies of a Series of Supramolecular Clusters with Binary or Ternary Ammonium Triphenylacetates

Published on: February 15, 2016

8.3K

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Evolutionary Biology

Background:

  • Phylogenetics models evolutionary relationships between species using phylogenetic trees.
  • Rooted triplets are crucial inputs for constructing rooted phylogenetic trees, representing relationships among three species.
  • The maximum rooted triplets consistency (MRTC) problem aims to build trees maximizing input triplet compatibility.

Purpose of the Study:

  • Introduce an efficient algorithm, CBTH, to address the NP-hard MRTC problem.
  • Improve the consistency between input rooted triplets and the final phylogenetic tree.
  • Provide a high-performance solution for constructing rooted phylogenetic trees.

Main Methods:

  • Developed a novel algorithm named CBTH specifically for the MRTC problem.
  • Implemented CBTH to enhance the consistency of rooted triplets within phylogenetic tree construction.
  • Evaluated CBTH's performance against existing methods using biological data.

Main Results:

  • CBTH demonstrates superior performance compared to the TRH algorithm in terms of rooted triplet consistency.
  • The new CBTH algorithm achieves this improved consistency within a similar time complexity.
  • Experimental results validate CBTH's effectiveness on biological datasets.

Conclusions:

  • The CBTH algorithm offers a high-performance solution for the MRTC problem.
  • CBTH effectively improves rooted phylogenetic tree construction without compromising computational efficiency.
  • This method represents a significant advancement in handling rooted triplet consistency in phylogenetics.