scientific article; zbMATH DE number 3891391
[For the entire collection see Zbl 0547.00011.] From the authors' abstract: Evolutionary trees of biology are represented by a special class of labelled trees. They are characterized by having disjoint subsets of the labelling set assigned to the vertices of a tree in such a way that no pendant vertex or vertex of degree two is assigned an empty set of labels. In this paper exact and asymptotic numbers are determined for two classes of evolutionary trees. The first class is characterized by the properties that: (i) its members have only singleton labels, and (ii) there are no vertices of degree two, and (iii) only vertices of degree one or two are labelled. This paper continues previous work by the authors on the enumeration of various classes of evolutionary trees.
- Enumerating phylogenetic trees with multiple labels
- Counting consistent phylogenetic trees is \#P-complete
- Exact enumeration of cherries and pitchforks in ranked trees under the coalescent model
- Strict monotonic trees arising from evolutionary processes: combinatorial and probabilistic study
- Comparing Trees with Pendant Vertices Labelled
- scientific article; zbMATH DE number 3859156 (Why is no real title available?)
- Counting labeled Greg cacti and clique trees
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3347902)