Anytime algorithms for the longest common palindromic subsequence problem-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Anytime algorithms for the longest common palindromic subsequence problem

Published:2020-02 Issue: Volume:114 Page:104827
ISSN:0305-0548
Container-title:Computers & Operations Research
language:en
Short-container-title:Computers & Operations Research

Author:

Djukanovic Marko^ORCID,Raidl Günther R.,Blum Christian^ORCID

Funder

FWF

Publisher

Elsevier BV

Subject

Management Science and Operations Research,Modeling and Simulation,General Computer Science

Reference57 articles.

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

2. Repetition-free longest common subsequence;Adi;Discrete Appl. Math.,2010

3. AWA* – A window constrained anytime heuristic search algorithm;Aine,2007

4. Anytime nonparametric A*;van den Berg,2011

5. A survey of longest common subsequence algorithms;Bergroth,2000

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

1. Graph search and variable neighborhood search for finding constrained longest common subsequences in artificial and real gene sequences;Applied Soft Computing;2022-06

2. A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation;Evolutionary Computation in Combinatorial Optimization;2022

3. Application of A$$^*$$ to the Generalized Constrained Longest Common Subsequence Problem with Many Pattern Strings;Pattern Recognition and Artificial Intelligence;2022

4. Solving the Longest Common Subsequence Problem Concerning Non-Uniform Distributions of Letters in Input Strings;Mathematics;2021-06-29

5. Finding Longest Common Subsequences: New anytime A∗ search results;Applied Soft Computing;2020-10

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3