Пакет: mhap (2.1.3+dfsg-2)

[ Источник: 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).

Другие пакеты, относящиеся к mhap

• dep: default-jre-headless

  Standard Java or Java compatible Runtime (headless)

• dep: jaligner

  Smith-Waterman algorithm with Gotoh's improvement

• dep: jarwrapper

  запуск исполняемых Java-файлов .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

Загрузка mhap

Загрузить для всех доступных архитектур

Архитектура	Размер пакета	В установленном виде	Файлы
all	156,4 Кб	192,0 Кб	[список файлов]