A simple linear space algorithm for computing a longest common increasing subsequence
Data Structures and Algorithms
2016-08-26 v1
Abstract
This paper reformulates the problem of finding a longest common increasing subsequence of the two given input sequences in a very succinct way. An extremely simple linear space algorithm based on the new formula can find a longest common increasing subsequence of sizes and respectively, in time using additional space.
Cite
@article{arxiv.1608.07002,
title = {A simple linear space algorithm for computing a longest common increasing subsequence},
author = {Daxin Zhu and Lei Wang and Tinran Wang and Xiaodong Wang},
journal= {arXiv preprint arXiv:1608.07002},
year = {2016}
}