pmcharrison/seqopt: Finding optimal sequences with dynamic programming
Given a list of timepoints and corresponding lists of possible states, efficiently finds an optimal state sequence that minimises an arbitrary transition cost function.
Getting started
Browse package contents
Package details |
|
|---|---|
| Maintainer | |
| License | MIT + file LICENSE |
| Version | 0.3.0 |
| URL | https://github.com/pmcharrison/seqopt |
| Package repository | View on GitHub |
| Installation |
Install the latest version of this package by entering the following in R:
|
