Search Results - polynomial-time (dynamic OR dynamika) programming algorithms*

Variations on RNA folding and alignment: lessons from Benasque by Bompfünewerer, Athanasius F., Backofen, Rolf, Bernhart, Stephan H., Hertel, Jana, Hofacker, Ivo L., Stadler, Peter F., Will, Sebastian

“…Dynamic programming algorithms solve many standard problems of RNA bioinformatics in polynomial time…”
Get full text

On the Approximation of Optimal Structures for RNA-RNA Interaction by Mneimneh, S.

“… Most of the proposed algorithms are based on dynamic programming. RNA-RNA interaction is generally NP-complete…”
Get full text

Scalable Approaches to Time-Dependent Path and Routing Problems by He, Edward Yuhang

“…Many combinatorial optimization problems involve an aspect of time, whether due to changing conditions, updated information, or being under a continuous…”
Get full text

Rapid ab initio prediction of RNA pseudoknots via graph tree decomposition by Zhao, Jizhen, Malmberg, Russell L., Cai, Liming

“… Optimal algorithms often assume a restricted class for the predicted RNA structures and yet still require a high-degree polynomial time complexity, which is too expensive to use…”
Get full text

Topics in Discrete Optimization: Models, Complexity and Algorithms by He, Qie

“… The prevalent presence of dynamics and uncertainties imposes even greater challenges on both tasks…”
Get full text

Static Risk Sensitive Reinforcement Learning by Hau, Jia Lin

“…Reinforcement Learning (RL) is a core area of artificial intelligence (AI) that enables systems to make decisions in complex environments. RL algorithms have…”
Get full text

A Framework for Efficient Implementation and Effective Visualization of Dempster-Shafer Belief Theoretic Computations for Reasoning under Uncertainty by Polpitiya, Lalintha G

“…The convenience, intuitiveness, and versatility of Dempster-Shafer (DS) theoretic models of data uncertainty make DS evidence theory an ideal framework for…”
Get full text

ALGORITHMS FOR SELECTING BREAKPOINT LOCATIONS TO OPTIMIZE DIVERSITY IN PROTEIN ENGINEERING BY SITE-DIRECTED PROTEIN RECOMBINATION by Zheng, Wei, Ye, Xiaoduan, Friedman, Alan M., Bailey-Kellogg, Chris

“…Protein engineering by site-directed recombination seeks to develop proteins with new or improved function, by accumulating multiple mutations from a set of…”
Get full text