Guide exact string-matching algorithm selection with CLRS-style cost analysis.
npx skills add https://github.com/Arcadi4/nerdy --skill string-matching
Please help me install this Agent Skill. Skill: string-matching Source: https://github.com/Arcadi4/nerdy/tree/main/clrs/string-matching Command: npx skills add https://github.com/Arcadi4/nerdy --skill string-matching
String matching problems determine whether a pattern occurs within a text and guide the choice of algorithm to balance correctness and performance across workloads.
Describe your workload and ask for the recommended exact string-matching method to apply.
High-intent search queries and answers about installing and using this skill.
For overlapping pattern matches, the Knuth-Morris-Pratt algorithm and finite-automata approaches are recommended. They use prefix functions or transition tables to correctly handle overlaps, providing rigorous CLRS-style cost analysis for exact string matching tasks.
Rabin-Karp uses rolling hashes for substring search, making it efficient for multiple pattern matching, while KMP uses a prefix function to avoid redundant comparisons. The choice depends on your workload and whether you need hash-based matching or deterministic finite-automata processing.
You need suffix arrays and LCP arrays for advanced string processing tasks like querying repeated substrings or performing Burrows-Wheeler transforms. These structures enable efficient structure queries beyond basic exact matching, supporting rigorous correctness proofs and cost analysis.
Finite-automata string matching complexity is calculated by analyzing transition table construction and matching phases. The guidance prescribes CLRS-style formatting with display math costs, ensuring explicit handling of automata states and transitions for rigorous performance evaluation.
Naive matching is inefficient for large texts with overlapping patterns due to redundant character comparisons. For exact string matching in workloads with overlaps, KMP or finite-automata methods are recommended to optimize correctness and performance.
The Burrows-Wheeler transform is used in exact string matching workflows to enable efficient backward search and compression. It integrates with suffix arrays to support advanced structure queries, providing a rigorous foundation for complex pattern-search tasks.
piusnForecast infrastructure capacity and generate a management-ready capacity plan document.
truongnatDesign algorithms with formal modeling, strategy selection, and complexity analysis.
KaiserWhoLearnsDescribe syzlang ioctl syntax and type patterns for Linux fuzzing.
hung-phanDesign search typeahead services with prefix lookup, personalization, and typo tolerance.
