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

explain -M in the manpage

Browse Source
This commit is contained in:
Heng Li
2018-01-18 11:47:11 -05:00
parent 33f8157961
commit 0454e6be91
1 changed files with 5 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files
minimap2.1
+5
View File
@@ -182,6 +182,11 @@ Maximum fragment length (aka insert size; effective with
.BR -xsr / --frag) .BR -xsr / --frag)
[800] [800]
.TP .TP
.BI -M \ FLOAT
Mark as secondary a chain that overlaps with a better chain by
.I FLOAT
or more of the shorter chain [0.5]
.TP
.BI --max-chain-skip \ INT .BI --max-chain-skip \ INT
A heuristics that stops chaining early [50]. Minimap2 uses dynamic programming A heuristics that stops chaining early [50]. Minimap2 uses dynamic programming
for chaining. The time complexity is quadratic in the number of seeds. This for chaining. The time complexity is quadratic in the number of seeds. This