The handling of deletions in the HMM is currently slow and adds significant complexity to the algorithm. Instead of checking each possible deletion size for each matrix element, we should instead add a deletion matrix analogous to the insertion matrix that will vastly accelerate the HMM
The handling of deletions in the HMM is currently slow and adds significant complexity to the algorithm. Instead of checking each possible deletion size for each matrix element, we should instead add a deletion matrix analogous to the insertion matrix that will vastly accelerate the HMM