Deep kernelization for the tree bisection and reconnection (TBR) distance in phylogenetics
From MaRDI portal
Publication:6152184
DOI10.1016/j.jcss.2024.103519arXiv2206.04451WikidataQ129326505 ScholiaQ129326505MaRDI QIDQ6152184
Ruben Meuwese, Steven Kelk, Simone Linz
Publication date: 11 March 2024
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2206.04451
Cites Work
- Unnamed Item
- On the maximum parsimony distance between phylogenetic trees
- A \(13k\)-kernel for planar feedback vertex set via region decomposition
- Fundamentals of parameterized complexity
- Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees
- On unrooted and root-uncertain variants of several well-known phylogenetic network problems
- Reflections on kernelizing and computing unrooted agreement forests
- New reduction rules for the tree bisection and reconnection distance
- Extremal distances for subtree transfer operations in binary trees
- Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance
- Phylogenetic incongruence through the lens of Monadic Second Order logic
- Hybridization Number on Three Rooted Binary Trees is EPT
- Fixed-Parameter Algorithms for Maximum Agreement Forests
- A Linear Kernel for Planar Feedback Vertex Set
- Kernelization
- An Improved Kernel for the Undirected Planar Feedback Vertex Set Problem
- A Tight Kernel for Computing the Tree Bisection and Reconnection Distance between Two Phylogenetic Trees
- A New Linear Kernel for Undirected Planar Feedback Vertex Set: Smaller and Simpler
- Parameterized Algorithms
- Subtree transfer operations and their induced metrics on evolutionary trees
- On the complexity of comparing evolutionary trees
This page was built for publication: Deep kernelization for the tree bisection and reconnection (TBR) distance in phylogenetics
