| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
BioInf.GeneCluEDO
Description
Run all steps of the GeneCluEDO algorithms in order.
This will produce the following:
- run the minimal distance algorithm, give the minimal distance score and return all co-optimal paths
- run the end-probability algorithm and return the probability that each node is the begin/end of a chain
- run the edge probability algorithm and give the probability for each
from :-> toedge - with the edge probabilities, run the maximal probability path algorithm, return that probability and all co-optimal paths
TODO -Pretty should yield a structure to be given to the eps or svg generator. This allows more flexibility. Does diagrams offer serialization?
TODO All this should be wrapped and available as a function. not just providing output files.
- runGeneCluEDO :: FillWeight -> FillStyle -> Double -> FilePath -> String -> IO ()
- data FillWeight :: *
- data FillStyle :: *
Documentation
Arguments
| :: FillWeight | |
| -> FillStyle | |
| -> Double | Temperature for probability-related parts of the algorithms. Lower temperatures favor a single path. |
| -> FilePath | The input score matrix |
| -> String | In the current directory, create output files with this name prefix |
| -> IO () |
data FillWeight :: * #
Fill weight for our grid. If the fill weight is logarithmic, then
the line length is 1 / (1 + log value) otherwise it is value.
Instances