24 citations · 33 across the 12 of their papers we have counts for
4 papers · 1 filter
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 $χ(…
Best Match Graphs and Reconciliation of Gene Trees with Species Trees
Manuela Geiß, Marcos E. González, Alitzel López Sánchez +4
A wide variety of problems in computational biology, most notably the assessment of orthology, are solved with the help of reciprocal best matches. Using an evolutionary definition…
Reciprocal Best Match Graphs
Manuela Geiß, Peter F. Stadler, Marc Hellmuth
Reciprocal best matches play an important role in numerous applications in computational biology, in particular as the basis of many widely used tools for orthology assessment. Nev…