Follow
Remie Janssen
Remie Janssen
former PhD student, TU Delft
Verified email at tudelft.nl
Title
Cited by
Cited by
Year
Exploring the tiers of rooted phylogenetic network space using tail moves
R Janssen, M Jones, PL Erdős, L van Iersel, C Scornavacca
Bulletin of mathematical biology 80 (8), 2177-2208, 2018
222018
On cherry-picking and network containment
R Janssen, Y Murakami
Theoretical Computer Science, 2020
18*2020
Orienting undirected phylogenetic networks
KT Huber, L van Iersel, R Janssen, M Jones, V Moulton, Y Murakami, ...
arXiv preprint arXiv:1906.07430, 2019
13*2019
Reconstructing Tree-child Networks from Reticulate-edge-deleted Subnetworks
Y Murakami, L van Iersel, R Janssen, M Jones, V Moulton
arXiv preprint arXiv:1811.06777, 2018
132018
Polynomial-Time Algorithms for Phylogenetic Inference Problems involving duplication and reticulation.
L van Iersel, R Janssen, M Jones, Y Murakami, N Zeh
IEEE/ACM transactions on computational biology and bioinformatics, 2019
8*2019
A practical fixed-parameter algorithm for constructing tree-child networks from multiple binary trees
L van Iersel, R Janssen, M Jones, Y Murakami, N Zeh
Algorithmica 84 (4), 917-960, 2022
72022
A unifying characterization of tree-based networks and orchard networks using cherry covers
L van Iersel, R Janssen, M Jones, Y Murakami, N Zeh
Advances in Applied Mathematics 129, 102222, 2021
62021
Linear Time Algorithm for Tree-Child Network Containment
R Janssen, Y Murakami
International Conference on Algorithms for Computational Biology, 93-107, 2020
52020
Distinguishing level-1 phylogenetic networks on the basis of data generated by Markov processes
E Gross, L van Iersel, R Janssen, M Jones, C Long, Y Murakami
Journal of Mathematical Biology 83 (3), 1-24, 2021
42021
Heading in the right direction? Using head moves to traverse phylogenetic network space
R Janssen
Journal of Graph Algorithms and Applications 25 (1), 263-310, 2021
42021
Combining Networks Using Cherry Picking Sequences
R Janssen, M Jones, Y Murakami
International Conference on Algorithms for Computational Biology, 77-92, 2020
42020
Rearrangement operations on unrooted phylogenetic networks
R Janssen, J Klawitter
Theory and Applications of Graphs 6 (2), 6, 2019
42019
Treewidth of display graphs: bounds, brambles and applications
R Janssen, M Jones, S Kelk, G Stamoulis, T Wu
Journal of Graph Algorithms and Applications 23 (4), 715-743, 2019
42019
Comparing the topology of phylogenetic network generators
R Janssen, P Liu
Journal of Bioinformatics and Computational Biology 19 (6), 2140012, 2021
32021
Cutting an alignment with Ockham's razor
M Jones, P Gambette, L van Iersel, R Janssen, S Kelk, F Pardi, ...
arXiv preprint arXiv:1910.11041, 2019
22019
Rearranging Phylogenetic Networks
R Janssen
Delft University of Technology, 2021
12021
The Burning Number of Directed Graphs: Bounds and Computational Complexity
R Janssen
Theory and Applications of Graphs 7 (1), 8, 2020
12020
Connectedness of Unit Distance Subgraphs Induced by Closed Convex Sets
R Janssen, L van Steijn
Theory and Applications of Graphs 9 (1), 2022
2022
Level-2 networks from shortest and longest distances
KT Huber, L van Iersel, R Janssen, M Jones, V Moulton, Y Murakami
Discrete Applied Mathematics 306, 138-165, 2022
2022
Orchard Networks are Trees with Additional Horizontal Arcs
L van Iersel, R Janssen, M Jones, Y Murakami
arXiv preprint arXiv:2110.11065, 2021
2021
The system can't perform the operation now. Try again later.
Articles 1–20