本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。
原文連結
論文資訊
- 類型：已發表論文
- 日期：2016-05-28
摘要
We present theoretical foundations, and a practical implementation, that makes the method of Algebraic Dynamic Programming available for Multiple Context-Free Grammars. This allows to formulate optimization problems, where the search space can be described by such grammars, in a concise manner and solutions may be obtained efficiently. This improves on the previous state of the art which required complex code based on handwritten dynamic programming recursions. We apply our method to the RNA pseudoknotted secondary structure prediction problem from 計算 biology. Appendix and supporting files available at:
※ 此為已發表論文，全文需透過期刊付費取得