Back to Results
First PageMeta Content
Probability and statistics / Viterbi algorithm / Hidden Markov model / Dynamic programming / Stochastic context-free grammar / Markov chain / Fisher–Yates shuffle / Baum–Welch algorithm / Algorithm / Markov models / Statistics / Mathematics


Inverting the Viterbi Algorithm: An Abstract Framework for Structure Design Michael Schnall-Levin [removed] Leonid Chindelevitch
Add to Reading List

Document Date: 2008-05-12 14:01:36


Open Document

File Size: 851,19 KB

Share Result on Facebook

City

Helsinki / /

Company

Cambridge University Press / Artificial Intelligence Laboratory / Intel / /

Country

Finland / /

/

IndustryTerm

e-prints / above branch-and-bound algorithm / branchand-bound algorithm / low energy / Branch-and-bound algorithms / optimum decoding algorithm / polynomial-time algorithm / branch-and-bound algorithm / exhaustive search / energy / polynomial-time algorithms / theoretical tools / feasible solution / polynomial time algorithm / natural language processing / search space / energy model / polynomialtime algorithm / /

Organization

Cambridge University / MIT / Department of Mathematics / NDSEG / Hertz Foundation / /

Person

Mathieu Blanchette / Xi / Leonid Chindelevitch / Michael Baym / Michael Schnall-Levin / Andreas Schulz / /

Position

author / /

ProgrammingLanguage

K / /

PublishedMedium

Current Opinion / Journal of Molecular Biology / Machine Learning / IEEE Transactions on Information Theory / Nucleic Acids Research / /

Technology

Bioinformatics / polynomial time algorithm / Viterbi algorithm / polynomial-time algorithms / Biotechnology / branchand-bound algorithm / CKY algorithm / Machine Learning / polynomialtime algorithm / branch-and-bound algorithm / optimum decoding algorithm / pdf / above branch-and-bound algorithm / natural language processing / thermodynamics / Baum-Welch algorithm / polynomial-time algorithm / 1 Branch-and-Bound Algorithm / otherwise NO. An algorithm / Branch-and-bound algorithms / /

URL

http /

SocialTag