Comparing a Hidden Markov Model and a Stochastic Context-Free Grammar

DOI10.1007/3-540-44696-6_6MaRDI QIDQ4801139zbMATH OpenOpenAlexFDO

Authors Rune B. Lyngsø, Christian Nørgaard Storm Pedersen, Arun Jagota

Publication date 6 April 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44696-6_6

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Reasoning under uncertainty in the context of artificial intelligence (68T37) Grammars and rewriting systems (68Q42) Combinatorics on words (68R15)

Recommendations

• Extending stochastic context-free grammars for an application in bioinformatics
• Biological Sequence Analysis
• Stochastic context-free grammars, regular languages, and newton's method
• Applying length-dependent stochastic context-free grammars to RNA secondary structure prediction
• The consensus string problem and the complexity of comparing hidden Markov models.

Cited in

(1)

• Extending stochastic context-free grammars for an application in bioinformatics

This page was built for publication: Comparing a Hidden Markov Model and a Stochastic Context-Free Grammar

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4801139)