Searching for Shortest Common Supersequences by Means of a Heuristic-Based Genetic Algorithm
暂无分享,去创建一个
[1] V. G. Timkovskii. Complexity of common subsequence and supersequence problems and related problems , 1989 .
[2] Robert W. Irving,et al. Approximation Algorithms for the Shortest Common Supersequence , 1995, Nord. J. Comput..
[3] Udo Kohlmorgen,et al. Parallel Genetic Algorithm for the Capacitated Lot-Sizing Problem , 1996 .
[4] Cameron Bruce Fraser,et al. Subsequences and Supersequences of Strings , 1995 .
[5] Tao Jiang,et al. On the Approximation of Shortest Common Supersequences and Longest Common Subsequences , 1995, SIAM J. Comput..
[6] Qiang Yang,et al. Theory and Algorithms for Plan Merging , 1992, Artif. Intell..
[7] Martin Middendorf. More on the Complexity of Common Superstring and Supersequence Problems , 1994, Theor. Comput. Sci..
[8] David Maier,et al. The Complexity of Some Problems on Subsequences and Supersequences , 1978, JACM.
[9] Esko Ukkonen,et al. The Shortest Common Supersequence Problem over Binary Alphabet is NP-Complete , 1981, Theor. Comput. Sci..