Home▸Bioinformatics▸Neighbor-Joining Phylogenetic Tree Builder (2D)

Neighbor-Joining Phylogenetic Tree Builder (2D)

A 2D radial phylogenetic tree builder: watch the real neighbor-joining algorithm compute the Q-criterion over a live distance matrix and grow a flat radial tree join by join, with pan and zoom over the canvas.

Bioinformatics2DAdvanced60 FPS📱 Mobile-adapted⇄ 3D version
2d-phylogenetics ↗ Open standalone

Phylogenetic trees are reconstructed from measurable distances between species — genetic divergence, morphological difference, or any other dissimilarity score — not observed directly. This 2D sibling runs the same real neighbor-joining algorithm as the 3D version on a live distance matrix: at each step it computes the Q-criterion across every pair of active lineages, joins the pair that minimizes it, derives the two branch lengths from the row-sum formula, and folds the new ancestral node back into the matrix for the next round. The result grows as a flat radial tree diagram you can pan and zoom, with the taxa you set spinning out along evolving branches until a single root remains, exactly as a real molecular phylogenetics pipeline would build a tree from sequence-distance data.

⚙ Under the hood

A 2D radial phylogenetic tree builder: watch the real neighbor-joining algorithm compute the Q-criterion over a live distance matrix and grow a flat radial tree join by join, with drag-to-pan and scroll-to-zoom over the canvas.

phylogeneticsbioinformaticsevolutionary-treealgorithmsneighbor-joiningmolecular-biology

2D · HTML5 Canvas 2D · 60 FPS target · runs fully client-side, no install

What did you find?

Add reproduction steps (optional)