2009Journal of Computational BiologyRequires access

A Note on the Linear Memory Baum-Welch Algorithm

Jens Ledet Jensen

Open publisher page 3 citations

Abstract

We demonstrate the simplicity and generality of the recently introduced linear space Baum-Welch algorithm for hidden Markov models. We also point to previous literature on the subject.

About this research paper

What this paper is about

We demonstrate the simplicity and generality of the recently introduced linear space Baum-Welch algorithm for hidden Markov models. We also point to previous literature on the subject.

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

We demonstrate the simplicity and generality of the recently introduced linear space Baum-Welch algorithm for hidden Markov models. We also point to previous literature on the subject.

Key concepts: Algorithm, Computer science, Mathematics

Related papers

Back to paper searchBrowse research topicsOriginal source
A Note on the Linear Memory Baum-Welch Algorithm — Research Paper | ScholarLens