Program Transformation for the Longest Upsequence Set Problem

Abstract

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.

DOI: 10.1145/162754.168692

Extracted Key Phrases

Cite this paper

@inproceedings{Kim1993ProgramTF, title={Program Transformation for the Longest Upsequence Set Problem}, author={Haklin Kim}, booktitle={SAC}, year={1993} }