On the public citation graph
An algorithm to equiprobably generate all directed trees withk labeled terminal nodes and unlabeled interior nodes
0 signed · 35 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/978-1-4757-2739-5_10openalex-snapshot
Reconstruction of Evolutionary Trees
inferredcites →https://doi.org/10.1007/978-3-319-44543-4openalex-snapshot
On Maximal Chain Subgraphs and Covers of Bipartite Graphs.
inferredcites →https://doi.org/10.1007/978-3-642-69024-2_20openalex-snapshot
Sampling Distribution of Consensus Indices when All Bifurcating Trees are Equally Likely
inferredcites →https://doi.org/10.1007/bf02459385openalex-snapshot
Numbering binary trees with labeled terminal vertices
inferredcites →https://doi.org/10.1007/bfb0091818openalex-snapshot
Critical link identification in a network
inferredcites →https://doi.org/10.1007/bfb0091819openalex-snapshot
Enumeration of binary phylogenetic trees
inferredcites →https://doi.org/10.1016/0041-5553(71)90158-3openalex-snapshot
The art of computer programming
inferredcites →https://doi.org/10.1017/9781316276259.003openalex-snapshot
Reconstruction of evolutionary trees
inferredcites →https://doi.org/10.1038/297197a0openalex-snapshot
Testing the theory of evolution by comparing phylogenetic trees constructed from five different protein sequences
inferredcites →https://doi.org/10.1093/sysbio/30.3.309openalex-snapshot
Taxonomic Congruence in the Leptopodomorpha Re-examined
inferredcites →https://doi.org/10.1093/sysbio/30.3.331openalex-snapshot
Methods for Investigating Taxonomie Congruence and their Application to the Leptopodomorpha
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
inferredcites →https://doi.org/10.2307/2413252openalex-snapshot
Taxonomic Congruence in the Leptopodomorpha Re-Examined
inferredcites →https://doi.org/10.2307/2413254openalex-snapshot
Methods for Investigating Taxonomic Congruence and their Application to the Leptopodomorpha
inferredcites →https://doi.org/10.26661/2413-6549openalex-snapshot
Computer Science and Applied Mathematics
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
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/bf01890123openalex-snapshot
The generation of random, binary unordered trees
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/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/s00285-009-0295-2openalex-snapshot
Nodal distances for rooted phylogenetic trees
inferred← citeshttps://doi.org/10.1016/j.aml.2009.03.003openalex-snapshot
An algebraic metric for phylogenetic trees
inferred← citeshttps://doi.org/10.1016/s0020-0255(98)10080-4openalex-snapshot
Generating random binary trees — A survey
inferred← citeshttps://doi.org/10.1080/106351598261021openalex-snapshot
Large-Scale Phylogenies and Measuring the Performance of Phylogenetic Estimators
inferred← citeshttps://doi.org/10.1093/sysbio/35.3.325openalex-snapshot
Analysis of Quartet Dissimilarity Measures Between Undirected Phylogenetic Trees
inferred← citeshttps://doi.org/10.1093/sysbio/42.2.126openalex-snapshot
Distributions of Tree Comparison Metrics--Some New Results
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.1186/1471-2105-12-204openalex-snapshot
Tree edit distance for leaf-labelled trees on free leafset and its comparison with frequent subsplit dissimilarity and popular distance measures
inferred← citeshttps://doi.org/10.1371/journal.pone.0203401openalex-snapshot
Sound Colless-like balance indices for multifurcating trees
inferred← citeshttps://doi.org/10.2307/2981629openalex-snapshot
A Review of Hierarchical Classification
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.