Paquet : mhap (2.1.3+dfsg-3)

[ Paquet source : mhap  ]

locality-sensitive hashing to detect long-read overlaps

The MinHash Alignment Process (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).

Autres paquets associés à mhap

• dep: default-jre-headless

  Standard Java or Java compatible Runtime (headless)

• dep: jaligner

  algorithme de Smith-Waterman avec l'amélioration de Gotoh

• dep: jarwrapper

  exécution d'exécutables Java au format jar

• dep: libcommons-compress-java

  Java API for working with compression and archive formats

• dep: libfastutil-java

  Java API providing type-specific maps, sets, lists and queues

• dep: libguava-java (>= 19)

  Suite of Google common libraries for Java

• dep: libssw-java

  Java bindings for libssw

Télécharger mhap

Télécharger pour toutes les architectures proposées

Architecture	Taille du paquet	Espace occupé une fois installé	Fichiers
all	156,5 ko	192,0 ko	[liste des fichiers]