112 citations · 423 across the 60 of their papers we have counts for
5 papers · 2 filters
Planar Median Graphs and Cubesquare-Graphs
Carsten R. Seemann, Vincent Moulton, Peter F. Stadler +1
Median graphs are connected graphs in which for all three vertices there is a unique vertex that belongs to shortest paths between each pair of these three vertices. In this paper…
Quasi-Best Match Graphs
Annachiara Korchmaros, David Schaller, Marc Hellmuth +1
Quasi-best match graphs (qBMGs) are a hereditary class of directed, properly vertex-colored graphs. They arise naturally in mathematical phylogenetics as a generalization of best m…
Combining Orthology and Xenology Data in a Common Phylogenetic Tree
Marc Hellmuth, Mira Michel, Nikolai N. Nøjgaard +2
A rooted tree with vertex labels and set-valued edge labels defines maps and on the pairs of leaves of by setting if the last com…
From Modular Decomposition Trees to Rooted Median Graphs
Carmen Bruckmann, Peter F. Stadler, Marc Hellmuth
The modular decomposition of a symmetric map (or, equivalently, a set of symmetric binary relations, a 2-structure, or an edge-colored undirected graph) i…
Heuristic Algorithms for Best Match Graph Editing
David Schaller, Manuela Geiß, Marc Hellmuth +1
Best match graphs (BMGs) are a class of colored digraphs that naturally appear in mathematical phylogenetics and can be approximated with the help of similarity measures between ge…