Publisher
Springer Nature Switzerland
Reference18 articles.
1. Abboud, A., Backurs, A., Williams, V.V.: Tight hardness results for LCS and other sequence similarity measures. In: FOCS 2015, pp. 59–78 (2015)
2. Apostolico, A., Browne, S., Guerra, C.: Fast linear-space computations of longest common subsequences. Theor. Comput. Sci. 92(1), 3–17 (1992)
3. Arlazarov, V., Dinic, E., Kronrod, M., Faradzev, I.: On economical construction of the transitive closure of a directed graph. Sov. Math. Dokl. 11(5), 1209–1210 (1970)
4. Bose, P., Buss, J.F., Lubiw, A.: Pattern matching for permutations. Inf. Process. Lett. 65(5), 277–283 (1998)
5. Bringmann, K., Künnemann, M.: Quadratic conditional lower bounds for string problems and dynamic time warping. In: FOCS 2015, pp. 79–97 (2015)