treeHMM (version 0.1.1)

fwd_seq_gen: Calculate the order in which nodes in the tree should be traversed during the forward pass(roots to leaves)

Description

Tree is a complex graphical model where we can have multiple parents and multiple children for a node. Hence the order in which the tree should be tranversed becomes significant. Forward algorithm is a dynamic programming problem where to calculate the values at a node, we need the values of the parent nodes beforehand, which need to be traversed before this node. This algorithm outputs a possible(not unique) order of the traversal of nodes ensuring that the parents are traversed first before the children.

Usage

fwd_seq_gen(hmm, nlevel = 100)

Arguments

hmm

hmm Object of class List given as output by initHMM

nlevel

No. of levels in the tree, if known. Default is 100

Value

Vector of length "D", where "D" is the number of nodes in the tree

See Also

forward

Examples

# NOT RUN {
tmat = matrix(c(0,0,1,0,0,0,0,1,0,0,0,0,0,1,1,0,0,0,0,0,0,0,0,0,0),
               5,5, byrow= TRUE ) #for "X" (5 nodes) shaped tree
hmmA = initHMM(c("A","B"),list(c("L","R")), tmat) #one feature with two discrete levels "L" and "R"
ft_sq = fwd_seq_gen(hmmA)
# }