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
TLDR
The product operation as introduced here adds a significant amount of flexibility to dynamic programming and provides a versatile testbed for the development of new algorithmic ideas, which can immediately be put to practice. Expand
Algebraic Dynamic Programming
TLDR
The formal framework including a formalization of Bellman's principle is defined, an executable specification language is specified, and it is shown how algorithm design decisions and tuning for efficiency can be described on a convenient level of abstraction. Expand
Pair Evaluation Algebras in Dynamic Programming
Dynamic programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The recently developed discipline of algebraic dynamic programmingExpand
A discipline of dynamic programming over sequence data
TLDR
This article describes an algebraic style of dynamic programming over sequence data based on a combination of grammars and algebras, and including a formalization of Bellman's Principle, and suggests a language used for algorithm design on a convenient level of abstraction. Expand
Modeling Dynamic Programming Problems over Sequences and Trees with Inverse Coupled Rewrite Systems
TLDR
The present article demonstrates the scope of this new approach by describing a diverse set of dynamic programming problems which arise in the domain of computational biology, with examples in biosequence and molecular structure analysis. Expand
Analyzing Ambiguity of Context-Free Grammars
TLDR
This work observes that there is a simple linguistic characterization of the grammar ambiguity problem, and shows how to exploit this to conservatively approximate the problem based on local regular approximations and grammar unfoldings. Expand
Analyzing ambiguity of context-free grammars
TLDR
It is observed that there is a simple linguistic characterization of the grammar ambiguity problem, and it is shown how to exploit this by presenting an ambiguity analysis framework based on conservative language approximations. Expand
Effective ambiguity checking in biosequence analysis
TLDR
An automated partial procedure for proving non-ambiguity is introduced, for the special case of stochastic context free grammars and RNA structure modeling, and it is used to demonstrate non- Ambiguity for several relevant Grammars. Expand
Semantics and Ambiguity of Stochastic RNA Family Models
TLDR
It is proposed that both the structure and the trace semantics are worth-while concepts for further study, possibly better suited to capture remotely related family members. Expand
Product Grammars for Alignment and Folding
TLDR
This work provides a fully worked frameshift-aware, semiglobal DNA-protein alignment algorithm whose grammar is composed of products of small, atomic grammars and an embedding in Haskell as a domain-specific language makes the theory directly accessible to writing and using grammar products without the detour of an external compiler. Expand
...
1
2
3
4
...

References

SHOWING 1-10 OF 28 REFERENCES
Towards A Discipline of Dynamic Programming
TLDR
Algebraic dynamic programming (ADP) is a new style of dynamic programming and a method for algorithm development, designed to alleviate the difficulties of developing dynamic programming algorithms over sequence data. Expand
A Declarative Approach to the Development of Dynamic Programming Algorithms, Applied to RNA Folding
TLDR
A new approach to the systematic development of dynamic programming algorithms is presented and applied to RNA folding and results in a modular approach – different recognizers and different analyses can be combined freely. Expand
Code Selection by Inversion of Order-Sorted Derivors
TLDR
This work provides a general framework for the pattern matching approach to the code selection problem with the following properties: it accommodates increased expressive power for defining intermediate languages, it provides formal criteria for the completeness of a code selector specification, and it offers a new way to integrate the “nonsyntactic” subtasks of code generation with thepattern matching process. Expand
Higher-Order Functions for Parsing
  • G. Hutton
  • Computer Science
  • J. Funct. Program.
  • 1992
TLDR
This work presents the basic method for combinator parsing, and a number of extensions, and addresses the special problems presented by white{ space, and parsers with separate lexical and syntactic phases. Expand
A dynamic programming algorithm to find all solutions in a neighborhood of the optimum
TLDR
A new technique is described which modifies the usual backtracking procedure and lists all near-optimal policies and is very much in the spirit of the original formulation of dynamic programming. Expand
Estimating the Probability of Approximate Matches
TLDR
The unbiased estimator herein is shown to give good results in a matter of a thousand samples even for small probability patterns, which is expected to improve the performance of Anrep and may have utility in estimating the significance of similarity searches. Expand
Parametric optimization of sequence alignment
TLDR
The most striking results are found while implementing a large software package for parametric sequence analysis, and in turn have led to faster algorithms for those tasks. Expand
Tree Generating Regular Systems
  • W. Brainerd
  • Computer Science, Mathematics
  • Inf. Control.
  • 1969
TLDR
The main result is that the sets of trees generated by regular systems are exactly those that are accepted by tree automata. Expand
Introduction to algorithms
TLDR
This article illustrates aspects of programming through a language similar tologo, which turns the computer into a ‘virtual machine’ whose features and capabilities are unlimited. Expand
Algorithms on strings, trees, and sequences
TLDR
Ukkonen’s method is the method of choice for most problems requiring the construction of a suffix tree, and it will be presented first because it is easier to understand. Expand
...
1
2
3
...