Inverting the Viterbi algorithm
Michael Schnall-Levin, Leonid Chindelevitch, Bonnie Berger · International Conference on Machine Learning · 2008
Probabilistic grammatical formalisms such as hidden Markov models (HMMs) and stochastic context-free grammars (SCFGs) have been extensively studied and widely applied in a number of fields. Here, we introduce a new algorithmic problem on HMMs and SCFGs that arises naturally from protein and RNA design, and which has not been previously studied. The problem can be viewed as an inverse to the one solved by the Viterbi algorithm on HMMs or by the CKY algorithm on SCFGs. We study this problem theoretically and obtain the first algorithmic results. We prove that the problem is NP-complete, even for a 3-letter emission alphabet, via a reduction from 3-SAT, a result that has implications for the hardness of RNA secondary structure design. We then develop a number of approaches for making the problem tractable. In particular, for HMMs we develop a branch-and-bound algorithm, which can be shown to have fixed-parameter tractable worst-case running time, exponential in the number of states of the HMM but linear in the length of the structure. We also show how to cast the problem as a Mixed Integer Linear Program.
Cited by 25 works. doi:10.1145/1390156.1390270
Authors
References
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
- Optimal computer folding of large RNA sequences using thermodynamics and auxiliary information
- Biological sequence analysis probabilistic models of proteins and nucleic acids
- Fast folding and comparison of RNA secondary structures
- Evaluation of several lightweight stochastic context-free grammars for RNA secondary structure prediction
- A New Algorithm for RNA Secondary Structure Design
- Review: Protein Design—Where We Were, Where We Are, Where We're Going
- COMPUTER-BASED DESIGN OF NOVEL PROTEIN STRUCTURES
- INFO-RNA—a fast approach to inverse RNA folding
- Are engineered proteins getting competition from RNA?