[1]SETUBAL J, MEIDANIS J. Introduction to computational molecular biology[M]. Belmont: Brooks/Cole Publishing Company, 1997.
[2]ILIE L, TINTA L, POPESCU C, et al. Viral genome compression[C]// Proceedings of the 12th International Meeting on DNA Computing, LNCS 4287. Berlin: Springer-Verlag, 2006: 111-126.
[3]SHEN S,WU S, SHEN H, et al.Greedy algorithm of computing shortest common superstring[J]. Computer Engineering and Design, 2007, 28(8):1757-1761.(申时凯,吴绍兵,申浩如,等.计算最短公共超串的贪婪算法[J]. 计算机工程与设计, 2007, 28(8):1757-1761.)
[4]TARHIO J, UKKONEN E. A greedy approximation algorithm for constructing shortest common superstrings[J]. Theoretical Computer Science, 1988, 57(1):131-145.
[5]LIU X, LI Y, XU J. DNA directed model for shortest superstring problem[J]. Journal of Computational and Theoretical Nanoscience, 2011,8(10):2112-2117.
[6]LOPEZ-RODRIGUEZ D, MERIDA-CASERMEIRO E. Shortest common superstring problem with discrete neural networks[C]// Proceedings of the 9th International Conference on Adaptive and Natural Computing Algorithms, LNCS 5495. Berlin: Springer, 2009: 62-71.
[7]GONZALEZ-GURROLA L C, BRIZUELA C A. A genetic algorithm for the shortest common superstring problem[C]// Proceedings of the 9th lbero-American Conference on Artificial Intelligence, Advances in Artificial Intelligence-Iberamia, LNCS 3315. Berlin: Springer-Verlag, 2004: 851-860.
[8]BREIMER E, GOLDBERG M, HOLLINGER D. Discovering optimization algorithms through automated learning[J]. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 2005, 69(1):7-25.
[9]ZARITSKY A, SIPPER M. The preservation of favored building blocks in the struggle for fitness: The puzzle algorithm[J]. IEEE Transactions on Evolutionary Computation, 2004, 8(5):443-455.
[10]ZARITSKY A, SIPPER M. Coevolving solutions to the shortest common superstring problem[J]. Biosystems, 2004,76(1/2/3):209-216.
[11]CROCHEMORE M, CYGAN M, ILIOPOULOS C, et al. Algorithms for three versions of the shortest common superstring problem[C]// Proceedings of the 2010 Combinatorial Pattern Matching, LNCS 6129. Berlin: Springer-Verlag, 2010:299-309.
[12]CLIFFORD R, GOTTHILF Z, LEWENSTEIN M, et al. Restricted common superstring and restricted common supersequence[C]// Proceedings of the 2011 Combinatorial Pattern Matching, LNCS 6661. Berlin: Springer, 2011:467-478.
[13]LEI X. Swarm intelligent optimization algorithms and their applications[M]. Beijing: Science Press, 2012.(雷秀娟. 群智能优化算法及其应用[M]. 北京:科学出版社,2012.)
[14]CHEN G. Parallel computing-architecture, algorithms and programming[M]. Beijing: Higher Education Press, 2011.(陈国良. 并行计算——结构·算法·编程[M]. 北京:高等教育出版社,2011.)
[15]ZHANG S, CHU Y. CUDA for high-performance GPU computing[M]. Beijing: China Water and Power Press,2009.(张舒,褚艳利. GPU高性能运算之CUDA[M]. 北京:中国水利水电出版社,2009.) |