Difference between revisions of "MasHmap"
(Created page with "Category:SoftwareCategory:Phylogenetics {|<!--CONFIGURATION: REQUIRED--> |{{#vardefine:app|mashmap}} |{{#vardefine:url|https://github.com/marbl/MashMap}} <!--CONFIGURA...") |
|||
| (3 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
[[Category:Software]][[Category:Phylogenetics]] | [[Category:Software]][[Category:Phylogenetics]] | ||
{|<!--CONFIGURATION: REQUIRED--> | {|<!--CONFIGURATION: REQUIRED--> | ||
| − | |{{#vardefine:app| | + | |{{#vardefine:app|MasHmap}} |
|{{#vardefine:url|https://github.com/marbl/MashMap}} | |{{#vardefine:url|https://github.com/marbl/MashMap}} | ||
<!--CONFIGURATION: OPTIONAL (|1}} means it's ON)--> | <!--CONFIGURATION: OPTIONAL (|1}} means it's ON)--> | ||
Latest revision as of 17:28, 27 May 2022
Description
MashMap implements a fast and approximate algorithm for computing local alignment boundaries between long DNA sequences. It can be useful for mapping genome assembly or long reads (PacBio/ONT) to reference genome(s). Given a minimum alignment length and an identity threshold for the desired local alignments, Mashmap computes alignment boundaries and identity estimates using k-mers. It does not compute the alignments explicitly, but rather estimates a k-mer based Jaccard similarity using a combination of Minimizers and MinHash. This is then converted to an estimate of sequence identity using the Mash distance. An appropriate k-mer sampling rate is automatically determined using the given minimum local alignment length and identity thresholds. The efficiency of the algorithm improves as both of these thresholds are increased.
Environment Modules
Run module spider MasHmap to find out what environment modules are available for this application.
System Variables
- HPC_MASHMAP_DIR - installation directory
- HPC_MASHMAP_BIN - executable directory