On compatibility and incompatibility of collections of unrooted phylogenetic trees
From MaRDI portal
Publication:1752481
DOI10.1016/j.dam.2017.05.002zbMath1387.05045OpenAlexW2617430954MaRDI QIDQ1752481
Sudheer R. Vakati, David Fernández Baca
Publication date: 24 May 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2017.05.002
Related Items
Treewidth distance on phylogenetic trees ⋮ Treewidth of display graphs: bounds, brambles and applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reduction rules for the maximum parsimony distance on phylogenetic trees
- Graph triangulations and the compatibility of unrooted phylogenetic trees
- Graph minors. XX: Wagner's conjecture
- Graph minors. III. Planar tree-width
- Compatibility of unrooted phylogenetic trees is FPT
- Forbidden minors characterization of partial 3-trees
- The complexity of reconstructing trees from qualitative characters and subtrees
- Fast compatibility testing for phylogenies with nested taxa
- A characterisation of rigid circuit graphs
- Algorithmic graph theory and perfect graphs
- Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees
- Identifying phylogenetic trees
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Phylogenetic incongruence through the lens of Monadic Second Order logic
- On Low Treewidth Graphs and Supertrees
- Easy problems for tree-decomposable graphs
- Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
- Fixed-Parameter Algorithms for Finding Agreement Supertrees
- Fast Compatibility Testing for Rooted Phylogenetic Trees
- The agreement problem for unrooted phylogenetic trees is FPT
