libmems 1.6.0+4725-9build1 source package in Ubuntu
Changelog
libmems (1.6.0+4725-9build1) hirsute; urgency=medium * No-change rebuild for boost soname change. -- Matthias Klose <email address hidden> Sat, 12 Dec 2020 13:07:47 +0100
Upload details
- Uploaded by:
- Matthias Klose
- Uploaded to:
- Hirsute
- Original maintainer:
- Debian Med
- Architectures:
- any
- Section:
- misc
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section | |
|---|---|---|---|---|
| Mantic | release | universe | misc | |
| Lunar | release | universe | misc | |
| Jammy | release | universe | misc |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| libmems_1.6.0+4725.orig.tar.xz | 231.2 KiB | 67265e1eb1b85a04533be431b906cc8d4773c799fb1a7809b346209380c41e91 |
| libmems_1.6.0+4725-9build1.debian.tar.xz | 8.8 KiB | 6cbd052ff6de575e5762d165f92570caf9751be5651ed306ab3fea443d56ea81 |
| libmems_1.6.0+4725-9build1.dsc | 2.1 KiB | 34fa0459b1a285f715e532a0e1e58f343b591480981299d28a6ded420e5d88b6 |
Available diffs
Binary packages built by this source
- libmems-dev: development library to support DNA string matching and comparative genomics
libMems is a freely available software development library to support DNA
string matching and comparative genomics. Among other things, libMems
implements an algorithm to perform approximate multi-MUM and multi-MEM
identification. The algorithm uses spaced seed patterns in conjunction
with a seed-and-extend style hashing method to identify matches. The method
is efficient, requiring a maximum of only 16 bytes per base of the largest
input sequence, and this data can be stored externally (i.e. on disk) to
further reduce memory requirements.
.
This is the development package containing the statically linked
library and the header files.
- libmems1: library to support DNA string matching and comparative genomics
libMems is a freely available software development library to support DNA
string matching and comparative genomics. Among other things, libMems
implements an algorithm to perform approximate multi-MUM and multi-MEM
identification. The algorithm uses spaced seed patterns in conjunction
with a seed-and-extend style hashing method to identify matches. The method
is efficient, requiring a maximum of only 16 bytes per base of the largest
input sequence, and this data can be stored externally (i.e. on disk) to
further reduce memory requirements.
.
This package contains the dynamic library.
- libmems1-dbgsym: No summary available for libmems1-dbgsym in ubuntu noble.
No description available for libmems1-dbgsym in ubuntu noble.
