algo-dfa-matching

SKILLWorkflowCommunity
v0.0.0Pavel-KravchenkoUnknownAktualisiert vor 1 Mon.Quelle →

Build a DFA transition table via the KMP prefix function, then scan text in O(n) with zero backtracking. Use when repeatedly searching one fixed pattern (motif, restriction site, primer) against many sequences or texts.

Community-submitted skill. Not yet reviewed by the Forge team. Full prompt content may not be available.Request review →
4Repo-Sterne
1Clients
1Formate
vor 1 Mon.Letzte Aktualisierung
Skill
AutorPavel-Kravchenko
Version0.0.0
LizenzUnknown
KategorieWorkflow
Formateskill.md
PromptNicht veröffentlicht
Kompatibilität
Claude✓ Unterstützt
Cursor—
Copilot—
ChatGPT—
Gemini—
Über

Build a DFA transition table via the KMP prefix function, then scan text in O(n) with zero backtracking. Use when repeatedly searching one fixed pattern (motif, restriction site, primer) against many sequences or texts.

Schlagwörter
skillclaude