Estimates the most likely path for a hidden Markov Chain using the maximum likelihood Viterbi algorithm.
viterbi.hmm(transitions, loglikelihood, positions, expected.CNV.length)
Transition matrix
numeric matrix containing the loglikelihood of the data under the possible states
Positions of the exons
Expected length of CNV calls, which has an impact on the transition matrix between CNV states.
Description of 'comp1'
Description of 'comp2'
Standard forward-backward Viterbi algorithm using a precomputed matrix of likelihoods.