{
  "id": "1501.07528",
  "version": "v1",
  "published": "2015-01-29T18:09:29.000Z",
  "updated": "2015-01-29T18:09:29.000Z",
  "title": "Comparing and simplifying distinct-cluster phylogenetic networks",
  "authors": [
    "Stephen J. Willson"
  ],
  "categories": [
    "math.CO"
  ],
  "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 remaining vertices. Many of the resulting networks may be uniquely determined without regard to the order of the simplifying operations.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2015-01-29T18:09:29.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "simplifying distinct-cluster phylogenetic networks",
      "distinct vertices",
      "rooted acyclic directed graphs",
      "distinct clusters",
      "paper focuses"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2015arXiv150107528W"
    }
  }
}