On compatibility and incompatibility of collections of unrooted phylogenetic trees
type: Item
instance of: scholarly article
title: On compatibility and incompatibility of collections of unrooted phylogenetic trees
zbMATH Open document ID: 1387.05045
author: Sudheer Vakati
author: David Fernández-Baca
published in: Discrete Applied Mathematics
publication date: 2018-05-24T00:00:00Z
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C83
zbMATH DE Number: 6872408
zbMATH Keywords: phylogenetics
zbMATH Keywords: triangulations
zbMATH Keywords: treewidth
zbMATH Keywords: graph minors
MaRDI profile type: Publication
full work available at URL: j.dam.2017.05.002
OpenAlex ID: W2617430954
cites work: Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
cites work: Easy problems for tree-decomposable graphs
cites work: Forbidden minors characterization of partial 3-trees
cites work: Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees
cites work: Q3097395
cites work: Identifying phylogenetic trees
cites work: Compatibility of unrooted phylogenetic trees is FPT
cites work: A characterisation of rigid circuit graphs
cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
cites work: Fast compatibility testing for phylogenies with nested taxa
cites work: Fast Compatibility Testing for Rooted Phylogenetic Trees
cites work: Q4503944
cites work: Fixed-Parameter Algorithms for Finding Agreement Supertrees
cites work: Algorithmic graph theory and perfect graphs
cites work: On Low Treewidth Graphs and Supertrees
cites work: Reduction rules for the maximum parsimony distance on phylogenetic trees
cites work: Phylogenetic incongruence through the lens of monadic second order logic
cites work: Graph minors. III. Planar tree-width
cites work: Graph minors. XX: Wagner's conjecture
cites work: The agreement problem for unrooted phylogenetic trees is FPT
cites work: Q4792088
cites work: The complexity of reconstructing trees from qualitative characters and subtrees
cites work: Graph triangulations and the compatibility of unrooted phylogenetic trees
DOI: 10.1016/J.DAM.2017.05.002
description: scientific article; zbMATH DE number 6872408