fork/minimap2
1
0
Fork 0
mirror of https://github.com/lh3/minimap2.git synced 2026-09-15 13:07:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

minor wording changes

Browse Source
This commit is contained in:
Heng Li
2017-08-04 10:21:10 -04:00
parent 7e231cfd3a
commit 648cdd8a3b
2 changed files with 5 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
tex/graphmap.eval Normal file
View File

@@ -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

2
tex/minimap2.tex
View File

@@ -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