Directories
¶
| Path | Synopsis |
|---|---|
|
Package em is the groot implementation of the expectation-maximization algorithm for finding the most likely paths through the graphs Currently, there is no weighting for each path, as they are all so similar in length and the nodes have already been weighted.
|
Package em is the groot implementation of the expectation-maximization algorithm for finding the most likely paths through the graphs Currently, there is no weighting for each path, as they are all so similar in length and the nodes have already been weighted. |
|
Package graph is used to process graphs.
|
Package graph is used to process graphs. |
|
Package lshe is used to index the graphs.
|
Package lshe is used to index the graphs. |
|
Package minhash contains implementations of bottom-k and kmv MinHash algorithms.
|
Package minhash contains implementations of bottom-k and kmv MinHash algorithms. |
|
contains some misc helper functions etc.
|
contains some misc helper functions etc. |
|
Package pipeline contains a streaming pipeline implementation based on the Gopher Academy article by S. Lampa - Patterns for composable concurrent pipelines in Go (https://blog.gopheracademy.com/advent-2015/composable-pipelines-improvements/)
|
Package pipeline contains a streaming pipeline implementation based on the Gopher Academy article by S. Lampa - Patterns for composable concurrent pipelines in Go (https://blog.gopheracademy.com/advent-2015/composable-pipelines-improvements/) |
|
the seqio package contains custom types and methods for holding and processing sequence data
|
the seqio package contains custom types and methods for holding and processing sequence data |
Click to show internal directories.
Click to hide internal directories.