Pages
- 1
- 2
- document
-
Huber, Katharina T. (author), van Iersel, L.J.J. (author), Janssen, R. (author), Jones, M.E.L. (author), Moulton, V.L. (author), Murakami, Yukihiro (author), Semple, Charles (author)This paper studies the relationship between undirected (unrooted) and directed (rooted) phylogenetic networks. We describe a polynomial-time algorithm for deciding whether an undirected nonbinary phylogenetic network, given the locations of the root and reticulation vertices, can be oriented as a directed nonbinary phylogenetic network....journal article 2024
- document
-
Huber, Katharina T. (author), van Iersel, L.J.J. (author), Janssen, R. (author), Jones, M.E.L. (author), Moulton, Vincent (author), Murakami, Yukihiro (author)Recently it was shown that a certain class of phylogenetic networks, called level-2 networks, cannot be reconstructed from their associated distance matrices. In this paper, we show that they can be reconstructed from their induced shortest and longest distance matrices. That is, if two level-2 networks induce the same shortest and longest...journal article 2022
- document
-
van Iersel, L.J.J. (author), Janssen, R. (author), Jones, M.E.L. (author), Murakami, Yukihiro (author), Zeh, Norbert (author)We present the first fixed-parameter algorithm for constructing a tree-child phylogenetic network that displays an arbitrary number of binary input trees and has the minimum number of reticulations among all such networks. The algorithm uses the recently introduced framework of cherry picking sequences and runs in O((8 k) <sup>k</sup>poly (n,...journal article 2022
- document
-
van Iersel, L.J.J. (author), Janssen, R. (author), Jones, M.E.L. (author), Murakami, Yukihiro (author)Phylogenetic networks are used in biology to represent evolutionary histories. The class of orchard phylogenetic networks was recently introduced for their computational benefits, without any biological justification. Here, we show that orchard networks can be interpreted as trees with additional horizontal arcs. Therefore, they are closely...journal article 2022
- document
-
Janssen, R. (author), van Steijn, Leonie (author)The unit distance graph G<sup>1</sup><sub>Rd</sub> is the infinite graph whose nodes are points in R<sup>d</sup>, with an edge between two points if the Euclidean distance between these points is 1. The 2-dimensional version G<sup>1</sup><sub>R2</sub> of this graph is typically studied for its chromatic number, as in the Hadwiger-Nelson...journal article 2022
- document
- Janssen, R. (author) doctoral thesis 2021
- document
-
Janssen, R. (author), Liu, Pengyu (author)Phylogenetic networks represent evolutionary history of species and can record natural reticulate evolutionary processes such as horizontal gene transfer and gene recombination. This makes phylogenetic networks a more comprehensive representation of evolutionary history compared to phylogenetic trees. Stochastic processes for generating...journal article 2021
- document
-
Janssen, R. (author)Head moves are a type of rearrangement moves for phylogenetic net-works. They have primarily been studied as part of other types of moves, such as rSPR moves. Here, we study head moves as a type of moves on themselves. We show that the tiers (k > 0) of phylogenetic network space are connected by local head moves. Then, we show tail moves...journal article 2021
- document
-
Gross, Elizabeth (author), van Iersel, L.J.J. (author), Janssen, R. (author), Jones, M.E.L. (author), Long, Colby (author), Murakami, Yukihiro (author)Phylogenetic networks can represent evolutionary events that cannot be described by phylogenetic trees. These networks are able to incorporate reticulate evolutionary events such as hybridization, introgression, and lateral gene transfer. Recently, network-based Markov models of DNA sequence evolution have been introduced along with model...journal article 2021
- document
-
van Iersel, L.J.J. (author), Janssen, R. (author), Jones, M.E.L. (author), Murakami, Yukihiro (author), Zeh, Norbert (author)Phylogenetic networks are used to represent evolutionary relationships between species in biology. Such networks are often categorized into classes by their topological features, which stem from both biological and computational motivations. We study two network classes in this paper: tree-based networks and orchard networks. Tree-based...journal article 2021
- document
-
Janssen, R. (author), Murakami, Yukihiro (author)Phylogenetic networks are used to represent evolutionary scenarios in biology and linguistics. To find the most probable scenario, it may be necessary to compare candidate networks. In particular, one needs to distinguish different networks and determine whether one network is contained in another. In this paper, we introduce cherry-picking...journal article 2021
- document
-
Janssen, R. (author), Jones, M.E.L. (author), Murakami, Yukihiro (author)Phylogenetic networks are important for the study of evolution. The number of methods to find such networks is increasing, but most such methods can only reconstruct small networks. To find bigger networks, one can attempt to combine small networks. In this paper, we study the Network Hybridization problem, a problem of combining networks...conference paper 2020
- document
-
Janssen, R. (author), Murakami, Yukihiro (author)Phylogenetic networks are used to represent evolutionary scenarios in biology and linguistics. To find the most probable scenario, it may be necessary to compare candidate networks, to distinguish different networks, and to see when one network is embedded in another. Here, we consider the Network Containment problem, which asks whether a...conference paper 2020
- document
-
van Iersel, L.J.J. (author), Janssen, R. (author), Jones, M.E.L. (author), Murakami, Yukihiro (author), Zeh, Norbert (author)A common problem in phylogenetics is to try to infer a species phylogeny from gene trees. We consider different variants of this problem. The first variant, called Unrestricted Minimal Episodes Inference, aims at inferring a species tree based on a model with speciation and duplication where duplications are clustered in duplication episodes....journal article 2020
- document
-
Janssen, R. (author)The burning number of a graph was recently introduced by Bonato et al. Although they mention that the burning number generalises naturally to directed graphs, no further research on this has been done. Here, we introduce graph burning for directed graphs, and we study bounds for the corresponding burning number and the hardness of finding...journal article 2020
- document
-
Janssen, R. (author), Klawitter, Jonathan (author)Rearrangement operations transform a phylogenetic tree into another one and hence induce a metric on the space of phylogenetic trees. Popular operations for unrooted phylogenetic trees are NNI (nearest neighbour interchange), SPR (subtree prune and regraft), and TBR (tree bisection and reconnection). Recently, these operations have been...journal article 2019
- document
-
Janssen, R. (author), Jones, M.E.L. (author), Kelk, Steven (author), Stamoulis, Georgios (author), Wu, Taoyang (author)Phylogenetic trees and networks are leaf-labelled graphs used to model evolution. Display graphs are created by identifying common leaf labels in two or more phylogenetic trees or networks. The treewidth of such graphs is bounded as a function of many common dissimilarity measures between phylogenetic trees and this has been leveraged in fixed...journal article 2019
- document
-
Murakami, Yukihiro (author), van Iersel, L.J.J. (author), Janssen, R. (author), Jones, M.E.L. (author), Moulton, V.L. (author)Network reconstruction lies at the heart of phylogenetic research. Two well-studied classes of phylogenetic networks include tree-child networks and level-k networks. In a tree-child network, every non-leaf node has a child that is a tree node or a leaf. In a level-k network, the maximum number of reticulations contained in a biconnected...journal article 2019
- document
-
Janssen, R. (author), Jones, M.E.L. (author), Erdős, Péter L. (author), van Iersel, L.J.J. (author), Scornavacca, Celine (author)Popular methods for exploring the space of rooted phylogenetic trees use rearrangement moves such as rooted Nearest Neighbour Interchange (rNNI) and rooted Subtree Prune and Regraft (rSPR). Recently, these moves were generalized to rooted phylogenetic networks, which are a more suitable representation of reticulate evolutionary histories, and...journal article 2018
- document
-
van Iersel, L.J.J. (author), Janssen, R. (author), Jones, M.E.L. (author), Murakami, Yukihiro (author), Zeh, Norbert (author)A common problem in phylogenetics is to try to infer a species phylogeny from gene trees. We consider different variants of this problem. The first variant, called Unrestricted Minimal Episodes Inference, aims at inferring a species tree based on a model of speciation and duplication where duplications are clustered in duplication episodes....conference paper 2018
Pages
- 1
- 2