libmems 1.6.0+4725-2 source package in Ubuntu
Changelog
libmems (1.6.0+4725-2) unstable; urgency=medium * Add Multi-Arch: same and Pre-Depends: ${misc:Pre-Depends} according to https://wiki.debian.org/Multiarch/Implementation * Rename library packages for g++5 ABI transition. * properly link to its dependencies Closes: #795344 -- Andreas Tille <email address hidden> Tue, 18 Aug 2015 23:39:39 +0200
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 | |
---|---|---|---|---|
Xenial | release | universe | misc |
Downloads
File | Size | SHA-256 Checksum |
---|---|---|
libmems_1.6.0+4725-2.dsc | 2.1 KiB | e931f8ae952f47e0438df7d13aee904101516dc32fa2800e48f4b70f2cc2cf2d |
libmems_1.6.0+4725.orig.tar.xz | 231.2 KiB | 67265e1eb1b85a04533be431b906cc8d4773c799fb1a7809b346209380c41e91 |
libmems_1.6.0+4725-2.debian.tar.xz | 6.7 KiB | aca45625a46c4eacaf9cd7fbc95c8140d3bcd2863fc41e31e4f205014108f992 |
Available diffs
No changes file available.
Binary packages built by this source
- libmems-1.6-1v5: 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.
- libmems-1.6-1v5-dbgsym: No summary available for libmems-1.6-1v5-dbgsym in ubuntu yakkety.
No description available for libmems-
1.6-1v5- dbgsym in ubuntu yakkety.
- libmems-1.6-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.