Parents (Total: 2)

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

Key	Value
FileSize	109164
MD5	5C3AE80760307A2A08A0B4EEF4BFEA8A
PackageDescription	fast algorithms for single, average/UPGMA and complete linkage clustering This package provides a function to create a dendrogram from a list of items and a distance function between them. Initially a singleton cluster is created for each item, and then new, bigger clusters are created by merging the two clusters with least distance between them. The distance between two clusters is calculated according to the linkage type. The dendrogram represents not only the clusters but also the order on which they were created. . This package has many implementations with different performance characteristics. There are SLINK and CLINK algorithm implementations that are optimal in both space and time. There are also naive implementations using a distance matrix. Using the dendrogram function from Data.Clustering.Hierarchical automatically chooses the best implementation we have. . This package provides a library for the Haskell programming language. See http://www.haskell.org/ for more information on Haskell.
PackageMaintainer	Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
PackageName	libghc-hierarchical-clustering-dev
PackageSection	haskell
PackageVersion	0.4.6-3+b1
SHA-1	E67E7799F5742C2A2162D34D364C299FEF010157
SHA-256	0341FCE7EA96B0C4D7B1801D91CC89985C65840F7CEB495C0A4DB76C9312AC1C

Key	Value
FileSize	96880
MD5	9B9DECCE9DEA7EE0F86A109F812D0A5F
PackageDescription	fast algorithms for single, average/UPGMA and complete linkage clustering; profiling libraries This package provides a function to create a dendrogram from a list of items and a distance function between them. Initially a singleton cluster is created for each item, and then new, bigger clusters are created by merging the two clusters with least distance between them. The distance between two clusters is calculated according to the linkage type. The dendrogram represents not only the clusters but also the order on which they were created. . This package has many implementations with different performance characteristics. There are SLINK and CLINK algorithm implementations that are optimal in both space and time. There are also naive implementations using a distance matrix. Using the dendrogram function from Data.Clustering.Hierarchical automatically chooses the best implementation we have. . This package provides a library for the Haskell programming language, compiled for profiling. See http://www.haskell.org/ for more information on Haskell.
PackageMaintainer	Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
PackageName	libghc-hierarchical-clustering-prof
PackageSection	haskell
PackageVersion	0.4.6-3+b1
SHA-1	06F1A9E90BA18DC8FEEFA7B23C75244E346CB7B3
SHA-256	152530EA7C0355A88FCA266A6E60DF56B41AD2EAB42032DC991A5BE2E83ADD4D