Parents (Total: 3)

The searched file hash is included in 3 parent files which include package known and seen by metalookup. A sample is included below:

Key	Value
FileSize	38590
MD5	8E422C56B88529168562BC5902900DB5
PackageDescription	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.
PackageMaintainer	Debian Med Packaging Team <debian-med-packaging@lists.alioth.debian.org>
PackageName	libsmithwaterman-dev
PackageSection	libdevel
PackageVersion	0.0+20160702-1+b1
SHA-1	849F95492455E500174EB2EDF203EDCD8B74115C
SHA-256	3EDDE198995AD48C6A4A1486353D41113599688768A1371CD1F80E98B2DAEF72

Key	Value
FileSize	30960
MD5	AA93CF8C9CE1E532786D8BEE068A6FD8
PackageDescription	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.
PackageMaintainer	Debian Med Packaging Team <debian-med-packaging@lists.alioth.debian.org>
PackageName	libsmithwaterman0
PackageSection	libs
PackageVersion	0.0+20160702-1+b1
SHA-1	884CA8934FA8832BF9427C4A8C28FEEFE000FD10
SHA-256	458DF5A88265851DC2966ED2C505902CC9FCEAD1AE67EB5471E395DF9B4437A9

Key	Value
FileSize	9508
MD5	E2E1C39AFCAEAF449F689B16EC55799E
PackageDescription	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.
PackageMaintainer	Debian Med Packaging Team <debian-med-packaging@lists.alioth.debian.org>
PackageName	smithwaterman
PackageSection	science
PackageVersion	0.0+20160702-1+b1
SHA-1	BCC2A8DF5EF5280F41FA1F9D2A3EE1EE087215CE
SHA-256	3C62087A44C318107CD9615047C4D6EE8864596EC38ADDFF03DD32FC10C4606A