2 citations · 4 across the 8 of their papers we have counts for
5 papers · 1 filter
Least resolved trees for two-colored best match graphs
David Schaller, Manuela Geiß, Marc Hellmuth +1
2-colored best match graphs (2-BMGs) form a subclass of sink-free bi-transitive graphs that appears in phylogenetic combinatorics. There, 2-BMGs describe evolutionarily most closel…
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…
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…
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…