19 citations · 35 across the 7 of their papers we have counts for
7 papers
Nesting of Touching Polygons
Carsten R. Seemann, Peter F. Stadler, Marc Hellmuth
Polygons are cycles embedded into the plane; their vertices are associated with - and -coordinates and the edges are straight lines. Here, we consider a set of polygons with…
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…
Superbubbles as an Empirical Characteristic of Directed Networks
Fabian Gärtner, Felix Kühnl, Carsten R. Seemann +4
Superbubbles are acyclic induced subgraphs of a digraph with single entrance and exit that naturally arise in the context of genome assembly and the analysis of genome alignments i…
Generalized Fitch Graphs III: Symmetrized Fitch maps and Sets of Symmetric Binary Relations that are explained by Unrooted Edge-labeled Trees
Marc Hellmuth, Carsten R. Seemann, Peter F. Stadler
Binary relations derived from labeled rooted trees play an import role in mathematical biology as formal models of evolutionary relationships. The (symmetrized) Fitch relation form…
Generalized Fitch Graphs II: Sets of Binary Relations that are explained by Edge-labeled Trees
Marc Hellmuth, Carsten R. Seemann, Peter F. Stadler
Fitch graphs are digraphs that are explained by -edge-labeled rooted trees with leaf set : there is an arc if and only if the uniqu…
Alternative Characterizations of Fitch's Xenology Relation
Marc Hellmuth, Carsten R. Seemann
According to Walter M. Fitch, two genes are xenologs if they are separated by at least one horizontal gene transfer. This concept is formalized through Fitch relations, which are d…
The Matroid Structure of Representative Triple Sets and Triple-Closure Computation
Marc Hellmuth, Carsten R. Seemann
The closure of a consistent set of triples (rooted binary trees on three leaves) provides essential information about tree-like relations that are shown by any…