Sparse Dynamic Programming II: Convex and Concave Cost Functions

David Eppstein, Zvi Galil, Raffaele Giancarlo & Giuseppe F. Italiano
We consider dynamic programming solutions to a number of different recurrences for sequence comparison and for RNA secondary structure prediction. These recurrences are defined over a number of points that is quadratic in the input size; however only a sparse set matters for the result. We give efficient algorithms for these problems, when the weight functions used in the recurrences are taken to be linear. Our algorithms reduce the best known bounds by a factor...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.