Name
Abstract | ||
|---|---|---|
Phylogenetic networks are a type of directed acyclic graph that represent how a set X of present-day species are descended from a common ancestor by processes of speciation and reticulate evolution. In the absence of reticulate evolution, such networks are simply phylogenetic (evolutionary) trees. Moreover, phylogenetic networks that are not trees can sometimes be represented as phylogenetic trees with additional directed edges placed between their edges. Such networks are called tree-based, and the class of phylogenetic networks that are tree-based has recently been characterised. In this paper, we establish a number of new characterisations of tree-based networks in terms of path partitions and antichains (in the spirit of Dilworth's theorem), as well as via matchings in a bipartite graph. We also show that a temporal network is tree-based if and only if it satisfies an antichain-to-leaf condition. In the second part of the paper, we define three indices that measure the extent to which an arbitrary phylogenetic network deviates from being tree-based. We describe how these three indices can be computed efficiently using classical results concerning maximum-sized matchings in bipartite graphs.
|
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.aam.2017.08.003 | Advances in Applied Mathematics |
Keywords | Field | DocType |
05C05, 05C20, 05C85, 05D15, 92D15, Antichain, Dilworth's theorem, Path partition, Phylogenetic network, Tree-based network | Discrete mathematics,Combinatorics,Phylogenetic tree,Tree rearrangement,Bipartite graph,Directed acyclic graph,If and only if,Reticulate evolution,Mathematics,Phylogenetic network | Journal |
Volume | ISSN | Citations |
93 | 0196-8858 | 0 |
PageRank | References | Authors |
0.34 | 4 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andrew R Francis | 1 | 36 | 4.01 |
| Charles Semple | 2 | 432 | 47.99 |
| Mike Steel | 3 | 270 | 41.87 |