112 citations · 255 across the 57 of their papers we have counts for
74 papers
Best Matches in Phylogenetic Networks
Patricia A. Ebert, Peter F. Stadler, Marc Hellmuth
Best match graphs (BMGs) were introduced in mathematical phylogenetics to describe the concept of closest relatives for related genes (leaves of rooted tree) in different organisms…
Inferring Phylogenetic Networks from Required and Forbidden LCA-Constraints
Patricia A. Ebert, Marc Hellmuth
Least common ancestor (LCA) constraints encode relative-order information in directed acyclic graphs (DAGs) and give rise to a natural constraint-realization problem. Phylogenetic…
On Finding All Connected Maximum-Sized Common Subgraphs in Multiple Labeled Graphs
Johannes B. S. Petersen, Akbar Davoodi, Thomas Gärtner +2
We present an exact algorithm for computing all common subgraphs with the maximum number of vertices across multiple graphs. Our approach is further extended to handle the connecte…
The Complement of the Djokovic-Winkler Relation
Marc Hellmuth, Bruno J. Schmidt, Guillaume E. Scholz +1
The Djoković-Winkler relation is a binary relation defined on the edge set of a given graph that is based on the distances of certain vertices and which plays a prominent role…
Unique Least Common Ancestors and Clusters in Directed Acyclic Graphs
Ameera Vaheeda Shanavas, Manoj Changat, Marc Hellmuth +1
We investigate the connections between clusters and least common ancestors (LCAs) in directed acyclic graphs (DAGs). We focus on the class of DAGs having unique least common ancest…
The weighted total cophenetic index: A novel balance index for phylogenetic networks
Linda Knüver, Mareike Fischer, Marc Hellmuth +1
Phylogenetic networks play an important role in evolutionary biology as, other than phylogenetic trees, they can be used to accommodate reticulate evolutionary events such as horiz…