Embedding phylogenetic trees in networks of low treewidth

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Kernelizations for the hybridization number problem on multiple nonbinary trees
Folding and unfolding phylogenetic trees and networks
Compatibility of unrooted phylogenetic trees is FPT
Computing the minimum number of hybridization events for a consistent evolutionary history
Are there any good digraph width measures?
Seeing the trees and their branches in the network is hard
The directed subgraph homeomorphism problem
Treewidth. Computations and approximations
Treewidth distance on phylogenetic trees
Solving the tree containment problem in linear time for nearly stable phylogenetic networks
Solving the tree containment problem for reticulation-visible networks in linear time
Locating a tree in a phylogenetic network
On unrooted and root-uncertain variants of several well-known phylogenetic network problems
Measuring what matters: a hybrid approach to dynamic programming with treewidth
On cherry-picking and network containment
Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees
A quadratic kernel for computing the hybridization number of multiple trees
The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
The rigid hybrid number for two phylogenetic trees
Phylogenetic incongruence through the lens of monadic second order logic
Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time
A \(c^k n\) 5-approximation algorithm for treewidth
On Low Treewidth Graphs and Supertrees
Scanning Phylogenetic Networks Is NP-hard
Easy problems for tree-decomposable graphs
Improved Approximation Algorithms for Minimum Weight Vertex Separators
Handbook of Graph Grammars and Computing by Graph Transformation
Drawing Tree-Based Phylogenetic Networks with Minimum Number of Crossings
Hitting topological minors is FPT
Treewidth of display graphs: bounds, brambles and applications
Finding topological subgraphs is fixed-parameter tractable
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
Parameterized Algorithms
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

This page was built for publication: Embedding phylogenetic trees in networks of low treewidth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6599789)