{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:44:23Z","timestamp":1753893863798,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>Phylogenetic networks are rooted directed acyclic graphs that represent evolutionary relationships\u00a0between species whose past includes reticulation events such as hybridisation and horizontal gene\u00a0transfer.\u00a0To search the space of phylogenetic networks, the popular tree rearrangement operation rooted\u00a0subtree prune and regraft (rSPR) was recently generalised to phylogenetic networks.\u00a0This new operation \u2013\u00a0called subnet prune and regraft (SNPR) \u2013\u00a0induces a metric on the space of all\u00a0phylogenetic networks as well as on several widely-used network classes.\u00a0In this paper, we investigate several problems that arise in the context of computing the\u00a0SNPR-distance.\u00a0For a phylogenetic tree $T$ and a phylogenetic network $N$, we show how this distance can be\u00a0computed by considering the set of trees that are embedded in $N$ and then use this result to\u00a0characterise the SNPR-distance between $T$ and $N$ in terms of agreement forests.\u00a0Furthermore, we analyse properties of shortest SNPR-sequences between two phylogenetic networks $N$\u00a0and $N'$, and answer the question whether or not any of the classes of tree-child,\u00a0reticulation-visible, or tree-based networks isometrically embeds into the class of all phylogenetic\u00a0networks under SNPR.<\/jats:p>","DOI":"10.37236\/7860","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T07:08:36Z","timestamp":1578640116000},"source":"Crossref","is-referenced-by-count":2,"title":["On the Subnet Prune and Regraft Distance"],"prefix":"10.37236","volume":"26","author":[{"given":"Jonathan","family":"Klawitter","sequence":"first","affiliation":[]},{"given":"Simone","family":"Linz","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2019,4,5]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v26i2p3\/7815","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v26i2p3\/7815","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T04:15:16Z","timestamp":1579234516000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v26i2p3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,5]]},"references-count":0,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2019,4,5]]}},"URL":"https:\/\/doi.org\/10.37236\/7860","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2019,4,5]]},"article-number":"P2.3"}}