libsmithwaterman 0.0+git20160702.2610e25-7build1 source package in Ubuntu
Changelog
libsmithwaterman (0.0+git20160702.2610e25-7build1) focal; urgency=medium * No-change rebuild for libgcc-s1 package name change. -- Matthias Klose <email address hidden> Sun, 22 Mar 2020 16:46:52 +0100
Upload details
- Uploaded by:
- Matthias Klose
- Uploaded to:
- Focal
- Original maintainer:
- Debian Med
- Architectures:
- any
- Section:
- misc
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section | |
|---|---|---|---|---|
| Focal | release | universe | misc |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| libsmithwaterman_0.0+git20160702.2610e25.orig.tar.xz | 24.3 KiB | 6266f043c8a12cad8b1309f620c180fc422a1e9ee9df0163691652fa523f5bd3 |
| libsmithwaterman_0.0+git20160702.2610e25-7build1.debian.tar.xz | 6.2 KiB | 85ccac9cb4aed5caaea0348c60b90344b3d3a31ab6851dbbc99a2ccf1ebfc30b |
| libsmithwaterman_0.0+git20160702.2610e25-7build1.dsc | 2.3 KiB | 7c64b896ba95bc234afed7e1b034b862693b903fd6a5c0a9be0becaacb6883e4 |
Available diffs
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: No summary available for libsmithwaterman0 in ubuntu groovy.
No description available for libsmithwaterman0 in ubuntu groovy.
- libsmithwaterman0-dbgsym: debug symbols for libsmithwaterman0
- 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: debug symbols for smithwaterman
