
Planar Median Graphs and CubesquareGraphs
Median graphs are connected graphs in which for all three vertices there...
read it

Defining Autocatalysis in Chemical Reaction Networks
Autocatalysis is a deceptively simple concept, referring to the situatio...
read it

Combining Orthology and Xenology Data in a Common Phylogenetic Tree
A rooted tree T with vertex labels t(v) and setvalued edge labels λ(e) ...
read it

A Simple LinearTime 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...
read it

Compatibility of Partitions, Hierarchies, and Split Systems
The question whether a partition 𝒫 and a hierarchy ℋ or a treelike spli...
read it

From Modular Decomposition Trees to Rooted Median Graphs
The modular decomposition of a symmetric map δ X× X →Υ (or, equivalently...
read it

ArcCompletion of 2Colored Best Match Graphs to BinaryExplainable Best Match Graphs
Best match graphs (BMGs) are vertexcolored digraphs that naturally aris...
read it

Heuristic Algorithms for Best Match Graph Editing
Best match graphs (BMGs) are a class of colored digraphs that naturally ...
read it

Least resolved trees for twocolored best match graphs
2colored best match graphs (2BMGs) form a subclass of sinkfree bitra...
read it

Indirect Identification of Horizontal Gene Transfer
Several implicit methods to infer Horizontal Gene Transfer (HGT) focus o...
read it

Best Match Graphs with Binary Trees
Best match graphs (BMG) are a key intermediate in graphbased orthology ...
read it

Complexity of Modification Problems for Best Match Graphs
Best match graphs (BMGs) are vertexcolored directed graphs that were in...
read it

Complete Characterization of Incorrect Orthology Assignments in Best Match Graphs
Genomescale orthology assignments are usually based on reciprocal best ...
read it

Complete EdgeColored Permutation Graphs
We introduce the concept of complete edgecolored permutation graphs as ...
read it

Hierarchical and ModularlyMinimal Vertex Colorings
Cographs are exactly the hereditarily wellcolored graphs, i.e., the gra...
read it

Generalized Fitch Graphs III: Symmetrized Fitch maps and Sets of Symmetric Binary Relations that are explained by Unrooted Edgelabeled Trees
Binary relations derived from labeled rooted trees play an import role i...
read it

Generalized Fitch Graphs II: Sets of Binary Relations that are explained by Edgelabeled Trees
Fitch graphs G=(X,E) are digraphs that are explained by {∅, 1}edgelabe...
read it

Generalized Fitch Relations II: Sets of Binary Relations that are explained by Edgelabeled Trees
Fitch graphs G=(X,E) are digraphs that are explained by {∅, 1}edgelabe...
read it

Complexity of Modification Problems for Reciprocal Best Match Graphs
Reciprocal best match graphs (RBMGs) are vertex colored graphs whose ver...
read it

Best Match Graphs and Reconciliation of Gene Trees with Species Trees
A wide variety of problems in computational biology, most notably the as...
read it

FormanRicci Curvature for Hypergraphs
In contrast to graphbased models for complex networks, hypergraphs are ...
read it

Alignments as Compositional Structures
Alignments, i.e., positionwise comparisons of two or more strings or or...
read it

Topological Representation of the Transit Sets of kPoint Crossover Operators
kpoint crossover operators and their recombination sets are studied fro...
read it

Phylogenomics with Paralogs
Phylogenomics heavily relies on wellcurated sequence data sets that con...
read it

Chemical Transformation Motifs  Modelling Pathways as Integer Hyperflows
We present an elaborate framework for formally modelling pathways in che...
read it

A Short Note on Undirected Fitch Graphs
The symmetric version of Fitch's xenology relation coincides with class ...
read it

Reconstructing Gene Trees From Fitch's Xenology Relation
Two genes are xenologs in the sense of Fitch if they are separated by at...
read it
Peter F. Stadler
is this you? claim profile