fork/minimap2
1
0
Fork 0
mirror of https://github.com/lh3/minimap2.git synced 2026-10-03 12:58:11 +08:00
Code Issues Packages Projects Releases Wiki Activity

removed one extra sentence

Browse Source
This commit is contained in:
Heng Li
2021-08-07 16:55:02 -04:00
parent 5113ca2628
commit bb3048b2a0
1 changed files with 0 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files
tex/mm2-update.tex
-2
View File
@@ -69,8 +69,6 @@ minimizers. Suppose we are looking at two adjacent low-occurence $k$-mers
located at position $x_1$ and $x_2$, respectively. If $|x_1-x_2|\ge500$, located at position $x_1$ and $x_2$, respectively. If $|x_1-x_2|\ge500$,
minimap2 v2.22 additionally selects $\lfloor|x_1-x_2|/500\rfloor$ minimizers minimap2 v2.22 additionally selects $\lfloor|x_1-x_2|/500\rfloor$ minimizers
of the lowest occurrence among minimizers between $x_1$ and $x_2$. of the lowest occurrence among minimizers between $x_1$ and $x_2$.
We use a binary heap data
structure to select minimizers of the lowest occurrence in this interval.
This strategy adds necessary anchors at the cost of increasing total alignment This strategy adds necessary anchors at the cost of increasing total alignment
time by a few percent on real data. time by a few percent on real data.