全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

On multiple occurrences shortest common superstring problem

Keywords: multiple occurrences shortest common superstring problem , satisfiability problem , NP-complete

Full-Text   Cite this paper   Add to My Lib

Abstract:

In this paper, we consider multiple occurrences shortest commonsuperstring problem. In particular, we consider an approach to solvethe problem. This approach is based on an explicit reduction from theproblem to the satisfiability problem.

Full-Text

comments powered by Disqus

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133

WeChat 1538708413