algo-dfa-matching

SKILLFlusso di lavorocommunity
v0.0.0Pavel-KravchenkoUnknownAggiornato 1 mesi faFonte →

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 →
4Stelle del repo
1Client
1Formati
1 mesi faUltimo aggiornamento
Skill
AutorePavel-Kravchenko
Versione0.0.0
LicenzaUnknown
CategoriaFlusso di lavoro
Formatiskill.md
PromptNon pubblicato
Compatibilità
Claude✓ Supportato
Cursor—
Copilot—
ChatGPT—
Gemini—
Descrizione

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.

Parole chiave
skillclaude