size.search {DBHC} | R Documentation |
The size search algorithm finds the optimal number of HMM states for a set of
sequences and returns both the optimal hmm
object and the
corresponding number of hidden states. Used in select.seeds
.
size.search(sequences, log_space = FALSE, print = FALSE)
sequences |
An |
log_space |
Logical, parameter provided to
|
print |
Logical, whether to print intermediate steps or not. |
A list with the optimal number of HMM states and the optimal
hmm
object.
Used in the DBHC seed selection procedure in
select.seeds
.