Rooted NNI moves on tree-based phylogenetic networks

  title={Rooted NNI moves on tree-based phylogenetic networks},
  author={P'eter L. ErdHos and Andrew R. Francis and Tam{\'a}s R{\'o}bert Mezei},
  journal={arXiv: Populations and Evolution},

Figures from this paper


Which Phylogenetic Networks are Merely Trees with Additional Arcs?
A precise and easily tested criterion is established that efficiently determines whether or not any given network can be realized in this way, and the proof provides a polynomial-time algorithm for finding one or more trees on which thenetwork can be based.
How tree-based is my network? Proximity measures for unrooted phylogenetic networks
Spaces of phylogenetic networks.
  • PhD thesis. University of Auckland,
  • 2020
The Space of Tree-Based Phylogenetic Networks
It is shown that the space of unrooted tree-based phylogenetic networks is indeed connected under the nearest neighbour interchange, or NNI, and an upper bound on the size of thespace of tree- based networks is derived.
A class of phylogenetic networks reconstructable from ancestral profiles.
Rearrangement operations on unrooted phylogenetic networks
This work proves connectedness and asymptotic bounds on the diameters of spaces of different classes of phylogenetic networks, including tree-based and level-$k$ networks and shows that computing the TBR-distance and the PR-distance of two phylogenetic Networks is NP-hard.
Exploring the Tiers of Rooted Phylogenetic Network Space Using Tail Moves
This work shows that any two rooted phylogenetic networks of the same complexity are connected by a sequence of either rSPR or rNNI moves, and gives bounds on the number of (distance-1) tail moves necessary to turn one network into another.
New characterisations of tree-based networks and proximity measures
Nonbinary Tree-Based Phylogenetic Networks
This work gives simple graph-theoretic characterizations of tree-based and strictly-tree-based nonbinary phylogenetic networks and shows for each of these two classes that it can be decided in polynomial time whether a given network is contained in the class.
Rearrangement moves on rooted phylogenetic networks
This paper proposes “horizontal” moves that ensure that every network of a certain complexity can be reached from any other network of the same complexity, and “vertical” Moves that ensure reachability between networks of different complexities that are robust to the fact that networks with higher complexity usually allow a better fit with the data.