libmems 1.6.0+4725-10 source package in Ubuntu
Changelog
libmems (1.6.0+4725-10) unstable; urgency=medium * fix-system.patch: new: fix build failure on arm. (Closes: #1065765) * d/control: add myself to uploaders. -- Étienne Mollier <email address hidden> Sun, 10 Mar 2024 14:24:52 +0100
Upload details
- Uploaded by:
- Debian Med
- Uploaded to:
- Sid
- Original maintainer:
- Debian Med
- Architectures:
- any
- Section:
- misc
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section |
|---|
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| libmems_1.6.0+4725-10.dsc | 2.3 KiB | 7217afe3fbfd43c0eee1df5ba9829de5adb119474739e7f8c9204e20a5ea0ecd |
| libmems_1.6.0+4725.orig.tar.xz | 231.2 KiB | 67265e1eb1b85a04533be431b906cc8d4773c799fb1a7809b346209380c41e91 |
| libmems_1.6.0+4725-10.debian.tar.xz | 9.2 KiB | 1fc7cded09ff2656f1eded565468782af6b350a01f34721f0217d5995533ef83 |
Available diffs
- diff from 1.6.0+4725-9.1 to 1.6.0+4725-10 (919 bytes)
No changes file available.
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
