From 648cdd8a3b2b707c0772f0b8b30636f0e63d7584 Mon Sep 17 00:00:00 2001 From: Heng Li Date: Fri, 4 Aug 2017 10:21:10 -0400 Subject: [PATCH] minor wording changes --- tex/graphmap.eval | 4 ++++ tex/minimap2.tex | 2 +- 2 files changed, 5 insertions(+), 1 deletion(-) create mode 100644 tex/graphmap.eval diff --git a/tex/graphmap.eval b/tex/graphmap.eval new file mode 100644 index 0000000..8994281 --- /dev/null +++ b/tex/graphmap.eval @@ -0,0 +1,4 @@ +Q 40 31897 63 0.001975107 +Q 3 423 267 0.010210396 +Q 2 162 120 0.013853827 +Q 1 188 172 0.019038874 diff --git a/tex/minimap2.tex b/tex/minimap2.tex index 41dba31..cd20bf7 100644 --- a/tex/minimap2.tex +++ b/tex/minimap2.tex @@ -294,7 +294,7 @@ matching score, we can derive \[ u_{ij}\le M-v_{i-1,j}\le M+q+e \] -In conclusion, $x$ and $y$ by $[-q-e,-e]$ and $\tilde{x}$, $\tilde{y}$ by +In conclusion, $x$ and $y$ are bounded by $[-q-e,-e]$, $\tilde{x}$ and $\tilde{y}$ by $[-\tilde{q}-\tilde{e},-\tilde{e}]$, and $u$ and $v$ by $[-q-e,M+q+e]$. When matching score and gap cost are small, each of them can be stored as a 8-bit integer. This enables 16-way SSE vectorization regardless of the peak score of