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	91444
MD5	A489753BE81E3871ED82A8AB56CAEDAB
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	2436EC847FFC07D9981B946BE4847D1F71E20229
SHA-256	3506A107DF9F4E70A3E47F3C01A41D95127EC3EC7EAEBA5E8C1EDBF572303408

Key	Value
FileSize	69992
MD5	1B0E0843825F7146C46DF02805A00329
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	7758D0E3CA34819BC2C2AA6F0916C3007B2572C6
SHA-256	1833AAA2A473729DFAC418249DFE7ABF7E8E90EE60B5F5CDD0AB74C856A1B59D