Daisy Hamming graphs

Dravec, Tanja; Taranenko, Andrej

doi:10.7151/dmgt.2373

Cited by 1 publication

(1 citation statement)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this contribution, we consider rooted median graphs, i.e., median graphs with a vertex designated as the root. We note in passing that rooted median graphs recently have attracted in the context of the Daisy graph construction [12,51]. It is natural then to replace the last common ancestor lca(x, y) by the median med(x, y, ρ) of two vertices x and y and the root ρ and to ask which maps can be explained as δ (x, y) = t(med(x, y, ρ)), where t is now a vertex labeling on the median graph.…”

Section: Introductionmentioning

confidence: 99%

From Modular Decomposition Trees to Rooted Median Graphs

Bruckmann¹,

Stadler²,

Hellmuth³

2021

Preprint

View full text Add to dashboard Cite

The modular decomposition of a symmetric map δ : X × X → ϒ (or, equivalently, a set of symmetric binary relations, a 2-structure, or an edge-colored undirected graph) is a natural construction to capture key features of δ in labeled trees. A map δ is explained by a vertex-labeled rooted tree (T,t) if the label δ (x, y) coincides with the label of the last common ancestor of x and y in T , i.e., if δ (x, y) = t(lca(x, y)). Only maps whose modular decomposition does not contain prime nodes, i.e., the symbolic ultrametrics, can be exaplained in this manner. Here we consider rooted median graphs as a generalization to (modular decomposition) trees to explain symmetric maps. We first show that every symmetric map can be explained by "extended" hypercubes and half-grids. We then derive a a linear-time algorithm that stepwisely resolves prime vertices in the modular decomposition tree to obtain a rooted and labeled median graph that explains a given symmetric map δ . We argue that the resulting "tree-like" median graphs may be of use in phylogenetics as a model of evolutionary relationships.

show abstract

Section: Introductionmentioning

confidence: 99%