arXiv (All)
open access
Boyer-Moore Variants for Indeterminate String Matching and Experimental Evaluation
We study exact pattern matching on indeterminate strings, where a text or pattern position may represent a set of symbols rather than a single letter. Focusing on Boyer-Moore-style methods, we present new bad-character rules (BC Rules I-IV) and a new good-suffix procedure, computed by Fast_GSR_Indet
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- An incomplex algorithm for fast suffix array construction#492663
- Involutions avoiding 4321 and another pattern of length four#1145119
- A Fast-Fourier-Transform-Based Dynamic Likelihood Ratio Framework for Controlling False Positives in DNA Database Matching.#236121
- Generalizable multilingual medical text anonymization using generative instruction tuning.#1158807
- On the construction of universal families of hash functions via geometric codes and concatenation#612900
Record · ID 1063381
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive