Distinguishing string selection problems

Author:

Kevin Lanctot J.,Li Ming,Ma Bin,Wang Shaojiu,Zhang Louxin

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science

Reference23 articles.

1. The Probabilistic Method;Alon,1992

2. The complexity and approximability of finding maximum feasible subsystems of linear relations;Amaldi;Theoret. Comput. Sci.,1995

3. Proof verification and intractability of approximation problems;Arora,1992

4. Influence of pH on the conformation and stability of mismatch base-pairs in DNA;Brown;J. Mol. Biol.,1990

5. Banishing bias from consensus sequences;Ben-Dor,1997

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

1. Exploring Scalable Parallelization for Edit Distance-Based Motif Search;IEEE/ACM Transactions on Computational Biology and Bioinformatics;2023-03-01

2. Application of Negative Learning Ant Colony Optimization to the Far from Most String Problem;Evolutionary Computation in Combinatorial Optimization;2023

3. The k-Centre Problem for Classes of Cyclic Words;Lecture Notes in Computer Science;2023

4. Longest k-tuple Common Sub-Strings;2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM);2022-12-06

5. A Comparative Analysis for Generating Common d-Neighborhood on Planted Motif Search Problem;Intelligent Computing & Optimization;2022-10-21

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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