On the public citation graph
The generation of random, binary unordered trees
0 signed · 90 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf01071214openalex-snapshot
Coding and generation of nonisomorphic trees
inferredcites →https://doi.org/10.1007/bf02293848openalex-snapshot
Spatial Versus Tree Representations of Proximity Data
inferredcites →https://doi.org/10.1007/bf02306021openalex-snapshot
The Estimation of Ultrametric and Path Length Trees from Rectangular Proximity Data
inferredcites →https://doi.org/10.1007/bf02459385openalex-snapshot
Numbering binary trees with labeled terminal vertices
inferredcites →https://doi.org/10.1007/bf02462013openalex-snapshot
An algorithm to equiprobably generate all directed trees withk labeled terminal nodes and unlabeled interior nodes
inferredcites →https://doi.org/10.1016/0012-365x(75)90076-xopenalex-snapshot
The distribution of degrees in a large random tree
inferredcites →https://doi.org/10.1016/0020-0190(82)90140-5openalex-snapshot
Generation and ranking of K-ary trees
inferredcites →https://doi.org/10.1016/0095-8956(80)90049-0openalex-snapshot
On a 1-1-correspondence between rooted trees and natural numbers
inferredcites →https://doi.org/10.1016/0166-218x(84)90066-0openalex-snapshot
Counting dendrograms: A survey
inferredcites →https://doi.org/10.1016/0196-6774(81)90021-3openalex-snapshot
The uniform selection of free trees
inferredcites →https://doi.org/10.1016/b978-1-4832-3187-7.50017-9openalex-snapshot
THE CODING OF VARIOUS KINDS OF UNLABELED TREES
inferredcites →https://doi.org/10.1016/s0021-9800(70)80012-6openalex-snapshot
The distance between points in random trees
inferredcites →https://doi.org/10.1016/s0092-8240(84)80046-4openalex-snapshot
An algorithm to equiprobably generate all directed trees with labeled terminal nodes and unlabeled interior nodes
inferredcites →https://doi.org/10.1016/s0167-5060(08)70325-xopenalex-snapshot
Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
inferredcites →https://doi.org/10.1017/s0001867800037587openalex-snapshot
The probabilities of rooted tree-shapes generated by random bifurcation
inferredcites →https://doi.org/10.1080/00949658108810439openalex-snapshot
On probability distributions of single-linkage dendrograms
inferredcites →https://doi.org/10.1080/00949658308810686openalex-snapshot
A Probability theory of hierarchic clustering using random dendrograms
inferredcites →https://doi.org/10.1093/ej/33.130.269openalex-snapshot
Journal of the Royal Statistical Society.
inferredcites →https://doi.org/10.1111/j.2517-6161.1972.tb00910.xopenalex-snapshot
Order Invariant Methods for Data Analysis
inferredcites →https://doi.org/10.1137/0206055openalex-snapshot
Generating Binary Trees Lexicographically
inferredcites →https://doi.org/10.1137/0207034openalex-snapshot
Generating t -Ary Trees Lexicographically
inferredcites →https://doi.org/10.1137/0207039openalex-snapshot
Ranking and Listing Algorithms for k -Ary Trees
inferredcites →https://doi.org/10.1137/0208006openalex-snapshot
Generating Trees and Other Combinatorial Objects Lexicographically
inferredcites →https://doi.org/10.1137/0209055openalex-snapshot
Constant Time Generation of Rooted Trees
inferredcites →https://doi.org/10.1145/322077.322082openalex-snapshot
Generation of Binary Trees from Ballot Sequences
inferredcites →https://doi.org/10.1145/322169.322170openalex-snapshot
On the Generation of Binary Trees
inferredcites →https://doi.org/10.1145/322169.322171openalex-snapshot
A Note on Enumerating Binary Trees
inferredcites →https://doi.org/10.1145/359423.359434openalex-snapshot
A numbering system for binary trees
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/clad.1993.1004openalex-snapshot
ON DESCRIBING THE SHAPE OF ROOTED AND UNROOTED TREES
inferred← citeshttps://doi.org/10.1007/978-1-4020-2330-9_23openalex-snapshot
Detecting Diversification Rate Variation in Supertrees
inferred← citeshttps://doi.org/10.1007/978-3-030-15843-9_1openalex-snapshot
Improved Variable Neighbourhood Search Heuristic for Quartet Clustering
inferred← citeshttps://doi.org/10.1007/978-3-319-38782-6_16openalex-snapshot
Mean Values of Gene Duplication and Loss Cost Functions
inferred← citeshttps://doi.org/10.1007/978-3-319-59575-7_21openalex-snapshot
Phylogenetic Tree Reconciliation: Mean Values for Fixed Gene Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-59789-3_20openalex-snapshot
A General Approach to Test the Pertinence of a Consensus Classification
inferred← citeshttps://doi.org/10.1007/978-4-431-65950-1_6openalex-snapshot
How to validate phylogenetic trees? A stepwise procedure
inferred← citeshttps://doi.org/10.1007/bf01908600openalex-snapshot
Fast random generation of binary, t-ary and other types of trees
inferred← citeshttps://doi.org/10.1007/bf02306021openalex-snapshot
The Estimation of Ultrametric and Path Length Trees from Rectangular Proximity Data
inferred← citeshttps://doi.org/10.1007/bf02616238openalex-snapshot
The generation of random ultrametric matrices representing dendrograms
inferred← citeshttps://doi.org/10.1007/bf03040858openalex-snapshot
Comparison tests for dendrograms: A comparative evaluation
inferred← citeshttps://doi.org/10.1007/s10288-011-0187-3openalex-snapshot
The development and application of metaheuristics for problems in graph theory: a computational study
inferred← citeshttps://doi.org/10.1007/s10288-018-0394-2openalex-snapshot
An exact algorithm for the minimum quartet tree cost problem
inferred← citeshttps://doi.org/10.1007/s10898-019-00871-1openalex-snapshot
Improved metaheuristics for the quartet method of hierarchical clustering
inferred← citeshttps://doi.org/10.1007/s10994-018-5733-1openalex-snapshot
On the effectiveness of heuristics for learning nested dichotomies: an empirical analysis
inferred← citeshttps://doi.org/10.1016/0167-8655(89)90091-3openalex-snapshot
Lexicographic generation of binary unordered trees
inferred← citeshttps://doi.org/10.1016/0167-9473(96)88919-5openalex-snapshot
Probabilistic models in cluster analysis
inferred← citeshttps://doi.org/10.1016/j.dam.2014.02.010openalex-snapshot
Mean deep coalescence cost under exchangeable probability distributions
inferred← citeshttps://doi.org/10.1016/j.dam.2020.11.021openalex-snapshot
On the Colijn–Plazzotta numbering scheme for unlabeled binary rooted trees
inferred← citeshttps://doi.org/10.1016/j.endm.2014.11.003openalex-snapshot
A VNS-based quartet algorithm for biomedical literature clustering
inferred← citeshttps://doi.org/10.1016/j.jcta.2016.10.003openalex-snapshot
On the enumeration of tanglegrams and tangled chains
inferred← citeshttps://doi.org/10.1016/s0020-0255(98)10080-4openalex-snapshot
Generating random binary trees — A survey
inferred← citeshttps://doi.org/10.1017/s0094837300016778openalex-snapshot
Maximum likelihood estimation of phylogeny using stratigraphic data
inferred← citeshttps://doi.org/10.1080/00949650008812035openalex-snapshot
Comparison of permutation methods for the partial correlation and partial mantel tests
inferred← citeshttps://doi.org/10.1080/00949659908811936openalex-snapshot
An empirical comparison of permutation methods for tests of partial regression coefficients in a linear model
inferred← citeshttps://doi.org/10.1080/106351501753328776openalex-snapshot
Random Sampling of Constrained Phylogenies: Conducting Phylogenetic Analyses When the Phylogeny Is Partially Known
inferred← citeshttps://doi.org/10.1080/10635150215881openalex-snapshot
Whole-Tree Methods for Detecting Differential Diversification Rates
inferred← citeshttps://doi.org/10.1086/419657openalex-snapshot
Inferring Evolutionary Process from Phylogenetic Tree Shape
inferred← citeshttps://doi.org/10.1088/0031-8949/86/02/025006openalex-snapshot
Scale-free tree graphs are more symmetrical
inferred← citeshttps://doi.org/10.1089/cmb.2014.0021openalex-snapshot
Are the Duplication Cost and Robinson-Foulds Distance Equivalent?
inferred← citeshttps://doi.org/10.1093/bioinformatics/btm500openalex-snapshot
A congruence index for testing topological similarity between trees
inferred← citeshttps://doi.org/10.1093/sysbio/40.1.54openalex-snapshot
Random Dendrograms and Null Hypotheses in Cladistic Biogeography
inferred← citeshttps://doi.org/10.1093/sysbio/syad075openalex-snapshot
The Limits of the Constant-rate Birth–Death Prior for Phylogenetic Tree Topology Inference
inferred← citeshttps://doi.org/10.1093/sysbio/syq086openalex-snapshot
Consequences of Different Null Models on the Tree Shape Bias of Supertree Methods
inferred← citeshttps://doi.org/10.1093/sysbio/syx046openalex-snapshot
A Metric on Phylogenetic Tree Shapes
inferred← citeshttps://doi.org/10.1098/rstb.2023.0303openalex-snapshot
Tree balance in phylogenetic models
inferred← citeshttps://doi.org/10.1109/icsmc.2009.5346732openalex-snapshot
Forecasting electronic industry EPS using an integrated ANFIS model
inferred← citeshttps://doi.org/10.1109/tcbb.2012.133openalex-snapshot
Mathematical Properties of the Deep Coalescence Cost
inferred← citeshttps://doi.org/10.1109/tcbb.2013.109openalex-snapshot
Computing the Joint Distribution of Tree Shape and Tree Distance for Gene Tree Inference and Recombination Detection
inferred← citeshttps://doi.org/10.1109/tcbb.2013.123openalex-snapshot
Coalescent Histories for Caterpillar-Like Families
inferred← citeshttps://doi.org/10.1109/tkde.2009.188openalex-snapshot
Heuristic Approaches for the Quartet Method of Hierarchical Clustering
inferred← citeshttps://doi.org/10.1111/itor.12240openalex-snapshot
A quartet method based on variable neighborhood search for biomedical literature extraction and clustering
inferred← citeshttps://doi.org/10.1111/j.1420-9101.2007.01340.xopenalex-snapshot
When can host shifts produce congruent host and parasite phylogenies? A simulation approach
inferred← citeshttps://doi.org/10.1111/j.1558-5646.1991.tb04385.xopenalex-snapshot
NULL MODELS FOR THE NUMBER OF EVOLUTIONARY STEPS IN A CHARACTER ON A PHYLOGENETIC TREE
inferred← citeshttps://doi.org/10.1111/j.1558-5646.1993.tb02144.xopenalex-snapshot
SEARCHING FOR EVOLUTIONARY PATTERNS IN THE SHAPE OF A PHYLOGENETIC TREE
inferred← citeshttps://doi.org/10.1111/j.1558-5646.1994.tb02191.xopenalex-snapshot
MODELING BRAIN EVOLUTION FROM BEHAVIOR: A PERMUTATIONAL REGRESSION APPROACH
inferred← citeshttps://doi.org/10.1111/j.1558-5646.1996.tb03915.xopenalex-snapshot
DO PHYLOGENETIC METHODS PRODUCE TREES WITH BIASED SHAPES?
inferred← citeshttps://doi.org/10.1111/j.1558-5646.1996.tb04468.xopenalex-snapshot
CONDUCTING PHYLOGENETIC COMPARATIVE STUDIES WHEN THE PHYLOGENY IS NOT KNOWN
inferred← citeshttps://doi.org/10.1186/s12859-015-0640-yopenalex-snapshot
The unifrac significance test is sensitive to tree topology
inferred← citeshttps://doi.org/10.1371/journal.pone.0105818openalex-snapshot
Evaluation of an Integrated Framework for Biodiversity with a New Metric for Functional Dispersion
inferred← citeshttps://doi.org/10.2307/2981629openalex-snapshot
A Review of Hierarchical Classification
inferred← citeshttps://doi.org/10.4238/gmr18433openalex-snapshot
Research Article Large number of taxa used to estimate a rooted species tree with the ABC method from an unrooted gene tree
inferred← citeshttps://doi.org/10.46298/dmtcs.6348openalex-snapshot
On trees, tanglegrams, and tangled chains
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.