Related Experiment Video
Updated: May 11, 2026

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 Piovesan1, Steven M Kelk
1Department of Knowledge Engineering-DKE, Maastricht University, Maastricht, The Netherlands. T.Piovesan@cwi.nl
Abstract:
Here, we present a new fixed parameter tractable algorithm to compute the hybridization number r of two rooted, not necessarily binary phylogenetic trees on taxon set Χ in time (6(r)r!) · poly(n), where n = |Χ|. The novelty of this approach is its use of terminals, which are maximal elements of a natural partial order on Χ, and several insights from the softwired clusters literature. This yields a surprisingly simple and practical bounded-search algorithm and offers an alternative perspective on the underlying combinatorial structure of the hybridization number problem.
More Related Videos
Related Concept Videos
Hybridization of Atomic Orbitals II
Hybridization of Atomic Orbitals I
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
Phylogenetic Trees
Routh-Hurwitz Criterion II
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...
