Program transformation for the longest upsequence set problem
Haklin Kimm · 1993
In this paper, we modify the well-known program finding the length of the longest upsequence to a new program determining the longest upsequence set itself.This transformation into the solution of the new longest upsenqece set problem is based on the analo~between the specifii of the given progmrn and the new problem.'I%e cccmct and efficient O@ log n) algorithm finding the longest upaequence set itself is derived from this.