Name
Abstract | ||
|---|---|---|
A rooted tree $T$ with vertex labels $t(v)$ and set-valued edge labels $\lambda(e)$ defines maps $\delta$ and $\varepsilon$ on the pairs of leaves of $T$ by setting $\delta(x,y)=q$ if the last common ancestor $\text{lca}(x,y)$ of $x$ and $y$ is labeled $q$, and $m\in \varepsilon(x,y)$ if $m\in\lambda(e)$ for at least one edge $e$ along the path from $\text{lca}(x,y)$ to $y$. We show that a pair of maps $(\delta,\varepsilon)$ derives from a tree $(T,t,\lambda)$ if and only if there exists a common refinement of the (unique) least-resolved vertex labeled tree $(T_{\delta},t_{\delta})$ that explains $\delta$ and the (unique) least resolved edge labeled tree $(T_{\varepsilon},\lambda_{\varepsilon})$ that explains $\varepsilon$ (provided both trees exist). This result remains true if certain combinations of labels at incident vertices and edges are forbidden. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1007/978-3-030-91814-9_5 | BSB |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marc Hellmuth | 1 | 0 | 2.03 |
| Mira Michel | 2 | 0 | 0.34 |
| Nikolai N. Nøjgaard | 3 | 0 | 0.34 |
| David Schaller | 4 | 0 | 1.01 |
| Peter F. Stadler | 5 | 256 | 62.77 |