Computing quadratic entropy in evolutionary trees
From MaRDI portal
Recommendations
- New measures for comparing the species diversity found in two or more habitats
- Measuring diversity from dissimilarities with Rao's quadratic entropy: are any dissimilarities suitable?
- Fast phylogenetic biodiversity computations under a non-uniform random distribution
- scientific article; zbMATH DE number 2081035
- Computing the quartet distance between evolutionary trees in time \(O(n\,\log n)\)
Cites work
- scientific article; zbMATH DE number 1865935 (Why is no real title available?)
- scientific article; zbMATH DE number 3323598 (Why is no real title available?)
- A framework for representing reticulate evolution
- A supertree method for rooted trees
- Diversity and dissimilarity coefficients: A unified approach
- Measuring diversity from dissimilarities with Rao's quadratic entropy: are any dissimilarities suitable?
- Properties of phylogenetic trees generated by Yule-type speciation models
- Reconstructing minimal rooted trees.
- The Noah's Ark Problem
- Vertex-weighted Wiener polynomials for composite graphs
- Vertex-weightings for distance moments and thorny graphs
- Wiener index of hexagonal systems
- Wiener index of trees: Theory and applications
- Wiener number of vertex-weighted graphs and a chemical application
Cited in
(2)
This page was built for publication: Computing quadratic entropy in evolutionary trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2429024)
