Explaining and Controlling Ambiguity in Dynamic Programming

@inproceedings{Giegerich2000ExplainingAC,
  title={Explaining and Controlling Ambiguity in Dynamic Programming},
  author={R. Giegerich},
  booktitle={CPM},
  year={2000}
}
Ambiguity in dynamic programming arises from two independent sources, the non-uniqueness of optimal solutions and the particular recursion scheme by which the search space is evaluated. Ambiguity, unless explicitly considered, leads to unnecessarily complicated, inflexible, and sometimes even incorrect dynamic programming algorithms. Building upon the recently developed algebraic approach to dynamic programming, we formalize the notions of ambiguity and canonicity. We argue that the use of… Expand
Versatile and declarative dynamic programming using pair algebras
Algebraic Dynamic Programming
Pair Evaluation Algebras in Dynamic Programming
A discipline of dynamic programming over sequence data
Effective ambiguity checking in biosequence analysis
Semantics and Ambiguity of Stochastic RNA Family Models
Product Grammars for Alignment and Folding
...
1
2
3
4
...

References

SHOWING 1-10 OF 28 REFERENCES
Towards A Discipline of Dynamic Programming
A Declarative Approach to the Development of Dynamic Programming Algorithms, Applied to RNA Folding
Code Selection by Inversion of Order-Sorted Derivors
Higher-Order Functions for Parsing
  • G. Hutton
  • Computer Science
  • J. Funct. Program.
  • 1992
A dynamic programming algorithm to find all solutions in a neighborhood of the optimum
Estimating the Probability of Approximate Matches
Parametric optimization of sequence alignment
Tree Generating Regular Systems
  • W. Brainerd
  • Computer Science, Mathematics
  • Inf. Control.
  • 1969
Introduction to algorithms
Algorithms on strings, trees, and sequences
...
1
2
3
...