Finding least-weight subsequences with fewer processors

Tak-Wah Lam and Kwong-Fai Chan
Algorithmica 9:615–628, 1993
Proc. 1st Int. Symp. Algorithms (SIGAL 1990), Lecture Notes in Computer Science 450, Tetsuo Asano, Toshihide Ibaraki, Hiroshi Imai, and Takao Nishizeki, ed., Springer-Verlag, 1990, pp. 318–327,

Cites:

• Sparse dynamic programming
• Sequence comparison with mixed convex and concave costs