Tail move rearrangement algorithm for rooted binary phylogenetic networks

A common tool for exploring the space of phylogenetic networks is applying rearrangement moves, such as <i>tail moves</i>. Recently, it has been shown by Janssen et al that, given a rooted binary phylogenetic network, it is possible to generate any other alternative network, using only tail moves. The aim of this report is to translate this...