1 citations · 1 across the 2 of their papers we have counts for
5 papers
Hierarchical and Modularly-Minimal Vertex Colorings
Dulce I. Valdivia, Manuela Geiß, Maribel Hernández Rosales +2
Cographs are exactly the hereditarily well-colored graphs, i.e., the graphs for which a greedy vertex coloring of every induced subgraph uses only the minimally necessary number of…
From Best Hits to Best Matches
Peter F. Stadler, Manuela Geiß, David Schaller +5
Many of the commonly used methods for orthology detection start from mutually most similar pairs of genes (reciprocal best hits) as an approximation for evolutionary most closely r…
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…
Best Match Graphs
Manuela Geiß, Edgar Chavez, Marcos Gonzalez +6
THIS IS A CORRECTED VERSION INCLUDING AN APPENDED CORRIGENDUM. Best match graphs arise naturally as the first processing intermediate in algorithms for orthology detection. Let …