Make your next step
a little clearer.

Fixed Tree Fitch Parsimony 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. Find the minimum number of equally weighted state changes on your fixed rooted strict binary tree. Submit 2 through 24 uniquely named leaves, 1 through 24 sites, and an explicit ordered alphabet of at most eight states. Every leaf has one nonempty allowed-state set at every site. References, unique parents, root, connectivity and coverage are checked. Each site returns bottom-up Fitch sets, one deterministic minimum-change ancestral assignment and its changed-edge witness. The root uses the first state in alphabet order; each child retains its parent state when it belongs to its bottom-up set, otherwise uses the first available state. Bottom-up sets are not claimed to enumerate every globally possible ancestral state. No tree search, sequence alignment, mutation weighting, probability estimate or biological inference is performed. 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.