Author:
Lee Chien-Ting,Yang Chang-Biau,Huang Kuo-Si
Publisher
Springer Nature Singapore
Reference16 articles.
1. Brodal, G.S., Kaligosi, K., Katriel, I., Kutz, M.: Faster algorithms for computing longest common increasing subsequences. In: Proceedings of the 17th Annual Symposium on Combinatorial Pattern Matching (CPM), Barcelona, Spain, pp. 330–341 (2006)
2. Cai, D., Zhu, D., Wang, L., Wang, X.: A simple linear space algorithm for computing a longest common increasing subsequence. IAENG Int. J. Comput. Sci. 45(3), 472–477 (2018)
3. Chan, W.T., Zhang, Y., Fung, S.P.Y., Ye, D., Zhu, H.: Efficient algorithms for finding a longest common increasing subsequence. J. Comb. Optim. 13(3), 277–288 (2007)
4. Deorowicz, S., Danek, A.: Bit-parallel algorithms for the merged longest common subsequence problem. Int. J. Found. Comput. Sci. 24, 1281–1298 (2013)
5. Hirschberg, D.S.: A linear space algorithm for computing maximal common subsequences. Commun. ACM 18(6), 341–343 (1975)