Computing quadratic entropy in evolutionary trees
From MaRDI portal
Publication:2429024
DOI10.1016/j.camwa.2011.09.030zbMath1236.92042OpenAlexW2069525135MaRDI QIDQ2429024
Arne Ø. Mooers, Aki Mimoto, Matt DeVos, Drago Bokal, Sandi Klavžar
Publication date: 22 April 2012
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2011.09.030
Trees (05C05) Problems related to evolution (92D15) Applications of graph theory (05C90) Applications of mathematical programming (90C90) Computational methods for problems pertaining to biology (92-08)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Diversity and dissimilarity coefficients: A unified approach
- Wiener number of vertex-weighted graphs and a chemical application
- A supertree method for rooted trees
- Wiener index of hexagonal systems
- A framework for representing reticulate evolution
- Reconstructing minimal rooted trees.
- Vertex-weightings for distance moments and thorny graphs
- Measuring diversity from dissimilarities with Rao's quadratic entropy: are any dissimilarities suitable?
- Vertex-weighted Wiener polynomials for composite graphs
- The Noah's Ark Problem
- Properties of phylogenetic trees generated by Yule-type speciation models
- Wiener index of trees: Theory and applications
This page was built for publication: Computing quadratic entropy in evolutionary trees