24 citations · 33 across the 12 of their papers we have counts for
4 papers · 1 filter
Best Match Graphs with Binary Trees
David Schaller, Manuela Geiß, Marc Hellmuth +1
Best match graphs (BMG) are a key intermediate in graph-based orthology detection and contain a large amount of information on the gene tree. We provide a near-cubic algorithm to d…
Complete Characterization of Incorrect Orthology Assignments in Best Match Graphs
David Schaller, Manuela Geiß, Peter F. Stadler +1
Genome-scale orthology assignments are usually based on reciprocal best matches. In the absence of horizontal gene transfer (HGT), every pair of orthologs forms a reciprocal best m…
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…