Distributions on bicoloured binary trees arising from the principle of parsimony (Q1208487): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Methods in Enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Distribution of Lengths of Evolutionary Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree enumeration modulo a consensus / 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: Q3669422 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hereditarily finite sets and identity trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5616724 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributions on bicoloured evolutionary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Significance of the length of the shortest tree / rank
 
Normal rank

Latest revision as of 15:25, 17 May 2024

scientific article
Language Label Description Also known as
English
Distributions on bicoloured binary trees arising from the principle of parsimony
scientific article

    Statements

    Distributions on bicoloured binary trees arising from the principle of parsimony (English)
    0 references
    16 May 1993
    0 references
    The paper investigates the distribution of binary trees with bicoloured endpoints under the taxonomic principle of parsimony. A formula given by \textit{M. Carter}, \textit{M. Hendy}, \textit{D. Penny}, \textit{L. A. Székely} and \textit{N. C. Wormald} [SIAM J. Discrete Math. 3, No. 1, 38-47 (1990; Zbl 0705.05017)] for the number of binary trees with given number of endpoints in two colours and given weight (= number of mutations) is proved in a more constructive way than by Carter et al. A generalization for \(r\)-coloured trees is outlined. Dually the author also counts bicolourings of given weight on given binary trees in order to calculate mean and variance for the weight of aligned binary-state sequence data.
    0 references
    forest
    0 references
    evolutionary tree
    0 references
    minimum-length-tree
    0 references
    Menger's theorem
    0 references
    binary trees
    0 references
    principle of parsimony
    0 references
    0 references
    0 references

    Identifiers

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