Comparing and simplifying distinct-cluster phylogenetic networks

From MaRDI portal
Publication:505705

DOI10.1007/S00026-016-0324-YzbMATH Open1361.92054arXiv1501.07528OpenAlexW1601599570WikidataQ59478503 ScholiaQ59478503MaRDI QIDQ505705FDOQ505705


Authors: Stephen J. Willson Edit this on Wikidata


Publication date: 26 January 2017

Published in: Annals of Combinatorics (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1501.07528




Recommendations




Cites Work


Cited In (3)

Uses Software





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)