The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
A fast algorithm for computing longest common subsequences
Communications of the ACM
Enumerating longest increasing subsequences and patience sorting
Information Processing Letters
A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices
SIAM Journal on Computing
A linear space algorithm for computing a longest common increasing subsequence
Information Processing Letters
A New Efficient Algorithm for Computing the Longest Common Subsequence
Theory of Computing Systems - Special Issue: Symposium on Parallelism in Algorithms and Architectures 2006; Guest Editors: Robert Kleinberg and Christian Scheideler
A fast algorithm for computing a longest common increasing subsequence
Information Processing Letters
The longest almost-increasing subsequence
Information Processing Letters
Fast computation of a longest increasing subsequence and application
Information and Computation
Faster algorithms for computing longest common increasing subsequences
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Efficient algorithms for finding a longest common increasing subsequence
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
| Hi-index | 0.00 |
Given two permutations A and B of [1..n] and a fixed constant c, we introduce the notion of a longest common almost increasing subsequence (LCAIS) as a longest common subsequence that can be converted to an increasing subsequence by possibly adding a value, that is at most c, to each of the elements. We present an algorithm for computing LCAIS in O(n^2) space, O(n(n+c^2)) time.