On the public citation graph
Neighbor Joining Algorithms for Inferring Phylogenies via LCA Distances
0 signed · 49 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.1002/(sici)1098-2418(199903)14:2<153::aid-rsa3>3.0.co;2-ropenalex-snapshot
A few logs suffice to build (almost) all trees (I)
inferredcites →https://doi.org/10.1006/jagm.1996.0035openalex-snapshot
Determining the Evolutionary Tree Using Experiments
inferredcites →https://doi.org/10.1007/11732990_24openalex-snapshot
Maximal Accurate Forests from Distance Matrices
inferredcites →https://doi.org/10.1007/3-540-48224-5_12openalex-snapshot
The Complexity of Constructing Evolutionary Trees Using Experiments
inferredcites →https://doi.org/10.1007/bf01188585openalex-snapshot
A robust model for finding optimal evolutionary trees
inferredcites →https://doi.org/10.1007/bf01734359openalex-snapshot
Evolutionary trees from DNA sequences: A maximum likelihood approach
inferredcites →https://doi.org/10.1007/bf02458863openalex-snapshot
Computational complexity of inferring phylogenies from dissimilarity matrices
inferredcites →https://doi.org/10.1007/pl00008277openalex-snapshot
The Performance of Neighbor-Joining Methods of Phylogenetic Reconstruction
inferredcites →https://doi.org/10.1007/s00357-005-0003-xopenalex-snapshot
On the Uniqueness of the Selection Criterion in Neighbor-Joining
inferredcites →https://doi.org/10.1016/0020-0190(88)90090-7openalex-snapshot
The complexity of ultrametric partitions on graphs
inferredcites →https://doi.org/10.1016/0020-0190(89)90216-0openalex-snapshot
A fast algorithm for constructing trees from distance matrices
inferredcites →https://doi.org/10.1016/0022-5193(77)90351-4openalex-snapshot
Additive evolutionary trees
inferredcites →https://doi.org/10.1016/j.ejc.2003.08.003openalex-snapshot
Low dimensional embeddings of ultrametrics
inferredcites →https://doi.org/10.1016/j.ipl.2007.07.002openalex-snapshot
Optimal implementations of UPGMA and other common clustering algorithms
inferredcites →https://doi.org/10.1016/s0092-8240(87)80007-1openalex-snapshot
Computational complexity of inferring phylogenies from dissimilarity matrices
inferredcites →https://doi.org/10.1016/s0304-3975(99)00028-6openalex-snapshot
A few logs suffice to build (almost) all trees: Part II
inferredcites →https://doi.org/10.1089/106652702761034136openalex-snapshot
Fast and Accurate Phylogeny Reconstruction Algorithms Based on the Minimum-Evolution Principle
inferredcites →https://doi.org/10.1089/106652799318337openalex-snapshot
Disk-Covering, a Fast-Converging Method for Phylogenetic Tree Reconstruction
inferredcites →https://doi.org/10.1090/s0002-9947-03-03382-8openalex-snapshot
Phase transitions in phylogeny
inferredcites →https://doi.org/10.1093/molbev/msj059openalex-snapshot
Beyond Pairwise Distances: Neighbor-Joining with Phylogenetic Diversity Estimates
inferredcites →https://doi.org/10.1093/oxfordjournals.molbev.a004019openalex-snapshot
Improvement of Distance-Based Phylogenetic Methods by a Local Maximum Likelihood Approach Using Triplets
inferredcites →https://doi.org/10.1093/oxfordjournals.molbev.a025808openalex-snapshot
BIONJ: an improved version of the NJ algorithm based on a simple model of sequence data
inferredcites →https://doi.org/10.1093/oxfordjournals.molbev.a026231openalex-snapshot
Weighted Neighbor Joining: A Likelihood-Based Approach to Distance-Based Phylogeny Reconstruction
inferredcites →https://doi.org/10.1093/oxfordjournals.molbev.a026423openalex-snapshot
NJML: A Hybrid Algorithm for the Neighbor-Joining and Maximum-Likelihood Methods
inferredcites →https://doi.org/10.1093/oxfordjournals.molbev.a040454openalex-snapshot
The neighbor-joining method: a new method for reconstructing phylogenetic trees.
inferredcites →https://doi.org/10.1093/oxfordjournals.molbev.a040527openalex-snapshot
A note on the neighbor-joining algorithm of Saitou and Nei.
inferredcites →https://doi.org/10.1093/sysbio/22.3.250openalex-snapshot
A Probability Model for Inferring Evolutionary Trees
inferredcites →https://doi.org/10.1137/s0097539795296334openalex-snapshot
On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics)
inferredcites →https://doi.org/10.1145/299432.299457openalex-snapshot
Faster reliable phylogenetic analysis
inferredcites →https://doi.org/10.2307/2412305openalex-snapshot
A Probability Model for Inferring Evolutionary Trees
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/bip.22093openalex-snapshot
Application of principal component analysis to determine the key structural features contributing to iron superoxide dismutase thermostability
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-3-642-27848-8_115-2openalex-snapshot
Distance-Based Phylogeny Reconstruction: Safety and Edge Radius
inferred← citeshttps://doi.org/10.1016/j.ipl.2007.07.002openalex-snapshot
Optimal implementations of UPGMA and other common clustering algorithms
inferred← citeshttps://doi.org/10.1016/j.jtbi.2009.05.028openalex-snapshot
Towards optimal distance functions for stochastic substitution models
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.07.048openalex-snapshot
On the hardness of inferring phylogenies from triplet-dissimilarities
inferred← citeshttps://doi.org/10.1073/pnas.1710837114openalex-snapshot
Periodic production of retinoic acid by meiotic and somatic cells coordinates four transitions in mouse spermatogenesis
inferred← citeshttps://doi.org/10.1080/01621459.2016.1240081openalex-snapshot
Statistical Tests for Large Tree-Structured Data
inferred← citeshttps://doi.org/10.1080/15476286.2018.1514234openalex-snapshot
Cross-cleavage activity of Cas6b in crRNA processing of two different CRISPR-Cas systems in Methanosarcina mazei Gö1
inferred← citeshttps://doi.org/10.1098/rstb.2010.0026openalex-snapshot
Spermatogonial stem cell regulation and spermatogenesis
inferred← citeshttps://doi.org/10.1109/bmei.2011.6098605openalex-snapshot
Two new distance based methods for phylogenetic tree reconstruction
inferred← citeshttps://doi.org/10.1142/s0219720011005409openalex-snapshot
IDENTIFYING AND RECONSTRUCTING LATERAL TRANSFERS FROM DISTANCE MATRICES BY COMBINING THE MINIMUM CONTRADICTION METHOD AND NEIGHBOR-NET
inferred← citeshttps://doi.org/10.3390/d14060497openalex-snapshot
MolMarker: A Simple Tool for DNA Fingerprinting Studies and Polymorphic Information Content Calculation
inferred← citeshttps://doi.org/10.6026/97320630007251openalex-snapshot
Algorithm for large-scale clustering across multiple genomes
inferred← citeshttps://doi.org/10.64898/2026.07.30.739152openalex-snapshot
Scalable and robust phylogenetic tree reconstruction from copy-number data with Sparse Rooted Neighbor Joining
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.