Deep kernelization for the tree bisection and reconnection (TBR) distance in phylogenetics
type: Item
instance of: scholarly article
title: Deep kernelization for the tree bisection and reconnection (TBR) distance in phylogenetics
arXiv ID: 2206.04451
author: Steven Kelk
author: Simone Linz
author: Ruben Meuwese
published in: Journal of Computer and System Sciences
publication date: 2024-03-11T00:00:00Z
full work available at URL: https://arxiv.org/abs/2206.04451
Mathematics Subject Classification ID: 68-XX
zbMATH DE Number: 7815425
zbMATH Keywords: phylogenetics
zbMATH Keywords: agreement forest
zbMATH Keywords: TBR distance
zbMATH Keywords: kernelization
zbMATH Keywords: fixed parameter tractability
MaRDI profile type: Publication
cites work: An Improved Kernel for the Undirected Planar Feedback Vertex Set Problem
cites work: Subtree transfer operations and their induced metrics on evolutionary trees
cites work: Extremal distances for subtree transfer operations in binary trees
cites work: A Linear Kernel for Planar Feedback Vertex Set
cites work: A \(13k\)-kernel for planar feedback vertex set via region decomposition
cites work: Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees
cites work: Parameterized Algorithms
cites work: Fundamentals of parameterized complexity
cites work: On the maximum parsimony distance between phylogenetic trees
cites work: Kernelization
cites work: On the complexity of comparing evolutionary trees
cites work: A Tight Kernel for Computing the Tree Bisection and Reconnection Distance between Two Phylogenetic Trees
cites work: New reduction rules for the tree bisection and reconnection distance
cites work: Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance
cites work: Phylogenetic incongruence through the lens of monadic second order logic
cites work: Q4792088
cites work: Hybridization number on three rooted binary trees is EPT
cites work: On unrooted and root-uncertain variants of several well-known phylogenetic network problems
cites work: Reflections on kernelizing and computing unrooted agreement forests
cites work: Fixed-parameter algorithms for maximum agreement forests
cites work: A New Linear Kernel for Undirected Planar Feedback Vertex Set: Smaller and Simpler
Wikidata QID: Q129326505
DOI: 10.1016/J.JCSS.2024.103519
description: scientific article; zbMATH DE number 7815425