KMA is a method designed to map raw reads directly against redundant databases, in an ultra-fast manner using seed and extend. KMA is particulary good at aligning high quality reads against highly redundant databases, where unique matches often does not exist. It works for long low quality reads as well, such as those from Nanopore. Non-unique matches are resolved using the ConClave sorting scheme, and a consensus sequence are outputted in addition to other common attributes, based on our users demands. |
hg clone https://toolshed.g2.bx.psu.edu/repos/iuc/kma
Name | Description | Version | Minimum Galaxy Version |
---|---|---|---|
1.4.14+galaxy0 | 23.0 |