Computing nearest neighbour interchange distances between ranked phylogenetic trees (Q96718): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q113905581 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3122154912 / 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: On the computational complexity of the rooted subtree prune and regraft distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the linear-cost subtree-transfer distance between phylogenetic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5457044 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The space of ultrametric phylogenetic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The combinatorics of discrete time-trees: theory and open problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of comparing evolutionary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: New approaches in classification and data analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of phylogenetic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4792088 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ricci-Ollivier curvature of the rooted phylogenetic subtree-prune-regraft graph / rank
 
Normal rank

Latest revision as of 11:42, 24 July 2024

scientific article
Language Label Description Also known as
English
Computing nearest neighbour interchange distances between ranked phylogenetic trees
scientific article

    Statements

    82
    0 references
    1-2
    0 references
    January 2021
    0 references
    28 January 2021
    0 references
    0 references
    0 references
    0 references
    Computing nearest neighbour interchange distances between ranked phylogenetic trees (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references