Paket: mhap (2.1.3+dfsg-2)

[ Quellcode: 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).

Andere Pakete mit Bezug zu mhap

• dep: default-jre-headless

  Standard-Java- oder Java-kompatible Laufzeitumgebung (»headless«)

• dep: jaligner

  Smith-Waterman algorithm with Gotoh's improvement

• dep: jarwrapper

  Startet ausführbare Java-.jar-Dateien

• dep: libcommons-compress-java

  Java-API zum Arbeiten mit Komprimierungs- und Archivformaten

• 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

mhap herunterladen

Download für alle verfügbaren Architekturen

Architektur	Paketgröße	Größe (installiert)	Dateien
all	156,4 kB	192,0 kB	[Liste der Dateien]