Searching for Shortest Common Supersequences
msra（1996）
摘要
Abstract: The Shortest Common Supersequence (SCS) problem is a classical problemfrom stringology which has applications e.g. in Articial Intelligence (specically planning), mechanical engineering and data compression. The SCSproblem is NP-complete under various restrictions concerning the alphabetsize, the length of the given strings, or their structure. Using a GeneticAlgorithm to solve SCS is not easy, e.g. because the search space only containsa few valid solutions of reasonable length...
更多查看译文
关键词
data compression,shortest common supersequence,search space,mechanical engineering
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要