---
title: Temporal Tree-Child Hybrid Number
url: https://www.emergentmind.com/topics/temporal-tree-child-hybrid-number
type: topic
---

# Temporal Tree-Child Hybrid Number

Temporal Tree-Child Hybrid Number is the optimization quantity obtained by minimizing reticulation number over phylogenetic networks that are simultaneously temporal and tree-child and that display a prescribed set of rooted phylogenetic trees. In the formalism developed for arbitrary sets of binary and nonbinary trees, it is written
$$
h_{t,TC}(T)=\min\{r(N):N\text{ displays }T,\ N\text{ is tree-child, and }d(N)=0\},
$$
where $r(N)=\sum_{v\neq \rho}(d^-(v)-1)$ is the hybridization number, and $d(N)=0$ expresses exact temporality via a semi-temporal labeling framework [2007.13615]. The topic sits at the intersection of phylogenetic network inference, cherry-picking characterizations, parameterized complexity, and the combinatorics of ranked tree-child networks. A central theme in the recent literature is that temporal constraints substantially restrict the admissible solution space relative to unconstrained tree-child networks, often changing feasibility, optimal reticulation count, and algorithmic structure [2007.13615, 2307.04335].

## 1. Formal setting and core definitions

A rooted phylogenetic network on a leaf set $X$ is a rooted DAG whose leaves are exactly $X$, with internal vertices partitioned into tree vertices and hybridization vertices. In the binary setting, tree vertices have indegree $1$ and outdegree $2$, while reticulation vertices have indegree $2$ and outdegree $1$; more generally, reticulation indegree may exceed $2$ [2007.13615, 2307.04335]. A network displays a tree if the tree can be obtained from a subgraph by deleting arcs and vertices and suppressing degree-$(1,1)$ vertices [2007.13615]. A tree-child network is one in which every tree vertex has at least one outgoing tree arc, or equivalently every non-leaf node has at least one child that is a tree vertex or a leaf [2007.13615, 2307.04335].

In the framework of temporal hybridization, a temporal network is a tree-child network equipped with a labeling $t:V(N)\to \mathbb{R}^+$ such that tree arcs satisfy $t(u)<t(v)$ and reticulation arcs satisfy $t(u)=t(v)$ [2007.13615]. The same equal-time versus strict-increase dichotomy appears in the ranking literature, where a ranking is a discrete temporal labeling compatible with tree arcs and reticulation events [2506.05730].

| Quantity | Definition | Scope |
|---|---|---|
| $r(N)$ | $\sum_{v\neq \rho}(d^-(v)-1)$ | Hybridization number of a network |
| $h_t(T)$ | Minimum $r(N)$ over temporal networks displaying $T$ | Temporal hybridization number |
| $h_{t,TC}(T)$ | Minimum $r(N)$ over temporal tree-child networks displaying $T$ | Temporal tree-child hybrid number |
| $d(N)$ | Minimum number of reticulation arcs violating equality in a semi-temporal labeling | Temporal distance |

The introduction of temporal distance refines the strict temporal notion. A semi-temporal labeling requires strict increase on tree arcs and sets each hybridization vertex time to the minimum of its parents’ times; $d(N)$ then counts reticulation arcs whose endpoints do not receive equal times. Temporal networks are exactly those with $d(N)=0$ [2007.13615]. This places the Temporal Tree-Child Hybrid Number as the zero-distance case of a broader optimization problem over tree-child networks.

## 2. Sequence characterizations

For binary input trees, the principal structural characterization is via cherry-picking sequences. If $T$ is a set of binary trees on the same taxon set $X$, a sequence $s=(s_1,\dots,s_n)$ is a cherry-picking sequence if each $s_i$ is chosen from the set of leaves that lie in a cherry in every currently reduced tree, and the weight is
$$
w_T(s)=\sum_{i=1}^{n-1} w_{T\setminus \{s_1,\dots,s_{i-1}\}}(s_i),
$$
where $w_T(x)=|N_T(x)|-1$ and $N_T(x)$ is the union of the cherry-neighbor sets of $x$ across the input trees [2007.13615]. The key theorem states that there exists a temporal network displaying the input trees with reticulation number $k$ if and only if there exists a cherry-picking sequence of weight $k$. Consequently, the minimum weight of a cherry-picking sequence equals the minimum temporal hybridization number [2007.13615].

For tree-child networks more generally, the relevant object is a generalized cherry-picking sequence, also called a tree-child sequence. Its weight is $|s|-|X|$, and Linz and Semple’s characterization, as quoted and used algorithmically, states that a set of trees admits a tree-child network with reticulation number $k$ if and only if there is a tree-child sequence of weight $k$ [1907.08474, 2007.13615]. The temporal extension in [2007.13615] identifies a class of non-temporal elements in such sequences, and proves equivalence between bounded temporal distance in the network and bounded numbers of non-temporal elements in the corresponding sequence.

For two trees under the weaker rigid-display model, fork-picking sequences play an analogous role. The rigid hybrid number
$$
h_r(T,T')=\min\{h(N):N\text{ is temporal tree-child and rigidly displays }T,T'\}
$$
coincides with the minimum weight of a fork-picking sequence, denoted $s_r(T,T')$ [2004.02634]. The same work proves that, for two trees, the following are equivalent: rigid display by a temporal tree-child network, exact display by a temporal tree-child network, existence of a cherry-picking sequence, and existence of a fork-picking sequence [2004.02634]. This equivalence concerns existence rather than optimal count, and the distinction becomes significant in later comparisons.

## 3. Algorithmic results and parameterized complexity

The main fixed-parameter tractability results are due to the development of sequence-based search algorithms. For an arbitrary set of $m$ rooted binary trees with $n$ leaves each, the minimum temporal hybridization number can be computed in
$$
O(5^k\cdot n\cdot m)
$$
time, where $k$ is the optimum temporal hybridization number [2007.13615]. The algorithm searches for a minimum-weight cherry-picking sequence using a recursive constraint-based branching scheme. Its analysis uses the potential
$$
P(C)=\psi |C|+(1-2\psi)|\pi_1(C)|,\qquad \psi=\frac{\log 2}{\log 5}\approx 0.4307,
$$
which yields the $5^k$ bound on the search tree [2007.13615].

The same paper introduces a broader FPT problem: deciding whether there exists a tree-child network displaying the input trees with at most $k$ reticulations and temporal distance at most $d$. This semi-temporal problem is solvable in
$$
O((8k)^d 5^k\cdot n\cdot m),
$$
and the case $d=0$ recovers temporal tree-child networks and hence $h_{t,TC}(T)$ [2007.13615]. The factor $(8k)^d$ comes from branching on at most $8k$ actionable ordered cherry-pairs for each non-temporal step.

For two rooted nonbinary trees, the first FPT algorithm for minimum temporal hybridization runs in
$$
O(6^k k!\cdot k\cdot n^2),
$$
again parameterized by the optimum $k$ [2007.13615]. The factorial reflects branching over permutations within minimal clusters and over bounded sets of terminals. The same paper reports an implementation and experimental analysis; empirically, the $O(5^k)$ temporal algorithm often followed a curve closer to $O(2.5^k)$ on the tested instances, and about $5\%$ of instances did not admit any temporal network, which motivated the semi-temporal formulation [2007.13615].

For comparison, the non-temporal tree-child optimization problem was previously shown FPT for arbitrary numbers of binary input trees using tree-child sequences, with running time
$$
O((8k)^k\operatorname{poly}(n,t)),
$$
and a parallel implementation that could deal with up to $100$ input trees on a standard desktop computer [1907.08474]. That algorithm does not enforce temporality; this suggests that temporal constraints improve structure for some tasks but also impose an additional feasibility barrier.

## 4. Relation to unconstrained tree-child hybridization

The strongest contrast with the temporal setting comes from universal and hardness results for unconstrained tree-child networks. For line trees, the tree-child network inference problem remains NP-hard via a reduction from the Shortest Common Supersequence problem on permutations, and the same paper proves that the parsimonious tree-child networks displaying all line trees on a taxon set $X$ are identical to those displaying all binary trees on $X$ [2307.04335]. The resulting universal hybridization number satisfies
$$
h_{TC}(n)=\Theta(n^3),
$$
with explicit bounds
$$
\frac{(n-2)(n-1)(n+3)}{6}\le h_{TC}(n)\le \frac{n^3-5n^2+21n-53}{3}
$$
for $n>7$ [2307.04335].

These cubic bounds are explicitly non-temporal. The constructions used in the reduction and in the universal-network argument, especially the one-component networks $N(Q,\ell)$, generally violate standard temporal constraints because a reticulation receives incoming arcs from vertices lying at different positions on a chain, while temporal labeling would require equal times on all parents of the reticulation [2307.04335]. The paper therefore states that its results pertain to unconstrained tree-child networks, and that determining the corresponding temporal quantity $h^{temp}_{TC}(n)$, if finite, remains open [2307.04335].

This separation is conceptually important. In unconstrained tree-child optimization, one may first minimize over all tree-child networks and only then ask whether the optimum happens to be temporal. The available results show that this procedure is not sound in general. A tree-child optimum can fail to admit any temporal labeling, and imposing temporality can increase the minimum reticulation count or even destroy feasibility [1907.08474, 2307.04335].

## 5. Ranking, normality, and combinatorial structure

Temporality is tightly connected to ranking. In the combinatorial theory of ranked tree-child networks, a tree-child network is temporal if and only if it is the underlying network of a ranked tree-child network [2007.09701]. Every temporal tree-child network is normal, and ranked semi-binary tree-child networks are normal as well [2007.09701, 2506.05730]. This normality constraint excludes shortcut arcs and is one reason the temporal subclass is combinatorially more rigid than the full tree-child class.

For binary ranked tree-child networks with $\ell$ leaves, if $b$ denotes the number of branching events and $r$ the number of reticulations, then
$$
r=\ell-b-1,\qquad 0\le r\le \ell-2.
$$
The exact number of ranked tree-child networks with $\ell$ leaves and reticulation number $r$ is
$$
C_{\ell,r}=\left\{\!\!\begin{array}{c}\ell-1\\ \ell-1-r\end{array}\!\!\right\}T_\ell,
\qquad
T_\ell=\frac{\ell!(\ell-1)!}{2^{\ell-1}},
$$
where the Stirling number is unsigned of the first kind [2007.09701]. Under the uniform model on ranked tree-child networks,
$$
E[r]=\ell-1-H_{\ell-1},\qquad \operatorname{Var}(r)\sim \log \ell,
$$
and
$$
\frac{r-(\ell-1-\log \ell)}{\sqrt{\log \ell}}\Rightarrow N(0,1),
$$
so a uniformly random ranked tree-child network is typically highly reticulated [2007.09701].

A complementary problem is to count the number of valid temporal rankings of a fixed tree-child network. For separated binary or semi-binary tree-child networks, this can be done in linear time after constructing a rooted tree $\Psi(N)$ by contracting reticulation events, deleting short-cuts and parallel arcs, and removing leaves. If $N$ is ranked, the number of rankings is
$$
\psi(N)=\delta(\Psi(N))=\frac{|\widetilde V|!}{\prod_{v\in \widetilde V}\lambda(v)},
$$
where $\lambda(v)$ is the number of descendants of $v$ in $\Psi(N)$, including $v$ itself [2506.05730]. A network has exactly one ranking if and only if $\Psi(N)$ is a directed path, and a binary tree-child network with $n$ leaves and $n-2$ reticulations has at most one ranking [2506.05730]. For a uniformly random binary tree-child network with $k$ reticulations,
$$
E[X_{n,k}] \sim \frac{1}{4^k}\cdot \frac{n!}{\binom{2n-2}{n-1}}
$$
for fixed $k$ as $n\to\infty$, showing that additional reticulation tends to reduce the number of compatible temporal orders by a factor asymptotically equal to $1/4$ [2506.05730].

## 6. Variants, misconceptions, and open directions

A first nomenclatural issue is that “Temporal Tree-Child Hybrid Number” is not introduced uniformly across the literature. In [2007.13615] it is an explicit optimization quantity over temporal tree-child networks, represented by the $d=0$ special case of the temporal-distance framework. In [2506.05730], by contrast, there is no separate term formally defined by the authors; the consistent interpretation adopted there is the reticulation count $k$ of a ranked tree-child network, that is, of a tree-child network admitting a temporal labeling.

A second common misconception is to identify temporal and tree-child constraints. The literature does not support this identification. The 2019 FPT algorithm for tree-child network construction does not ensure temporality by construction, and the universal constructions used to establish $\Theta(n^3)$ non-temporal hybridization for all binary trees are generally not temporal [1907.08474, 2307.04335]. This suggests that temporality is not a mild regularity condition but an additional structural restriction with its own optimization problem.

A third distinction concerns exact display versus weaker notions. For two trees, the rigid hybrid number $h_r(T,T')$ satisfies
$$
h_r(T,T')\le h_t(T,T'),
$$
and the gap can be large: for infinitely many leaf-set sizes,
$$
h_t(T,T')-h_r(T,T')\ge |X|/4-3
$$
[2004.02634]. The same work shows that Rigidly Displaying is NP-complete [2004.02634]. Thus, even within temporal tree-child networks, different notions of how trees are represented lead to genuinely different reticulation minima.

Several open directions are explicit in the cited works. The temporal-distance paper asks whether more biologically meaningful temporal-distance measures admit FPT algorithms, and whether temporal hybridization remains FPT for more than two nonbinary trees with reasonable running time [2007.13615]. The universal-network paper leaves open the determination of temporal analogues of its cubic non-temporal bounds [2307.04335]. The ranking literature points to limiting laws, variance, concentration, and extremal structures for the number of rankings at fixed $(n,k)$ as further problems [2506.05730]. Taken together, these results position the Temporal Tree-Child Hybrid Number as a precise but still evolving concept: formally characterized, algorithmically accessible in several important regimes, and sharply differentiated from the broader non-temporal tree-child hybridization framework.

Source: https://www.emergentmind.com/topics/temporal-tree-child-hybrid-number