libmems 1.6.0+4725-10build1 source package in Ubuntu
Changelog
libmems (1.6.0+4725-10build1) noble; urgency=medium * No-change rebuild for CVE-2024-3094 -- Steve Langasek <email address hidden> Sun, 31 Mar 2024 19:16:21 +0000
Upload details
- Uploaded by:
- Steve Langasek
- Uploaded to:
- Noble
- Original maintainer:
- Ubuntu Developers
- Architectures:
- any
- Section:
- misc
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section | |
|---|---|---|---|---|
| Noble | 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-10build1.debian.tar.xz | 9.3 KiB | ac877c8495d2851b90bc334a2f3be26b903464803bb984a98d79e7ba64c84ef6 |
| libmems_1.6.0+4725-10build1.dsc | 2.3 KiB | 37c4bf9fc0d7be38b2f017b40801da71fff3d7d18d594b6253aaf78d1e9056b3 |
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.
- libmems1t64: 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.
- libmems1t64-dbgsym: debug symbols for libmems1t64
