Comparison of labeled trees with valency three

DOI10.1016/0095-8956(71)90020-7MaRDI QIDQ5577690zbMATH OpenOpenAlexWikidataFDO

Authors David Robinson

Publication date 1970

Published in Journal of Combinatorial Theory, Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0095-8956(71)90020-7

Mathematics Subject Classification ID

Trees (05C05)

Recommendations

• Trees
• A subclass of labeled ternary trees and its generalization
• Enumeration of externally labelled trees
• On plane trees with a prescribed number of valency set realizations
• scientific article; zbMATH DE number 3906515

Cited in

(43)

• Approximating minimum-length-sequence metrics: A cautionary note
• Counterexamples in measuring the distance between binary trees
• Comparison of phylogenetic trees
• Dimension reduction in principal component analysis for trees
• Classification of molecular sequence data using Bayesian phylogenetic mixture models
• Ricci-Ollivier curvature of the rooted phylogenetic subtree-prune-regraft graph
• The complexity of comparing multiply-labelled trees by extending phylogenetic-tree metrics
• Bounds for phylogenetic network space metrics
• New Gromov-inspired metrics on phylogenetic tree space
• Landscapes on spaces of trees
• The edge-product space of phylogenetic trees is not shellable
• Convergence of maximum likelihood supertree reconstruction
• Fast algorithms for the rooted triplet distance between caterpillars
• The space of tree-based phylogenetic networks
• Cubic graphs, their Ehrhart quasi-polynomials, and a scissors congruence phenomenon
• Neighborhoods of trees in circular orderings
• Non-shared edges and nearest neighbor interchanges revisited
• Lost in space? Generalising subtree prune and regraft to spaces of phylogenetic networks
• Consistency and convergence rate of phylogenetic inference via regularization
• Spaces of phylogenetic networks from generalized nearest-neighbor interchange operations
• Rooted NNI moves and distance-1 tail moves on tree-based phylogenetic networks
• Transforming phylogenetic networks: moving beyond tree space
• Characterizing local optima for maximum parsimony
• A statistic related to trees and words on a finite alphabet
• scientific article; zbMATH DE number 4079486 (Why is no real title available?)
• On non-trivially decomposable types
• The SNPR neighbourhood of tree-child networks
• Enumeration of externally labelled trees
• Comparing and simplifying distinct-cluster phylogenetic networks
• Discriminative measures for comparison of phylogenetic trees
• Neighborhoods of phylogenetic trees: exact and asymptotic counts
• Reconstructing evolution of sequences subject to recombination using parsimony
• Computing the rooted triplet distance between phylogenetic networks
• Hypercubes and Hamilton cycles of display sets of rooted phylogenetic networks
• Exploring spaces of semi-directed level-1 networks
• The \(K\)-Robinson Foulds measures for labeled trees
• The ultrametric Gromov-Wasserstein distance
• Some notes on the nearest neighbour interchange distance
• Classifying tree topology changes along tropical line segments
• The Bourque distances for mutation trees of cancers
• Spaces of ranked tree-child networks
• A note on the path interval distance
• On plane trees with a prescribed number of valency set realizations

This page was built for publication: Comparison of labeled trees with valency three

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5577690)