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

Hybridization of Atomic Orbitals II

Hybridization of Atomic Orbitals II

sp3d and sp3d 2 Hybridization

Hybridization of Atomic Orbitals I

Hybridization of Atomic Orbitals I

The mathematical expression known as the wave function, ψ, contains information about each orbital and the wavelike properties of electrons in an isolated atom. When atoms are bound together in a molecule, the wave functions combine to produce new mathematical descriptions that have different shapes. This process of combining the wave functions for atomic orbitals is called hybridization and is mathematically accomplished by the linear combination of atomic orbitals. The new orbitals that...

Trihybrid Crosses

Trihybrid Crosses

Trihybrid Crosses
Some of Mendel’s crosses examined three pairs of contrasting characteristics. Such a cross is called a trihybrid cross. A trihybrid cross is a combination of three individual monohybrid crosses. For example, plant height (tall vs. short), seed shape (round vs. wrinkled), and seed color (yellow vs. green).
The F1 generation plants of a trihybrid cross are heterozygous for all three traits and produce eight gametes. Upon self-fertilization, these gametes have an equal chance to...

The Binomial Theorem

The Binomial Theorem

The Binomial Theorem is a foundational principle in algebra used to expand expressions raised to a power. It provides a structured approach for expanding binomials of the form (a+b)n, where a and b are variables or constants representing algebraic expressions, and n is a non-negative integer.The general form of the Binomial Theorem is:Each term in the expansion involves a binomial coefficient, which is calculated using factorials:The exponent of a in each term decreases from n to 0, while the...

Phylogenetic Trees

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.

Routh-Hurwitz Criterion II

Routh-Hurwitz Criterion II

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 column of the Routh...

You might also read

Related Articles

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

Sort by

Same author

Ancient dispersal of the human fungal pathogen Cryptococcus gattii from the Amazon rainforest.

PloS one·2013

Same author

Optimal flux spaces of genome-scale stoichiometric models are determined by a few subnetworks.

Scientific reports·2012

Same author

On the elusiveness of clusters.

IEEE/ACM transactions on computational biology and bioinformatics·2011

Same author

Some mathematical refinements concerning error minimization in the genetic code.

IEEE/ACM transactions on computational biology and bioinformatics·2011

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: May 11, 2026

Tree Core Analysis with X-ray Computed Tomography

Tree Core Analysis with X-ray Computed Tomography

Published on: September 22, 2023

A simple fixed parameter tractable algorithm for computing the hybridization number of two (not necessarily binary)

Teresa Piovesan¹, Steven M Kelk

¹Department of Knowledge Engineering-DKE, Maastricht University, Maastricht, The Netherlands. T.Piovesan@cwi.nl

IEEE/ACM Transactions on Computational Biology and Bioinformatics

|May 25, 2013

Summary

This summary is machine-generated.

A new algorithm efficiently computes the hybridization number (r) for rooted phylogenetic trees. This method utilizes terminals and softwired clusters, offering a practical approach to a complex combinatorial problem.

More Related Videos

The ITS2 Database

The ITS2 Database

Published on: March 12, 2012

Related Experiment Videos

Last Updated: May 11, 2026

Tree Core Analysis with X-ray Computed Tomography

Tree Core Analysis with X-ray Computed Tomography

Published on: September 22, 2023

The ITS2 Database

The ITS2 Database

Published on: March 12, 2012

Area of Science:

Computational Biology
Phylogenetics
Algorithm Design

Background:

Phylogenetic trees are crucial for understanding evolutionary relationships.
Computing the hybridization number is a complex problem in phylogenetics.
Existing methods may lack efficiency for certain tree structures.

Purpose of the Study:

To introduce a novel fixed-parameter tractable algorithm for computing the hybridization number.
To explore new combinatorial insights into the hybridization number problem.
To provide a practical and efficient computational method.

Main Methods:

Development of a fixed-parameter tractable algorithm.
Utilizing terminals (maximal elements in a partial order on taxa).
Incorporating insights from softwired clusters literature.

Main Results:

The algorithm computes the hybridization number (r) in time (6(r)r!) · poly(n), where n is the number of taxa.
The approach is surprisingly simple and practical.
Demonstrates a new perspective on the combinatorial structure of the problem.

Conclusions:

The new algorithm offers an efficient solution for computing the hybridization number.
The use of terminals and softwired cluster insights provides a novel approach.
This work advances computational methods in phylogenetics.