Bioinformatics, Vol 14, 401-406, Copyright © 1998 by Oxford University Press
C Tarnas and R Hughey
MOTIVATION: Complete forward-backward (Baum-Welch) hidden Markov model
training cannot take advantage of the linear space, divide-and-conquer
sequence alignment algorithms because of the examination of all possible
paths rather than the single best path. RESULTS: This paper discusses the
implementation and performance of checkpoint-based reduced space sequence
alignment in the SAM hidden Markov modeling package. Implementation of the
checkpoint algorithm reduced memory usage from O(mn) to O (m square root n)
with only a 10% slowdown for small m and n, and vast speed-up for the
larger values, such as m = n = 2000, that cause excessive paging on a 96
Mbyte workstation. The results are applicable to other types of dynamic
programming. AVAILABILITY: A World-Wide Web server, as well as information
on obtaining the Sequence Alignment and Modeling (SAM) software suite, can
be found at http://www.cse.ucsc. edu/research/compbio/sam.html. CONTACT:
rph@cse.ucsc.edu
ARTICLES
Reduced space hidden Markov model training
Department of Computer Engineering, Jack Baskin School of Engineering, University of California, Santa Cruz, CA 95064, USA.
![]()
CiteULike
Connotea
Del.icio.us What's this?
This article has been cited by other articles:
![]() |
R. K. Bradley and I. Holmes Transducers: an emerging probabilistic framework for modeling indels on trees Bioinformatics, December 1, 2007; 23(23): 3258 - 3262. [Abstract] [Full Text] [PDF] |
||||
![]() |
S. Hochreiter, M. Heusel, and K. Obermayer Fast model-based protein homology detection without alignment Bioinformatics, July 15, 2007; 23(14): 1728 - 1736. [Abstract] [Full Text] [PDF] |
||||
![]() |
E. Keibler, M. Arumugam, and M. R. Brent The Treeterbi and Parallel Treeterbi algorithms: efficient, optimal decoding for ordinary, generalized and pair HMMs Bioinformatics, March 1, 2007; 23(5): 545 - 554. [Abstract] [Full Text] [PDF] |
||||
