{"paper":{"title":"Heuristic Algorithm for Generalized Function Matching","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Radu Stefan Mincu","submitted_at":"2019-08-05T11:24:11Z","abstract_excerpt":"The problem of generalized function matching can be defined as follows: given a pattern $p=p_1 \\cdots p_m$ and a text $t=t_1 \\cdots t_n$, find a mapping $f:\\Sigma_p\\rightarrow\\Sigma_t^{*}$ and all text locations $i$ such that $f(p_1) f(p_2) \\cdots f(p_m) = t_i \\cdots t_j$, a substring of $t$.\n  By modifying the restrictions of the matching function $f$, one can obtain different matching problems, many of which have important applications. When $f:\\Sigma_p\\rightarrow\\Sigma_t$ we are faced with problems found in the well-established field of combinatorial pattern matching. If the single characte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.01562","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.01562/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}