On the public citation graph

An optimal algorithm to reconstruct trees from additive distance data

0 signed · 46 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1016/0022-5193(77)90351-4openalex-snapshot
Additive evolutionary trees
inferredcites →https://doi.org/10.1137/0144075openalex-snapshot
Comparing Trees with Pendant Vertices Labelled

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/jagm.1996.0035openalex-snapshot
Determining the Evolutionary Tree Using Experiments
inferred← citeshttps://doi.org/10.1007/3-540-48481-7_22openalex-snapshot
On the Informational Asymmetry between Upper and Lower Bounds for Ultrametric Evolutionary Trees
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_265openalex-snapshot
Tree reconstruction from partial orders
inferred← citeshttps://doi.org/10.1007/3-540-62592-5_81openalex-snapshot
Tree contractions and evolutionary trees
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_115openalex-snapshot
Distance-Based Phylogeny Reconstruction: Safety and Edge Radius
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_292openalex-snapshot
Phylogenetic Tree Construction from a Distance Matrix
inferred← citeshttps://doi.org/10.1007/978-3-319-07890-8_30openalex-snapshot
Finding Centers and Medians of a Tree by Distance Queries
inferred← citeshttps://doi.org/10.1007/978-3-540-75225-7_24openalex-snapshot
Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_115-2openalex-snapshot
Distance-Based Phylogeny Reconstruction: Safety and Edge Radius
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_292-2openalex-snapshot
Phylogenetic Tree Construction from a Distance Matrix
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_62openalex-snapshot
Graph Reconstruction via Distance Oracles
inferred← citeshttps://doi.org/10.1007/978-3-642-40935-6_14openalex-snapshot
Learning a Bounded-Degree Tree Using Separator Queries
inferred← citeshttps://doi.org/10.1007/978-3-642-59789-3_23openalex-snapshot
Estimating Missing Values in a Tree Distance
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_63openalex-snapshot
Near-Linear Query Complexity for Graph Inference
inferred← citeshttps://doi.org/10.1007/s00500-005-0507-7openalex-snapshot
Maximal sub-triangulation in pre-processing phylogenetic data
inferred← citeshttps://doi.org/10.1016/0895-7177(92)90166-iopenalex-snapshot
A bibliography on computational molecular biology and genetics
inferred← citeshttps://doi.org/10.1016/j.dam.2015.06.035openalex-snapshot
Reconstructing Markov processes from independent and anonymous experiments
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.08.013openalex-snapshot
On the longest path algorithm for reconstructing trees from distance matrices
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.01.006openalex-snapshot
Reconstruction and verification of chordal graphs with a distance oracle
inferred← citeshttps://doi.org/10.1051/ro:2001115openalex-snapshot
The triangles method to buildX-trees from incomplete distance matrices
inferred← citeshttps://doi.org/10.1089/106652701446170openalex-snapshot
Comparison of Additive Trees Using Circular Orders
inferred← citeshttps://doi.org/10.1093/bioinformatics/16.7.619openalex-snapshot
Using traveling salesman problem algorithms for evolutionary tree construction
inferred← citeshttps://doi.org/10.1093/oxfordjournals.molbev.a040209openalex-snapshot
Estimating Phylogenies from Lacunose Distance Matrices, with Special Reference to DNA Hybridization Data
inferred← citeshttps://doi.org/10.1109/allerton.2019.8919924openalex-snapshot
Reconstructing a Bounded-Degree Directed Tree Using Path Queries
inferred← citeshttps://doi.org/10.1109/allerton49937.2022.9929414openalex-snapshot
On Learning a Hidden Directed Graph with Path Queries
inferred← citeshttps://doi.org/10.1109/infcom.2012.6195532openalex-snapshot
Robust multi-source network tomography using selective probes
inferred← citeshttps://doi.org/10.1109/itcc.2005.22openalex-snapshot
A new phylogenetic tree model for fuzzy characters
inferred← citeshttps://doi.org/10.1111/nmo.12134openalex-snapshot
Beyond phylotyping: understanding the impact of gut microbiota on host biology
inferred← citeshttps://doi.org/10.1137/s0097539793252195openalex-snapshot
Tree Reconstruction from Partial Orders
inferred← citeshttps://doi.org/10.1137/s0097539795283504openalex-snapshot
Tree Contractions and Evolutionary Trees
inferred← citeshttps://doi.org/10.1145/167088.167132openalex-snapshot
A robust model for finding optimal evolutionary trees
inferred← citeshttps://doi.org/10.1145/3199606openalex-snapshot
Graph Reconstruction and Verification
inferred← citeshttps://doi.org/10.1201/9780203497289-9openalex-snapshot
Shortest-Paths Trees
inferred← citeshttps://doi.org/10.1504/ijcnds.2014.059439openalex-snapshot
Tree topology inference from leaf-to-leaf path lengths using Prüfer sequence
inferred← citeshttps://doi.org/10.23638/dmtcs-20-1-9openalex-snapshot
Non-adaptive Group Testing on Graphs
inferred← citeshttps://doi.org/10.4000/msh.11751openalex-snapshot
About the largest subtree common to several X-trees
inferred← citeshttps://doi.org/10.4230/lipics.esa.2020.3openalex-snapshot
Reconstructing Biological and Digital Phylogenetic Trees in Parallel
inferred← citeshttps://doi.org/10.48550/arxiv.1201.3793openalex-snapshot
Finding Weighted Graphs by Combinatorial Search
inferred← citeshttps://doi.org/10.48550/arxiv.1303.5803openalex-snapshot
Efficient Online Algorithmic Strategies for Several Two-Player Games with Different or Identical Player Roles
inferred← citeshttps://doi.org/10.48550/arxiv.1902.08742openalex-snapshot
Optimal Algorithm to Reconstruct a Tree from a Subtree Distance
inferred← citeshttps://doi.org/10.48550/arxiv.2112.04549openalex-snapshot
A Simple Algorithm for Graph Reconstruction
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0101030openalex-snapshot
Tree Contractions and Evolutionary Trees
inferred← citeshttps://doi.org/10.5555/644108.644179openalex-snapshot
On the complexity of distance-based evolutionary tree reconstruction
inferred← citeshttps://doi.org/10.5860/choice.42-1619aopenalex-snapshot
Spanning trees and optimization problems
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.