The evolutionary relationships among organisms have traditionally been represented using
rooted phylogenetic trees. However, due to reticulate processes such as hybridization or …

The notion of graph which is most useful in computer science is that of a directed graph or
just a graph. A graph is a combinatorial structure consisting of a finite nonempty set of …

Simultaneously modeling hybridization and the multispecies coalescent is becoming
increasingly common, and inference of species networks in this context is now implemented …

Combinatorial structure and algorithms for deducing genetic recombination history,
represented by ancestral recombination graphs and other networks, and their role in the …

Interspecific hybridization is an important evolutionary phenomenon that generates genetic
variability in a population and fosters species diversity in nature. The availability of large …

Phylogenetic networks are special graphs that generalize phylogenetic trees to allow for
modeling of non-treelike evolutionary histories. The ability to sequence multiple genetic …

Galled trees are studied as a recombination model in population genetics. This class of
phylogenetic networks is generalized into tree-child and galled network classes by relaxing …

The Robinson–Foulds (RF) distance is the most popular method of evaluating the
dissimilarity between phylogenetic trees. In this paper, we define and explore in detail …

Recent work in estimating species relationships from gene trees has included inferring
networks assuming that past hybridization has occurred between species. Probabilistic …

The Robinson-Foulds (RF) distance, one of the most widely used metrics for comparing
phylogenetic trees, has the advantage of being intuitive, with a natural interpretation in terms …