HALOWERKDatenvertragswerk
rooted triplet tree family
For1..4 taxonlabels0..n-1 and up to12positive rootedtriplets[a,b,c] witha<b andallthreedistinct, construct ALL fullbinaryrootedtrees displaying everyab|c: lca(a,b)strictlybelow lca(a,c)=lca(b,c). Tripletorder/duplicates irrelevant. Everytaxon occursonce; siblingorderidentified byplacingchildwithsmallerminimumtaxonfirst. Return wholelexicographicNewickfamily(no lengths,terminalsemicolon), eachtree internalclusterbitmasks sortednumerically includingrootforn>1 andexcludingallleafsingletons,.
POST https://datenvertrag.halowerk.com/v1/rooted-triplet-tree-familyEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| taxa | Siehe Schema | Ja | |
| triplets | Siehe Schema | Ja | |
| claim | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"$schema": "http://json-schema.org/draft-07/schema#",
"type": "object",
"additionalProperties": false,
"required": [
"taxa",
"triplets",
"claim"
],
"properties": {
"taxa": {
"anyOf": [
{
"type": "integer",
"minimum": 1,
"maximum": 4
},
{
"type": "null"
}
]
},
"triplets": {
"anyOf": [
{
"type": "array",
"maxItems": 12,
"items": {
"type": "array",
"maxItems": 3,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 3
}
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "array",
"maxItems": 15,
"items": {
"type": "string",
"minLength": 2,
"maxLength": 20,
"pattern": "^[0-3(),;]+$"
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"taxa": 3,
"triplets": [
[
0,
1,
2
]
],
"claim": [
"((0,1),2);"
]
}Ergebnis & Dokumentation
Maschinenlesbare Dokumentation dieses Hubs
Quelle dieser Seite: der veröffentlichte HALOWERK-Katalog. Stand: 2026-11-07, 02:42 UTC.
Weitere Endpunkte dieses Hubs
- Datenvertragswerk0,003 USDC
adjacency cospectral graph family
POSThttps://datenvertrag.halowerk.com/v1/adjacency-cospectral-graph-familyGiven n1..5 and a monic degree-n integer polynomial det(xI-A), return EVERY labelled simple undirected graph on vertices0..n-1 having exactly that adjacency characteristic polynomial over integers. Coefficients are descending degree order,
- Datenvertragswerk0,003 USDC
adjacent swap permutation tour
POSThttps://datenvertrag.halowerk.com/v1/adjacent-swap-permutation-tourFor 0 to 5 labels starting at zero, construct the whole Steinhaus-Johnson-Trotter permutation tour from identity. Each transition swaps the largest mobile value with its adjacent smaller neighbor, then reverses directions of greater values.
- Datenvertragswerk0,003 USDC
aligned record cut audit
POSThttps://datenvertrag.halowerk.com/v1/aligned-record-cut-auditA stream-runtime fixture maintainer checks which record IDs belong to a supplied aligned checkpoint cut and which same-channel post-barrier records must stay buffered until all input barriers arrive. One aligned local checkpoint;record iden