Comparing and simplifying distinct-cluster phylogenetic networks
From MaRDI portal
Abstract: Phylogenetic networks are rooted acyclic directed graphs in which the leaves are identified with members of a set X of species. The cluster of a vertex is the set of leaves that are descendants of the vertex. A network is "distinct-cluster" if distinct vertices have distinct clusters. This paper focuses on the set DC(X) of distinct-cluster networks whose leaves are identified with the members of X. For a fixed X, a metric on DC(X) is defined. There is a "cluster-preserving" simplification process by which vertices or certain arcs may be removed without changing the clusters of any remaining vertices. Many of the resulting networks may be uniquely determined without regard to the order of the simplifying operations.
Recommendations
Cites work
- scientific article; zbMATH DE number 1865935 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- A framework for representing reticulate evolution
- Comparison of labeled trees with valency three
- Comparison of phylogenetic trees
- Properties of normal phylogenetic networks
- Subtree transfer operations and their induced metrics on evolutionary trees
- The fine structure of galls in phylogenetic networks
Cited in
(5)- Computing consensus networks for collections of 1-nested phylogenetic networks
- Phylogenetic network dissimilarity measures that take branch lengths into account
- Distinct-cluster tree-child phylogenetic networks and possible uses to study polyploidy
- Merging arcs to produce acyclic phylogenetic networks and normal networks
- Constructing the Simplest Possible Phylogenetic Network from Triplets
This page was built for publication: Comparing and simplifying distinct-cluster phylogenetic networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q505705)