Skip to main content
Conference Proceedings

A space efficient algorithm for LCIS problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2017) 10656 LNCS 70-77
DOI: 10.1007/978-3-319-72389-1_6
2Citations
Citations of this article
N/AReaders
Mendeley users who have this article in their library.
Get full text

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 n and m respectively, in time O(nm) using additional min{n,m}+1 space.

Author supplied keywords

Cite

CITATION STYLE

APA

Zhu, D., & Wang, X. (2017). A space efficient algorithm for LCIS problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10656 LNCS, pp. 70–77). Springer Verlag. https://doi.org/10.1007/978-3-319-72389-1_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free