当前位置: X-MOL 学术Theor. Comput. Sci. › 论文详情
Computing a Longest Common Almost-Increasing Subsequence of Two Sequences
Theoretical Computer Science ( IF 0.747 ) Pub Date : 2020-11-20 , DOI: 10.1016/j.tcs.2020.11.035
Toan Thang Ta; Yi-Kung Shieh; Chin Lung Lu

Given a positive constant c, a sequence S=s1,s2,,sk of k numbers is said to be almost increasing if and only if si>max1j<isjc for all 1<ik. A longest common almost-increasing subsequence (LCaIS) between two input sequences is a longest common subsequence that is also an almost increasing sequence. We found out that the existing algorithm proposed by Moosa et al. [1] to find an LCaIS of two sequences without repeated elements gives an incorrect result for some instances. In this work, we present a dynamic programming algorithm that can correctly compute an LCaIS between any two sequences with repeated elements in O(nml) time and O(nm) space, where n and m are the lengths of two input sequences and l is the length of the output LCaIS.

更新日期:2020-11-21
全部期刊列表>>
ERIS期刊投稿
欢迎阅读创刊号
自然职场,为您触达千万科研人才
spring&清华大学出版社
城市可持续发展前沿研究专辑
Springer 纳米技术权威期刊征稿
全球视野覆盖
施普林格·自然新
chemistry
物理学研究前沿热点精选期刊推荐
自然职位线上招聘会
欢迎报名注册2020量子在线大会
化学领域亟待解决的问题
材料学研究精选新
GIANT
ACS ES&T Engineering
ACS ES&T Water
屿渡论文,编辑服务
ACS Publications填问卷
阿拉丁试剂right
苏州大学
林亮
南方科技大学
朱守非
内蒙古大学
杨小会
隐藏1h前已浏览文章
课题组网站
新版X-MOL期刊搜索和高级搜索功能介绍
ACS材料视界
上海纽约大学
浙江大学
廖矿标
天合科研
x-mol收录
试剂库存
down
wechat
bug