AnythingOnline

Research data

Newick leaf distance matrix

Sum supplied branch lengths between named leaves and export a CSV matrix.

Your inputs

Start with an example

Your inputs stay in your browser.

Your result

Example result

How it works

Find each leaf pair’s common ancestor and sum the branches along their connecting path. Ignore an optional branch above the root.

The sample gives A–B = 1+4+2 = 7, A–C = 8 and B–C = 5.

Limits

At most 64 uniquely named leaves. Every non-root branch needs an explicit length; no unit weights are invented. Values use JavaScript numbers and imply no dates or evolutionary model.