2 citations · 3 across the 2 of their papers we have counts for
4 papers
Complexity of Modification Problems for Reciprocal Best Match Graphs
Marc Hellmuth, Manuela Geiß, Peter F. Stadler
Reciprocal best match graphs (RBMGs) are vertex colored graphs whose vertices represent genes and the colors the species where the genes reside. Edges identify pairs of genes that…
Hierarchical Colorings of Cographs
D. I. Valdivia, M. Geiß, M. Hellmuth +2
Cographs are exactly hereditarily well-colored graphs, i.e., the graphs for which a greedy coloring of every induced subgraph uses only the minimally necessary number of colors $χ(…
A Short Note on Undirected Fitch Graphs
Manuela Geiß, Marc Hellmuth, Yangjing Long +1
The symmetric version of Fitch's xenology relation coincides with class of complete multipartite graph and thus cannot convey any non-trivial phylogenetic information.
Forbidden Time Travel: Characterization of Time-Consistent Tree Reconciliation Maps
Nikolai Nøjgaard, Manuela Geiß, Peter F. Stadler +3
In the absence of horizontal gene transfer it is possible to reconstruct the history of gene families from empirically determined orthology relations, which are equivalent to event…