Diplo-Strepto-Staphylo Arrangement Prefix Decoder
Decode the bacterial arrangement prefix separately from cell shape. Bounded exact-key educational reference only; observations and applicability must be established independently.
Description
Decode the bacterial arrangement prefix separately from cell shape.
Cell-arrangement prefixes describe grouping such as pairs, chains or clusters. A grouping term should remain distinct from a particular organism's taxonomic name.
When to use this tool
Decode the bacterial arrangement prefix separately from cell shape.
- Prepare the supplied key fields for this operation.
- Compare the complete example with the representation used by your own input before carrying the result into another step.
How to use the tool and how it works
- Enter key. Use the exact text syntax, units and index conventions explained below.
- Run the tool. If input validation fails, correct the supplied fields before interpreting any result.
- Read result.reference. Interpret false, null and empty lists using the distinctions below; they can be valid outputs.
Supply key exactly as one of "diplo", "strepto", "staphylo". Check for that own key in the fixed local table and return its stored reference text unchanged. An unsupported key is an input error, rather than a null result; there is no network request, fuzzy matching or dynamic text generation.1
| Input field | Meaning and representation | Accepted input |
|---|---|---|
| key | Exact stored-entry key; spelling and case must match. | "diplo", "strepto", "staphylo" |
| Output field | Interpretation |
|---|---|
| result | Object containing the named outputs below. |
| result.reference | The unchanged stored text for the supported exact key; unsupported keys cause an input error. |
{
"input": {
"key": "diplo"
},
"output": {
"result": {
"reference": "pairs"
}
}
}Limitations and assumptions
- The lookup expands one of its supported prefixes without inspecting microscopy. It does not identify an organism, validate a cell arrangement or parse arbitrary compound names.
- Every declared top-level field is required and unexpected fields are rejected. Numeric inputs must be finite; ordinary text fields are bounded to 8,192 UTF-16 code units, with tighter operation-specific limits where stated.
- Ordinary string lists have at most 128 entries of at most 128 code units each; numeric lists and matrices have separate bounded size checks. Nonfinite results and excessively large serialized outputs are rejected.
- Indexes are zero-based and spans have an exclusive end unless explicitly stated otherwise. A valid false, null or empty-list result is distinct from malformed input.
Alternative or Complementary methods
Retain specimen context, controls and independently observed features alongside a test label. Use a complete validated identification or analytical workflow when conclusions require several assays; a single stored morphology definition, feature flag or threshold comparison does not identify an organism.
References
Similar or alternative tools
- Flagella Arrangement Type Classifier (mono/lopho/amphi/peritrichous)
Decode a separately established flagellar arrangement; no microscopy inference or species assignment.
- acidfast ziehl neelsen classifier
Acid-Fast Ziehl-Neelsen Retention Result Classifier: return observation class, species identified.