Comparing Trees with Pendant Vertices Labelled

DOI10.1137/0144075zbMath0557.92010OpenAlexW2015332750MaRDI QIDQ3221788

Charles H. C. Little, David Penny, Michael D. Hendy

Publication date: 1984

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0144075

zbMATH Keywords

evolutionary treesbinary treescomputationefficientprotein sequence dataconflicting evolutionary hypothesisesdifference measure for phylogenetic treesgenerating polynomials for treeshierarchal systemsprobability distributions for tree differencesTouchard's problem of single systems

Mathematics Subject Classification ID

Trees (05C05) Genetics and epigenetics (92D10)

Related Items

Neighborhoods of Phylogenetic Trees: Exact and Asymptotic Counts, An optimal algorithm to reconstruct trees from additive distance data, Counting Phylogenetic Networks with Few Reticulation Vertices: Exact Enumeration and Corrections, The expected value of the squared cophenetic metric under the Yule and the uniform models, Significance of the length of the shortest tree, The mean value of the squared path-difference distance for rooted phylogenetic trees, Reconstructing evolution of sequences subject to recombination using parsimony, Optimal algorithms for comparing trees with labeled leaves