Zobrazeno 1 - 10
of 36
pro vyhledávání: '"Remie Janssen"'
Autor:
Remie Janssen, Leonie van Steijn
Publikováno v:
Theory and Applications of Graphs, Vol 9, Iss 1 (2022)
The unit distance graph $G^1_{R^d}$ is the infinite graph whose nodes are points in $R^d$, with an edge between two points if the Euclidean distance between these points is $1$. The 2-dimensional version $G^1_{R^2}$ of this graph is typically studied
Externí odkaz:
https://doaj.org/article/1d2d980e871345fabf9feae6bbf6459c
Autor:
Remie Janssen
Publikováno v:
Theory and Applications of Graphs, Vol 7 (2020)
The burning number of a graph was recently introduced by Bonato et al. Although they mention that the burning number generalizes naturally to directed graphs, no further research on this has been done. Here, we introduce graph burning for directed gr
Externí odkaz:
https://doaj.org/article/d7c17a6676f2423c9d96a4fc1c8e3375
Autor:
Remie Janssen, Jonathan Klawitter
Publikováno v:
Theory and Applications of Graphs, Vol 6, Iss 2 (2019)
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 r
Externí odkaz:
https://doaj.org/article/fd38f949e1e34355ba9a0301e863b4f9
Autor:
Remie Janssen
Publikováno v:
Journal of Graph Algorithms and Applications, 25(1)
Head moves are a type of rearrangement moves for phylogenetic networks. They have mostly been studied as part of more encompassing types of moves, such as rSPR moves. Here, we study head moves as a type of moves on themselves. We show that the tiers
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f7faecdf7b3524bf6590877f3e751f01
https://doi.org/10.7155/jgaa.00559
https://doi.org/10.7155/jgaa.00559
The maximum parsimony distance $d_{\textrm{MP}}(T_1,T_2)$ and the bounded-state maximum parsimony distance $d_{\textrm{MP}}^t(T_1,T_2)$ measure the difference between two phylogenetic trees $T_1,T_2$ in terms of the maximum difference between their p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fb0911f2a2144637e811dc93b39126bf
Publikováno v:
Algorithmica, 84(4)
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 rece
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5b67a80e5be6fd1c4d01c9c0a5a2c2c6
http://resolver.tudelft.nl/uuid:70e72477-d616-4b6f-a275-f16df603453b
http://resolver.tudelft.nl/uuid:70e72477-d616-4b6f-a275-f16df603453b
Publikováno v:
Bulletin of Mathematical Biology, 84(8)
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 netwo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3634d3f4147cfbe71eecd1f1e3a065d7
https://pubmed.ncbi.nlm.nih.gov/35727410
https://pubmed.ncbi.nlm.nih.gov/35727410
Publikováno v:
Journal of Graph Algorithms and Applications, 23(4), 715-743
Journal of Graph Algorithms and Applications, 23(4)
Journal of Graph Algorithms and Applications, 23(4), 715-743. Brown University
Journal of Graph Algorithms and Applications, 23(4)
Journal of Graph Algorithms and Applications, 23(4), 715-743. Brown University
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 man
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e407128be18c65c7734d27415c887b3c
https://doi.org/10.7155/jgaa.00508
https://doi.org/10.7155/jgaa.00508
Publikováno v:
Bulletin of Mathematical Biology, 81(10)
Bulletin of Mathematical Biology
Bulletin of Mathematical Biology, 81, 3823-3863
Bulletin of Mathematical Biology
Bulletin of Mathematical Biology, 81, 3823-3863
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::736933b64d2832ce05681f3838085192
https://doi.org/10.1007/s11538-019-00641-w
https://doi.org/10.1007/s11538-019-00641-w
Autor:
Remie Janssen, Pengyu Liu
Publikováno v:
Journal of Bioinformatics and Computational Biology, 19(6)
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::be313693627162882aac8c3006174813
http://arxiv.org/abs/2106.06727
http://arxiv.org/abs/2106.06727