Hidden Markov models and iterative aligners: study of their equivalence and possibilities.
There are many shared attributes between existing iterative aligners and Hidden Markov Model (HMM). A learning algorithm of HMM called Viterbi is the same as the iteration of DP-matching of iterative aligners. HMM aligners can use the result of an iterative aligner initially, incorporate the similarity score of amino acids, and apply the detailed gap cost systems to improve the matching accuracy. On the other hand, the iterative aligner can inherit the modeling capability of HMM, and provide the better representation of the proteins than motifs. In this paper, we present an overview of several iterative aligners which include the parallel iterative aligner of ICOT and the HMM aligner of Haussler's group. We compare the merits and shortcomings of these aligners. This comparison enables us to formulate a better, more advanced aligner through proper integration of the iterative technique and HMM technique.
Tanaka
H
H
Institute for New Generation Computer Technology (ICOT), Tokyo, Japan.
Ishikawa
M
M
Asai
K
K
Konagaya
A
A
D000465:Algorithms; D000595:Amino Acid Sequence; D001185:Artificial Intelligence; D008390:Markov Chains; D008958:Models, Molecular; D015233:Models, Statistical; D008969:Molecular Sequence Data; D011506:Proteins; D016415:Sequence Alignment / Q000379:methods*
D011506:Proteins