The Treeterbi and Parallel Treeterbi algorithms: efficient, optimal decoding for ordinary, generalized and pair HMMs.
Evan KeiblerManimozhiyan ArumugamMichael R. BrentPublished in: Bioinform. (2007)
Keyphrases
- computationally efficient
- worst case
- computationally expensive
- algorithmic solutions
- pairwise
- hidden markov models
- highly efficient
- parallel hardware
- parallel architectures
- orders of magnitude
- learning algorithm
- efficient implementation
- computationally complex
- highly scalable
- times faster
- significant improvement
- computational complexity
- exhaustive search
- computationally intensive
- complexity analysis
- distributed memory
- parallel processors
- computationally demanding
- data structure
- image segmentation