Description Usage Arguments Value

Given a list of timepoints and corresponding lists of possible states, efficiently finds an optimal state sequence that minimises an arbitrary transition cost function. The implementation uses dynamic programming to achieve complexity linear in the sequence length and quadratic in the number of possible states.

1 |

`x` |
A nested list describing the possible states at the possible time points.
Element |

`cost_funs` |
A list of cost functions,
with each cost function created by |

`progress` |
Whether or not to show a progress bar. |

A list where element `i`

corresponds to the optimal
state at timepoint `i`

.

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.