Tree-of-life scale genomics
Tree-of-life–scale homology search built on object storage. Fast, accurate, 10× cheaper, and infinitely scalable.
Query execution
A staged cascade: cheapest, most-selective work first; exact proof last.
A query is not a scan. It descends through stages that each read only what the previous stage could not rule out, and no candidate is reported until it has been verified exactly.
- 01
Seed
Amino-acid k-mers select the candidate segments a query touches. Everything downstream operates on that reduced set; the rest of the release is never opened.
- 02
Prune & promote
Pruning descends from segments to granules to byte-range frames; postings are fetched only for survivors. What gets skipped is budgeted explicitly from block-impact upper bounds — a bounded decision, not a heuristic guess.
- 03
Verify
Promoted candidates are aligned exactly with Smith-Waterman. Only verified candidates are returned, each carrying the recall risk it closed and the objects it was computed from.
Rafflesia homology
Search biology at corpus scale.
Bring a corpus, a homology-search workload, or a recall-versus-cost problem. We’ll help you compile it into a release and serve it.