File: index.rst

package info (click to toggle)
mhap 2.1.3%2Bdfsg-3
  • links: PTS, VCS
  • area: main
  • in suites: bookworm, bullseye, forky, sid, trixie
  • size: 676 kB
  • sloc: java: 8,095; makefile: 166; xml: 140; python: 33
file content (23 lines) | stat: -rw-r--r-- 872 bytes parent folder | download | duplicates (4)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
=============================================================================
MinHash Alignment Process (MHAP): a probabilistic sequence overlap algorithm.
=============================================================================

=================
Overview
=================
MHAP (pronounced MAP) is a reference implementation of a probabilistic              
sequence overlapping algorithm. Designed to efficiently detect all overlaps
between noisy long-read sequence data. It efficiently estimates Jaccard similarity
by compressing sequences to their representative fingerprints composed on min-mers (minimum k-mer).

MHAP is included within the `Canu <http://canu.readthedocs.org/>`_ assembler. Canu can be downloaded `here <https://github.com/marbl/canu/releases>`_.

Contents:

.. toctree::
   :maxdepth: 2

   installation
   quickstart
   utilities
   contact