A fast algorithm for computing a longest common increasing subsequence

Authors:
I-Hsuan Yang;Chien-Pin Huang;Kun-Mao Chao
Affiliations:
Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan;Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan;Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan and Institute of Networking and Multimedia, National Taiwan University, Taipei, Taiwan
Venue:
Information Processing Letters
Year:
2005

Citing 6
Cited 11

Good splitters for counting points in triangles

Journal of Algorithms
A fast algorithm for computing longest common subsequences

Communications of the ACM
Enumerating longest increasing subsequences and patience sorting

Information Processing Letters
Introduction to Algorithms: A Creative Approach

Introduction to Algorithms: A Creative Approach
A Survey of Longest Common Subsequence Algorithms

SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)
Selected combinatorial research problems.

Selected combinatorial research problems.

A linear space algorithm for computing a longest common increasing subsequence

Information Processing Letters
Efficient algorithms for finding interleaving relationship between sequences

Information Processing Letters
Neighbourhood Counting Metric for Sequences

Proceedings of the 2006 conference on Advances in Intelligent IT: Active Media Technology 2006
Fast computation of a longest increasing subsequence and application

Information and Computation
Faster algorithms for computing longest common increasing subsequences

Journal of Discrete Algorithms
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
Computing a longest increasing subsequence of length k in time O(n log log k)

VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
A linear algorithm for 3-letter longest common weakly increasing subsequence

Information Processing Letters
A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem

Information Processing Letters
Computing a longest common subsequence that is almost increasing on sequences having no repeated elements

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.89

Visualization

Abstract

Let A= and B= be two sequences, where each pair of elements in the sequences is comparable. A common increasing subsequence of A and B is a subsequence , where i"1