suffix_tree
Construct a suffix tree from input text to count distinct substrings and identify the longest repeated substring for string analysis.
Instructions
Build a suffix tree (Ukkonen's algorithm) and compute distinct substrings and longest repeated substring.
Tool call template
Replace each placeholder with a value matching the input schema. Only required parameters are included; add optional parameters as needed.
{
"id": 1,
"jsonrpc": "2.0",
"method": "tools/call",
"params": {
"arguments": {
"text": "<text>"
},
"name": "suffix_tree"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| text | Yes | Input text (max 10,000 chars) |