OpenParable
Skip to content
← Back to skills

Suffix Structure Builder

Development
suffix-structure-builder

Suffix Structure Builder is an Agent Skill for development published in the a5c-ai/babysitter repository on GitHub: a SKILL.md instruction file an AI agent can load to do this task.

Build and query suffix arrays and related structures

View on GitHub ↗
QUICK START

How to use this skill

Bring this guide into your coding agent with a prompt tailored to the tool you use.

  1. Open your project in Codex.
  2. Copy and paste the prompt below.
  3. Review files and risks before approving any action.
Prompt to paste
Inspect the Agent Skill at https://github.com/a5c-ai/babysitter/blob/HEAD/library/specializations/algorithms-optimization/skills/suffix-structure-builder/SKILL.md and all supporting files. Report provenance, permissions, scripts, dependencies, and security risks. Propose an exact installation into .agents/skills/suffix-structure-builder, but wait for my approval before writing files or running scripts.

Copying this prompt does not install or run the skill. Review third-party files before use.

Suffix Structure Builder Skill

Purpose

Build suffix arrays, suffix trees, and related structures with efficient construction algorithms and common query implementations.

Capabilities

  • Suffix array construction (SA-IS, DC3)
  • LCP array construction
  • Suffix tree construction
  • Suffix automaton construction
  • Query implementations for each structure
  • Sparse table for LCP queries

Target Processes

  • trie-suffix-structures
  • pattern-matching-algorithms
  • string-processing

Suffix Structures

Suffix Array

  • O(n log n) or O(n) construction
  • Combined with LCP for powerful queries
  • Pattern matching in O(m log n)

LCP Array

  • Kasai's algorithm O(n)
  • Range minimum queries for LCA
  • Distinct substring counting

Suffix Tree

  • Ukkonen's algorithm O(n)
  • More complex but powerful
  • Direct pattern matching O(m)

Suffix Automaton

  • O(n) construction
  • Smallest automaton for all substrings
  • Powerful for counting problems

Input Schema

{
  "type": "object",
  "properties": {
    "structure": {
      "type": "string",
      "enum": ["suffixArray", "lcpArray", "suffixTree", "suffixAutomaton"]
    },
    "algorithm": { "type": "string" },
    "queries": { "type": "array" },
    "language": {
      "type": "string",
      "enum": ["cpp", "python", "java"]
    }
  },
  "required": ["structure"]
}

Output Schema

{
  "type": "object",
  "properties": {
    "success": { "type": "boolean" },
    "code": { "type": "string" },
    "complexity": { "type": "object" },
    "queryImplementations": { "type": "array" }
  },
  "required": ["success", "code"]
}