Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 1217-1233 |
| Number of pages | 17 |
| Journal | Computing and Informatics |
| Volume | 31 |
| Issue number | 6 |
| Publication status | Published - 2012 |
Keywords
- Longest increasing subsequence
- Pattern matching
- Sliding window
ASJC Scopus subject areas
- Software
- Hardware and Architecture
- Computer Networks and Communications
- Computational Theory and Mathematics
Fingerprint
Dive into the research topics of 'A cover-Merging-based algorithm for the longest increasing subsequence in a sliding window problem'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver