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	46806
MD5	DD692E51CD48BA557DDE4D603FFCCD64
PackageDescription	fast algorithms for single, average/UPGMA and complete linkage clustering; documentation 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 the documentation for 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-doc
PackageSection	doc
PackageVersion	0.4.6-3
SHA-1	FF3242B7D68395F22BA6C69AF9B50CE0B53367B7
SHA-256	5C4E1CA3A94D7B0E6C3856AF6FAEC9DC9EBCEE2C0A4FDCDFDFF065B5B835DFDA

Key	Value
FileSize	34228
MD5	A835A9D23E198B5B3B777570233D966C
PackageDescription	fast algorithms for single, average/UPGMA and complete linkage clustering; documentation 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 the documentation for a library for the Haskell programming language. See http://www.haskell.org/ for more information on Haskell.
PackageMaintainer	Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageName	libghc-hierarchical-clustering-doc
PackageSection	doc
PackageVersion	0.4.6-3build1
SHA-1	6B1631D6F0CF6D4FF0F3C9DDD43F9E937AC50AF0
SHA-256	ECBBC054C285C2F922DBF7D0C9D3E347A48F67337693A8C4099254F3BAB0D4A5