Make your next step
a little clearer.

Neighbor Joining Distance Tree API

Calculations use only the records you submit, with deterministic ties and exact results.

Calculations use only the records you submit, with deterministic ties and exact results. No external data is retrieved. Private JSON result retained for 30 days; USD 1.00 per one-time job. Rational values are reduced numerator/denominator decimal strings with a positive denominator; no floating-point approximation is used. Input distances are symmetric nonnegative integers at most 1000000 with a zero diagonal, for 2 through 16 unique IDs. IDs follow submitted order; ties compare the numeric leaf-index tuples of the active clusters, then the pair of clusters. Arithmetic is bounded to 2000000 counted operations and 512-bit integer intermediates. Construct a neighbor-joining tree by minimizing Q(i,j)=(m-2)d(i,j)-r(i)-r(j) at each stage with more than two active clusters, then connect the final two nodes. Each join reports active nodes, row sums, selected Q value, both limbs and every updated row distance. Return the edge list, fitted pair distances and residuals defined as fitted minus submitted distance. Negative limbs and reduced distances are preserved exactly, with negative edge indices identified; no clipping, best-tree guarantee or biological inference is provided. Two taxa return their single supplied-distance edge. Use authorized, non-sensitive data. The report describes supplied records and does not change external systems.

Agent API guide → · Website orders show the report on your private order page.

The complete checkout request must fit within 40,000 UTF-8 bytes. Your input is validated again before an order is created.