| Key | Value |
|---|---|
| FileName | ./usr/share/doc/libghc-hierarchical-clustering-prof/copyright |
| FileSize | 1925 |
| MD5 | C22EE4DF65315A1E701C36EAF29A2CED |
| SHA-1 | E0296CE53676508136E194A9B435B776BB2032FB |
| SHA-256 | 3DE1C41E80E2616FDA715290A8CAD4E9098CD354A4231B309640D8981CD99B2C |
| SSDEEP | 48:YxdmkObPOorYJgrYJ9Uc9E437Hv3JErmv3t6THv:YxdBNorYJgrYJ9UM33bv3JjYTP |
| TLSH | T12241C88B06841B9367E32A4176AEB9C0718DD03D79332E04789DE3445F2B11F9573161 |
| hashlookup:parent-total | 31 |
| hashlookup:trust | 100 |
The searched file hash is included in 31 parent files which include package known and seen by metalookup. A sample is included below:
| Key | Value |
|---|---|
| FileSize | 99002 |
| MD5 | CDE40062174C2C99264D216015C178BF |
| 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 | 05CCD072C0725F4BDFCC453890EBBD7AC4D8654E |
| SHA-256 | 2F5ECF56C3D3FA26812465552A96EE461ED2FB43FA956BF3E46B474BA04E2225 |
| 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 |
| Key | Value |
|---|---|
| FileSize | 76908 |
| MD5 | B16FDBB7C5C9822141C61C58AF051CCB |
| 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 | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
| PackageName | libghc-hierarchical-clustering-dev |
| PackageSection | haskell |
| PackageVersion | 0.4.6-1 |
| SHA-1 | 09163E85FEB47BD9FA5EFBF687AFBB20D86FB420 |
| SHA-256 | 78A1EC57C183323766CD6B391BF58BC7245224D951BF8564DC6929A5E19CC718 |
| Key | Value |
|---|---|
| FileSize | 106342 |
| MD5 | 164F6ADA7E4DCC5331E13FC15D6EAC2D |
| 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 | 0A5374B4CA283E1CE02EB54421C9829829E3979C |
| SHA-256 | CAFE62367CCFB1A545213B8229EF94054FE31D071594A061957F0EBF67B26F31 |
| Key | Value |
|---|---|
| FileSize | 91494 |
| MD5 | 52DF619E6754370C2A8DBAA2ED3235E4 |
| 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 | 0E45A4E16A3C213FC97AEE2285BDCF622D80D9CB |
| SHA-256 | 9E8C6F1AFBB36B5B66F70D47DD5F2E4DBB9C0B107943742C8E1CD39AE4DE1D28 |
| Key | Value |
|---|---|
| FileSize | 32672 |
| MD5 | BF8FF2B26616380BC7F58F6118C147D2 |
| 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-1 |
| SHA-1 | 1EAD772B83525DFAB1E16EE5E973447D2244E894 |
| SHA-256 | 06DE225AEFB0668DD474255F72F2282D7D6B62598FD8D50E8C8A0B05462C00AA |
| 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 | 98888 |
| MD5 | E91A004D4F2D9F4CEA9335907675C153 |
| 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 | 3F59B37AB4A1C96DB4AEB7C0D740D1E8B019740E |
| SHA-256 | D01DA806BEE754F982484534ED4E21041E3D176A737554581F9091D5A3F946FB |
| Key | Value |
|---|---|
| FileSize | 79976 |
| MD5 | 136B4C11AAF1404C288954174FC7215B |
| 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 | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
| PackageName | libghc-hierarchical-clustering-dev |
| PackageSection | haskell |
| PackageVersion | 0.4.6-3build1 |
| SHA-1 | 42AF1E6CAC552D454914250CCBDC1F1A112E77EB |
| SHA-256 | 82046733D7276B194749AF59843547738C0D7E20B1AC0A407A4180A822FFB762 |
| 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 |