Comparing Trees with Pendant Vertices Labelled
From MaRDI portal
Recommendations
Cited in
(13)- Optimal algorithms for comparing trees with labeled leaves
- Enumerating phylogenetic trees with multiple labels
- An optimal algorithm to reconstruct trees from additive distance data
- Significance of the length of the shortest tree
- The expected value of the squared cophenetic metric under the Yule and the uniform models
- scientific article; zbMATH DE number 3859156 (Why is no real title available?)
- scientific article; zbMATH DE number 3891391 (Why is no real title available?)
- scientific article; zbMATH DE number 4065020 (Why is no real title available?)
- Counting Phylogenetic Networks with Few Reticulation Vertices: Exact Enumeration and Corrections
- Neighborhoods of phylogenetic trees: exact and asymptotic counts
- Reconstructing evolution of sequences subject to recombination using parsimony
- On the variational distance of two trees
- The mean value of the squared path-difference distance for rooted phylogenetic trees
This page was built for publication: Comparing Trees with Pendant Vertices Labelled
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3221788)