summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authormzuenni <michi.zuendorf@gmail.com>2026-05-04 20:12:32 +0200
committermzuenni <michi.zuendorf@gmail.com>2026-05-04 20:12:32 +0200
commit78371d09155093cdad6548a8233bfaea86ecafb1 (patch)
tree03b3828cc612fdc763789760aa99095abd0ded35
parentfbd9bfb4c17cfaa60465da0df468f1171f8ff776 (diff)
fix wildcard matching
-rw-r--r--content/string/string.tex8
-rw-r--r--tcr.pdfbin701058 -> 701906 bytes
2 files changed, 4 insertions, 4 deletions
diff --git a/content/string/string.tex b/content/string/string.tex
index bedabfb..1c1c687 100644
--- a/content/string/string.tex
+++ b/content/string/string.tex
@@ -23,11 +23,11 @@
Gegeben zwei strings $A$ und $B$,$B$ enthält $k$ \emph{wildcards} enthält. Sei:
\begin{align*}
a_i&=\cos(\alpha_i) + i\sin(\alpha_i) &\text{ mit } \alpha_i&=\frac{2\pi A[i]}{\Sigma}\\
- b_i&=\cos(\beta_i) + i\sin(\beta_i) &\text{ mit } \beta_i&=\begin{cases*}
- \frac{2\pi B[\abs{B}-i-1]}{\Sigma} & falls $B[\abs{B}-i-1]\in\Sigma$ \\
+ b_i&=\begin{cases*}
+ \cos(\beta_i) - i\sin(\beta_i) & falls $B[\abs{B}-i-1]\in\Sigma$ \\
0 & sonst
- \end{cases*}
- \end{align*}
+ \end{cases*}&\text{ mit } \beta_i&=\frac{2\pi B[\abs{B}-i-1]}{\Sigma}
+ \end{align*}
$B$ matcht $A$ an stelle $i$ wenn $(b\cdot a)[|B|-1+i]=|B|-k$.
Benutze FFT um $(b\cdot a)$ zu berechnen.
\end{algorithm}
diff --git a/tcr.pdf b/tcr.pdf
index 4b8eab4..e5b898e 100644
--- a/tcr.pdf
+++ b/tcr.pdf
Binary files differ