Balík: mhap (2.1.3+dfsg-2)

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

Ostatné balíky súvisiace s balíkom mhap

• dep: default-jre-headless

  štandardné dynamické prostredie Java alebo kompatibilné s Javou (bez displeja)

• dep: jaligner

  Smith-Waterman algorithm with Gotoh's improvement

• dep: jarwrapper

  Spúšťa spustiteľné súbory 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)

  balík spoločných knižníc Google pre Javu

• dep: libssw-java

  Java bindings for libssw

Stiahnuť mhap

Stiahnuť pre všetky dostupné architektúry

Architektúra	Veľkosť balíka	Nainštalovaná veľkosť	Súbory
all	156.4 kB	192.0 kB	[zoznam súborov]