C.A. Micchelli, W.L. Miranker
Journal of the ACM
Dynamic programming solutions to a number of different recurrence equations for sequence comparison and for RNA secondary structure prediction are considered. 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. Efficient algorithms for these problems are given, when the weight functions used in the recurrences are taken to be linear. The time complexity of the algorithms depends almost linearly on the number of points that need to be considered; when the problems are sparse this results in a substantial speed-up over known algorithms. © 1992, ACM. All rights reserved.
C.A. Micchelli, W.L. Miranker
Journal of the ACM
Barry K. Rosen
SWAT 1972
Ryan Johnson, Ippokratis Pandis
CIDR 2013
Merve Unuvar, Yurdaer Doganata, et al.
CLOUD 2014