research
∙
12/05/2022
Relative Timing Information and Orthology in Evolutionary Scenarios
Evolutionary scenarios describing the evolution of a family of genes wit...
share
research
∙
04/28/2022
Clustering Systems of Phylogenetic Networks
Rooted acyclic graphs appear naturally when the phylogenetic relationshi...
research
∙
12/01/2021
Orientation of Fitch Graphs and Detection of Horizontal Gene Transfer in Gene Trees
Horizontal gene transfer events partition a gene tree T and thus, its le...
research
∙
07/05/2021
Combining Orthology and Xenology Data in a Common Phylogenetic Tree
A rooted tree T with vertex labels t(v) and set-valued edge labels λ(e) ...
research
∙
06/30/2021
A Simple Linear-Time Algorithm for the Common Refinement of Rooted Phylogenetic Trees on a Common Leaf Set
Background. The supertree problem, i.e., the task of finding a common re...
research
∙
04/29/2021
Compatibility of Partitions, Hierarchies, and Split Systems
The question whether a partition 𝒫 and a hierarchy ℋ or a tree-like spli...
research
∙
03/11/2021
Arc-Completion of 2-Colored Best Match Graphs to Binary-Explainable Best Match Graphs
Best match graphs (BMGs) are vertex-colored digraphs that naturally aris...
research
∙
03/10/2021
Heuristic Algorithms for Best Match Graph Editing
Best match graphs (BMGs) are a class of colored digraphs that naturally ...
research
∙
01/18/2021
Least resolved trees for two-colored best match graphs
2-colored best match graphs (2-BMGs) form a subclass of sink-free bi-tra...
research
∙
12/16/2020
Indirect Identification of Horizontal Gene Transfer
Several implicit methods to infer Horizontal Gene Transfer (HGT) focus o...
research
∙
11/01/2020
Best Match Graphs with Binary Trees
Best match graphs (BMG) are a key intermediate in graph-based orthology ...
research
∙
06/30/2020
Complexity of Modification Problems for Best Match Graphs
Best match graphs (BMGs) are vertex-colored directed graphs that were in...
research
∙
06/03/2020