24 citations · 33 across the 12 of their papers we have counts for
4 papers · 1 filter
Arc-Completion of 2-Colored Best Match Graphs to Binary-Explainable Best Match Graphs
David Schaller, Manuela Geiß, Marc Hellmuth +1
Best match graphs (BMGs) are vertex-colored digraphs that naturally arise in mathematical phylogenetics to formalize the notion of evolutionary closest genes w.r.t. an a priori unk…
Heuristic Algorithms for Best Match Graph Editing
David Schaller, Manuela Geiß, Marc Hellmuth +1
Best match graphs (BMGs) are a class of colored digraphs that naturally appear in mathematical phylogenetics and can be approximated with the help of similarity measures between ge…
Explainable AI by BAPC -- Before and After correction Parameter Comparison
Florian Sobieczky, Manuela Geiß
A local surrogate for an AI-model correcting a simpler 'base' model is introduced representing an analytical method to yield explanations of AI-predictions. The approach is studied…
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…