Figure 1From: Decoding HMMs using the k best paths: algorithms and applicationsExample of compressed tree. Solid nodes and lines indicate the actual data structure. The dotted nodes and lines indicate intermediate steps in the construction described in the text.Back to article page