On compatibility and incompatibility of collections of unrooted phylogenetic trees (Q1752481): Difference between revisions

From MaRDI portal
m rollbackEdits.php mass rollback
Tag: Rollback
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2017.05.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2617430954 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy problems for tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden minors characterization of partial 3-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying phylogenetic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compatibility of unrooted phylogenetic trees is FPT / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterisation of rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast compatibility testing for phylogenies with nested taxa / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Compatibility Testing for Rooted Phylogenetic Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Algorithms for Finding Agreement Supertrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Low Treewidth Graphs and Supertrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction rules for the maximum parsimony distance on phylogenetic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Phylogenetic incongruence through the lens of Monadic Second Order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. III. Planar tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XX: Wagner's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: The agreement problem for unrooted phylogenetic trees is FPT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4792088 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of reconstructing trees from qualitative characters and subtrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph triangulations and the compatibility of unrooted phylogenetic trees / rank
 
Normal rank

Latest revision as of 17:16, 15 July 2024

scientific article
Language Label Description Also known as
English
On compatibility and incompatibility of collections of unrooted phylogenetic trees
scientific article

    Statements

    On compatibility and incompatibility of collections of unrooted phylogenetic trees (English)
    0 references
    0 references
    0 references
    24 May 2018
    0 references
    0 references
    phylogenetics
    0 references
    triangulations
    0 references
    treewidth
    0 references
    graph minors
    0 references
    0 references
    0 references
    0 references
    0 references