algo-dfa-matching

SKILLWorkflowcommunauté
v0.0.0Pavel-KravchenkoUnknownMis à jour il y a 1 moisSource →

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 →
4Étoiles du dépôt
1Clients
1Formats
il y a 1 moisDernière mise à jour
Skill
AuteurPavel-Kravchenko
Version0.0.0
LicenceUnknown
CatégorieWorkflow
Formatsskill.md
PromptNon publié
Compatibilité
Claude✓ Pris en charge
Cursor—
Copilot—
ChatGPT—
Gemini—
À propos

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.

Mots-clés
skillclaude