| viXra.org > Data Structures and Algorithms > viXra:2010.0244 |
 |
 |
| viXra.org > Data Structures and Algorithms > viXra:2010.0244 |
|
|
Data Structures and Algorithms |
|
Authors: Chun Lin
The problem of LCS (longest common subsequence) and LIS (longest increasing subsequence) are both well-solved; the former was proved to be solvable in $O(nm/log{n})$ \cite{masek} and the later $O(nlog{log{n}})$ \cite{segal}. Recently, the problem LCIS (longest common increasing subsequence) was proposed. While it can be seen as a combination of the two aforementioned problems, it seems difficult to adapt their solutions to the LCIS problem. Most of the approaches to LCIS utilizes dynamic programming and sophisticated data structure to speed up, while we use a simple algorithm to attack the case where the alphabet size is extremely small comparing to the sequence lengths.
Comments: 7 Pages. [Corrections made by viXra Admin to conform with the requirements on the Submission Form]
Download: PDF
[v1] 2020-10-30 08:56:21
Unique-IP document downloads: 498 times
Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.
| Third-Party Links: |
|