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

Changelog

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

  [ Christian Ehrhardt ]
  * Update symbols to unbreak Ubuntu builds on ppc64el and s390x
    Closes: #974137

  [ Andreas Tille ]
  * More generalised removal of *.la files
  * Standards-Version: 4.5.1 (routine-update)

 -- Andreas Tille <email address hidden>  Fri, 04 Dec 2020 23:07:21 +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 Pocket Published Component Section

Downloads

File Size SHA-256 Checksum
libsmithwaterman_0.0+git20160702.2610e25-11.dsc 2.3 KiB c1acaabcba2be2cc35b5a4939b5246e1c7c5f70214023c509c4e56f4ae371370
libsmithwaterman_0.0+git20160702.2610e25.orig.tar.xz 24.3 KiB 6266f043c8a12cad8b1309f620c180fc422a1e9ee9df0163691652fa523f5bd3
libsmithwaterman_0.0+git20160702.2610e25-11.debian.tar.xz 7.0 KiB beb3aaa88b89367e6b34404f60ab5a5952dee6acf6d02f915e5e84644215d142

No changes file available.

Binary packages built by this source

libsmithwaterman-dev: No summary available for libsmithwaterman-dev in ubuntu hirsute.

No description available for libsmithwaterman-dev in ubuntu hirsute.

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: No summary available for libsmithwaterman0-dbgsym in ubuntu impish.

No description available for libsmithwaterman0-dbgsym in ubuntu impish.

smithwaterman: determine similar regions between two strings or genomic sequences

 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.

smithwaterman-dbgsym: No summary available for smithwaterman-dbgsym in ubuntu hirsute.

No description available for smithwaterman-dbgsym in ubuntu hirsute.