libsmithwaterman 0.0+git20160702.2610e25-12 source package in Ubuntu

Changelog

libsmithwaterman (0.0+git20160702.2610e25-12) unstable; urgency=medium

  * Packaging update
  * Standards-Version: 4.6.0 (routine-update)
  * Apply multi-arch hints.
    + libsmithwaterman-dev, libsmithwaterman0: Add Multi-Arch: same.
  * Drop symbols file to reduce maintenance burden
    Closes: #984207

 -- Andreas Tille <email address hidden>  Wed, 13 Oct 2021 10:01:23 +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 Pocket Published Component Section
Oracular release universe misc
Noble release universe misc
Mantic release universe misc
Lunar release universe misc
Jammy release universe misc

Downloads

File Size SHA-256 Checksum
libsmithwaterman_0.0+git20160702.2610e25-12.dsc 2.3 KiB f211d98d9bb75f5a340b2fff3895f23b2ba39e3dc7af3a960a42babcaaf62b4d
libsmithwaterman_0.0+git20160702.2610e25.orig.tar.xz 24.3 KiB 6266f043c8a12cad8b1309f620c180fc422a1e9ee9df0163691652fa523f5bd3
libsmithwaterman_0.0+git20160702.2610e25-12.debian.tar.xz 6.1 KiB d37cebbe58fa8ab750eff71dcf0ddafe63895ecc254e52c17eb34dcb746b681b

No changes file available.

Binary packages built by this source

libsmithwaterman-dev: determine similar regions between two strings or genomic sequences (devel)

 The Smith–Waterman algorithm performs local sequence alignment; that is,
 for determining similar regions between two strings or nucleotide or
 protein sequences. Instead of looking at the total sequence, the
 Smith–Waterman algorithm compares segments of all possible lengths and
 optimizes the similarity measure.
 .
 This is the development package containing the statically linked
 library and the header files.

libsmithwaterman0: determine similar regions between two strings or genomic sequences (lib)

 The Smith–Waterman algorithm performs local sequence alignment; that is,
 for determining similar regions between two strings or nucleotide or
 protein sequences. Instead of looking at the total sequence, the
 Smith–Waterman algorithm compares segments of all possible lengths and
 optimizes the similarity measure.
 .
 This package contains the dynamic library.

libsmithwaterman0-dbgsym: debug symbols for libsmithwaterman0
smithwaterman: No summary available for smithwaterman in ubuntu kinetic.

No description available for smithwaterman in ubuntu kinetic.

smithwaterman-dbgsym: debug symbols for smithwaterman