A Cover-Merging-Based Algorithm for the Longest Increasing Subsequence in a Sliding Window Problem

In: Computing and Informatics, vol. 31, no. 6

S. Deorowicz

Details:

Year, pages: 2012, 1217 - 1233

Keywords:

Longest increasing subsequence, sliding window, pattern matching

About article:

A longest increasing subsequence problem (LIS) is a well-known combinatorial problem with applications mainly in bioinformatics, where it is used in various projects on DNA sequences. Recently, a number of generalisations of this problem were proposed. One of them is to find an LIS among all fixed-size windows of the input sequence (LISW). We propose an algorithm for the LISW problem based on cover representation of the sequence that outperforms the existing methods for some class of the input sequences.

How to cite:

ISO 690:

Deorowicz, S. 2012. A Cover-Merging-Based Algorithm for the Longest Increasing Subsequence in a Sliding Window Problem. In Computing and Informatics, vol. 31, no.6, pp. 1217-1233. 1335-9150.

APA:

Deorowicz, S. (2012). A Cover-Merging-Based Algorithm for the Longest Increasing Subsequence in a Sliding Window Problem. Computing and Informatics, 31(6), 1217-1233. 1335-9150.