Treewidth distance on phylogenetic trees
From MaRDI portal
Publication:1637220
DOI10.1016/j.tcs.2018.04.004zbMath1395.05171arXiv1703.10840OpenAlexW2964239333WikidataQ129953326 ScholiaQ129953326MaRDI QIDQ1637220
Georgios Stamoulis, Taoyang Wu, Steven Kelk
Publication date: 7 June 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.10840
Trees (05C05) Problems related to evolution (92D15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (3)
Maximum parsimony distance on phylogenetic trees: a linear kernel and constant factor approximation algorithm ⋮ Scanning Phylogenetic Networks Is NP-hard ⋮ Treewidth of display graphs: bounds, brambles and applications
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the maximum parsimony distance between phylogenetic trees
- Kernelizations for the hybridization number problem on multiple nonbinary trees
- Reduction rules for the maximum parsimony distance on phylogenetic trees
- Compatibility, incompatibility, tree-width, and forbidden phylogenetic minors
- Fundamentals of parameterized complexity
- On the fixed parameter tractability of agreement-based phylogenetic distances
- On agreement forests
- Treewidth computations. II. Lower bounds
- Graph triangulations and the compatibility of unrooted phylogenetic trees
- A cluster reduction for computing the subtree distance between phylogenies
- Compatibility of unrooted phylogenetic trees is FPT
- Forbidden minors characterization of partial 3-trees
- Treewidth computations. I: Upper bounds
- Upper bounds on the size of obstructions and intertwines
- Treewidth for graphs with small chordality
- On the complexity of computing MP distance between binary phylogenetic trees
- On compatibility and incompatibility of collections of unrooted phylogenetic trees
- A parsimony-based metric for phylogenetic trees
- Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees
- A quadratic kernel for computing the hybridization number of multiple trees
- On tree width, bramble size, and expansion
- Phylogenetic incongruence through the lens of Monadic Second Order logic
- A $c^k n$ 5-Approximation Algorithm for Treewidth
- Phylogeny
- On exact algorithms for treewidth
- Excluded Grid Theorem
- On Low Treewidth Graphs and Supertrees
- Genus, Treewidth, and Local Crossing Number
- Complexity of Finding Embeddings in a k-Tree
- Parameterized Algorithms
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Subtree transfer operations and their induced metrics on evolutionary trees
This page was built for publication: Treewidth distance on phylogenetic trees
