Large neighborhood search for the most strings with few bad columns problem-Reference-Cited by-同舟云学术

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

Large neighborhood search for the most strings with few bad columns problem

Published:2016-10-06 Issue:17 Volume:21 Page:4901-4915
ISSN:1432-7643
Container-title:Soft Computing
language:en
Short-container-title:Soft Comput

Author:

Lizárraga Evelia,Blesa Maria J.,Blum Christian,Raidl Günther R.

Funder

Spanish Ministry for Economy and Comptetitiveness

AGAUR

CONACYT

Publisher

Springer Science and Business Media LLC

Subject

Geometry and Topology,Theoretical Computer Science,Software

Link

http://link.springer.com/article/10.1007/s00500-016-2379-4/fulltext.html

Reference14 articles.

1. Boucher C, Landau GM, Levy A, Pritchard D, Weimann O (2013) On approximating string selection problems with outliers. Theor Comput Sci 498:107–114

2. Gusfield D (1997) Algorithms on strings, trees, and sequences. Computer science and computational biology. Cambridge University Press, Cambridge

3. Hsu WJ, Du MW (1984) Computing a longest common subsequence for a set of strings. BIT Numer Math 24(1):45–59. doi: 10.1007/BF01934514

4. Landau GM, Schmidt JP, Sokol D (2001) An algorithm for approxixmate tandem repeat. J Comput Biol 8(1):1–18

5. Lizárraga E, Blesa MJ, Blum C, Raidl GR (2015) On solving the most strings with few bad columns problem: an ILP model and heuristics. In: Proceedings of INISTA 2015—international symposium on innovations in intelligent systems and applications, IEEE Press, pp 1–8

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

1. Solution of the family traveling salesman problem using a hyper-heuristic approach;Engineering Applications of Artificial Intelligence;2024-07

2. New Approaches for String Site-Removal Problem;Procedia Computer Science;2023

3. On the role of metaheuristic optimization in bioinformatics;International Transactions in Operational Research;2022-06-16

4. Construct, Merge, Solve and Adapt Versus Large Neighborhood Search for Solving the Multi-dimensional Knapsack Problem: Which One Works Better When?;Evolutionary Computation in Combinatorial Optimization;2017

5. Bibliography;Metaheuristics for String Problems in Bio-Informatics;2016-09-16

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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