Result for 6DF6DF1EC8D21A5EFB14C20EFC1E9BBADB8CAA8E

Query result

Key Value
FileName./usr/share/doc/smithwaterman/copyright
FileSize1367
MD57ED6DEA15FE746A49D071CAF5CCEC7B8
SHA-16DF6DF1EC8D21A5EFB14C20EFC1E9BBADB8CAA8E
SHA-256B2B6D3F08F5A5257DF3888A711B3EB08BDEEB88A3660126136B79C6AA739423F
SSDEEP24:g0tiTYhHg107nruPJH/H0ymS3gt8xLHc1hMK9QH0sUv4kOk4/+/U3oq4sFig:qTUHg1en0Jvlm6Er5QH0s5ANU3oWFig
TLSHT15F21B80E77800B52299623909A7568D4F33B714AB95BA6C4647EE245572A07DC1FF444
hashlookup:parent-total33
hashlookup:trust100

Network graph view

Parents (Total: 33)

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

Key Value
FileSize33098
MD50A66D4DE237C5F4232388029538F381B
PackageDescriptiondetermine 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.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibsmithwaterman0
PackageSectionlibs
PackageVersion0.0+20160702-3
SHA-100B189DAB2D50458E824AC0AFFDBA53F9C360150
SHA-2565D2781B662A9A606935CD9739AAE71A0C5BC64A290E95D7B3C33E0D80042AE65
Key Value
FileSize34154
MD51387F4B0A7F629B42F1CBBD6C6F531E5
PackageDescriptiondetermine 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.
PackageMaintainerDebian Med Packaging Team <debian-med-packaging@lists.alioth.debian.org>
PackageNamelibsmithwaterman-dev
PackageSectionlibdevel
PackageVersion0.0+20160702-1+b1
SHA-1067EC0B2DED74DF1F9A630F63A21168A309F3870
SHA-2566D1D01E80F5C2E28B6E8D6B8CD630ADE608BAB1CFE7F8484D89FD6B63E718788
Key Value
FileSize39490
MD565D3108DA07393668921351DA52F8A36
PackageDescriptiondetermine 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.
PackageMaintainerDebian Med Packaging Team <debian-med-packaging@lists.alioth.debian.org>
PackageNamelibsmithwaterman-dev
PackageSectionlibdevel
PackageVersion0.0+20160702-1+b1
SHA-108102075594E7F9CF42664F30493E0B3F0F790F3
SHA-256790926F418DBCBC563B5658EFF464D052C4D4F3847AC6D5B627FF88526BA70F2
Key Value
FileSize9036
MD5D56AA5E42281D93784B6B36FF18FDFA3
PackageDescriptiondetermine 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.
PackageMaintainerDebian Med Packaging Team <debian-med-packaging@lists.alioth.debian.org>
PackageNamesmithwaterman
PackageSectionscience
PackageVersion0.0+20160702-1+b1
SHA-118A92B929698166342F20D8B13B5B5D2CC62205D
SHA-25624455FD2AF0413CD3D4987F7D6D297768959BA8C456271A1172B0EC22670CD0F
Key Value
FileSize28978
MD5AD0618C2A30F01273753AF463699755F
PackageDescriptiondetermine 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.
PackageMaintainerDebian Med Packaging Team <debian-med-packaging@lists.alioth.debian.org>
PackageNamelibsmithwaterman0
PackageSectionlibs
PackageVersion0.0+20160702-1+b1
SHA-11A54A64EE876FF5D903E45260DD02637ACD446D0
SHA-2567590A924D125DB971F763743BA6A51EAAACF02848DA6F92FBD89268D34DD51BA
Key Value
FileSize31402
MD5DCED7FBDF58F96A3C031143D6C4AA9F5
PackageDescriptiondetermine 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.
PackageMaintainerDebian Med Packaging Team <debian-med-packaging@lists.alioth.debian.org>
PackageNamelibsmithwaterman0
PackageSectionlibs
PackageVersion0.0+20160702-1+b1
SHA-1301CECBBD079BF58AB2A5A58F861EF52EB960D99
SHA-25621EC91FDC98390A630B50DF78BEB036F32DA10851D7166C26448C0AA7831530F
Key Value
FileSize29158
MD5F110B8C732AD1966D5ABF4BD4DE71DD8
PackageDescriptiondetermine 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.
PackageMaintainerDebian Med Packaging Team <debian-med-packaging@lists.alioth.debian.org>
PackageNamelibsmithwaterman0
PackageSectionlibs
PackageVersion0.0+20160702-1+b1
SHA-13C5AF6FDC3C9322C5A964DEA799303427CEEA8B3
SHA-256F1BBB03DAD5BA8EA0746A5C529E7DDC1D71D811034C65D2758CAA76AD13038A4
Key Value
FileSize36104
MD5CD5A485EBC06A5F6D066468AFDB79ADA
PackageDescriptiondetermine 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.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibsmithwaterman0
PackageSectionlibs
PackageVersion0.0+20160702-3
SHA-13D8ADB47A1D8D23CFD2E7BDE7D5B3C378FD153F7
SHA-256C401CDCB01D6A7C02CCDC49B195AE0299D4C926A5762E4AAC9C6E2EE1D7BEC3D
Key Value
FileSize35806
MD59D196420C1EDE4EADB64922EFFE6A080
PackageDescriptiondetermine 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.
PackageMaintainerDebian Med Packaging Team <debian-med-packaging@lists.alioth.debian.org>
PackageNamelibsmithwaterman-dev
PackageSectionlibdevel
PackageVersion0.0+20160702-1+b1
SHA-1408114CA7B642EDC03706A8DDE23D7E3BF3BBA8C
SHA-256C6CC626070E16C964094C2A7BB3AAA0D2B3B0DB0C39D42865708E7DAC8EA3FCB
Key Value
FileSize32984
MD5CEB125071D420EB74A5B2D235BFE2162
PackageDescriptiondetermine 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.
PackageMaintainerDebian Med Packaging Team <debian-med-packaging@lists.alioth.debian.org>
PackageNamelibsmithwaterman0
PackageSectionlibs
PackageVersion0.0+20160702-1+b1
SHA-141DF1883B49AA91034BDF46B6DDCABAE466049E0
SHA-256DE284D88C04B3BC39D83855744914001C52ECFCE875450EB431CFF04A0994CBB