Guo-Jun Qi, Charu Aggarwal, et al.
IEEE TPAMI
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.
Guo-Jun Qi, Charu Aggarwal, et al.
IEEE TPAMI
Imran Nasim, Melanie Weber
SCML 2024
Segev Shlomov, Avi Yaeli
CHI 2024
Amarachi Blessing Mbakwe, Joy Wu, et al.
NeurIPS 2023