Computing the longest common almost-increasing subsequence-Reference-Cited by-同舟云学术

Computing the longest common almost-increasing subsequence

Author:

Bhuiyan Mohammad Tawhidul Hasan^ORCID,Alam Muhammad Rashed,Rahman M. Sohel^ORCID

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference28 articles.

1. Tight hardness results for LCS and other sequence similarity measures;Abboud,2015

2. Fast and deterministic constant factor approximation algorithms for LCS imply new circuit lower bounds;Abboud,2018

4. Multivariate fine-grained complexity of longest common subsequence;Bringman,2018

5. Quadratic conditional lower bounds for string problems and dynamic time warping;Bringmann,2015

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

2. The Longest Almost Increasing Subsequence Problem with Sliding Windows;2023 IEEE Asia-Pacific Conference on Computer Science and Data Engineering (CSDE);2023-12-04

3. An Algorithm for Finding the Longest Common Almost Wave Subsequence with the Trend;2023 14th IIAI International Congress on Advanced Applied Informatics (IIAI-AAI);2023-07-08