Details about this class can be found in papers on consensus tree construction algorithms:
- An Experimental Analysis of Consensus Tree Algorithm [..].
HashUtils() -
Constructor for class statalign.postprocess.plugins.contree.hash.HashUtils
When two fragments of two sequences on two neighbor vertices of the tree
are realigned, the proposed new alignment is drawn from a forward-backward
sampling of this HMM.
When two fragments of two sequences on two sibling vertices are realigned
drawing a novel ancestral substring for their parent vertex, the proposed new
alignment is drawn from a forward-backward sampling of this HMM.
An implementation of the abstract pair-HMM that emits characters into non-observable sequences
Used when a new alignment is proposed that aligns together two substrings via an ancestral sequence.
This is the abstract class of pair-HMMs that emit characters into one unobservable
sequence, namely that aligns two observable sequences via an unobservable
ancestral sequence.