A note on convex characters, Fibonacci numbers and exponential-time algorithms (Q730310): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
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: Identifying phylogenetic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Basic Phylogenetic Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum parsimony distance between phylogenetic trees / 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: Q4792088 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of reconstructing trees from qualitative characters and subtrees / rank
 
Normal rank

Revision as of 04:52, 13 July 2024

scientific article
Language Label Description Also known as
English
A note on convex characters, Fibonacci numbers and exponential-time algorithms
scientific article

    Statements

    A note on convex characters, Fibonacci numbers and exponential-time algorithms (English)
    0 references
    0 references
    0 references
    27 December 2016
    0 references
    Fibonacci numbers
    0 references
    phylogenetics
    0 references
    trees
    0 references
    convexity
    0 references
    counting
    0 references
    algorithms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references