On the maximum parsimony distance between phylogenetic trees (Q259724): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(9 intermediate revisions by 4 users not shown)
Property / instance of
 
Property / instance of: scholarly article / rank
Normal rank
 
Property / author
 
Property / author: Mareike Fischer / rank
Normal rank
 
Property / author
 
Property / author: Steven Kelk / rank
Normal rank
 
Property / author
 
Property / author: Mareike Fischer / rank
Normal rank
 
Property / published in
 
Property / published in: Annals of Combinatorics / rank
Normal rank
 
Property / instance of
 
Property / instance of: scholarly article / rank
 
Normal rank
Property / author
 
Property / author: Mareike Fischer / rank
 
Normal rank
Property / author
 
Property / author: Steven Kelk / rank
 
Normal rank
Property / published in
 
Property / published in: Annals of Combinatorics / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2964179375 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1402.1553 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some APX-completeness results for cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subtree transfer operations and their induced metrics on evolutionary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of phylogenetic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cluster reduction for computing the subtree distance between phylogenies / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of the rooted subtree prune and regraft distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: The splits in the neighborhood of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Brooks' graph-coloring theorem and the independence number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a maximum likelihood tree is hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: On agreement forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner problem in phylogeny is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Tree Partitioning Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum agreement forest problem: Approximation algorithms and computational experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4792088 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Nonbinary Agreement Forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Algorithms for Maximum Agreement Forests / rank
 
Normal rank

Latest revision as of 16:02, 11 July 2024

scientific article
Language Label Description Also known as
English
On the maximum parsimony distance between phylogenetic trees
scientific article

    Statements

    On the maximum parsimony distance between phylogenetic trees (English)
    0 references
    18 March 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    maximum parsimony
    0 references
    tree metric
    0 references
    subtree prune and regraft
    0 references
    0 references
    0 references
    0 references
    0 references