Memetic algorithms with partial lamarckism for the shortest common supersequence problem

Lecture Notes in Computer Science

Volumn 3562, Issue PART II, 2005, Pages 84-91

  Cotta, Carlos ^a  

^a ETSI Informatica   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; MATHEMATICAL OPERATORS; PROBLEM SOLVING;

LOCAL-IMPROVEMENT OPERATORS; MEMETIC ALGORITHMS (MA); OPTIMIZATION PROBLEMS;

COMPUTER SCIENCE;

EID: 26444587185     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11499305_9     Document Type: Conference Paper

References (15)

1. Bodlaender, H., Downey, R., Fellows, M., Wareham, H.: The parameterized complexity of sequence alignment and consensus. Theoretical Computer Science 147 (1994) 31-54
2. Middendorf, M.: More on the complexity of common superstring and supersequence problems. Theoretical Computer Science 125 (1994) 205-228
3. Pietrzak, K.: On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems. Journal of Computer and System Sciences 67 (2003) 757-771
4. Foulser, D., Li, M., Yang, Q.: Theory and algorithms for plan merging. Artificial Intelligence 57 (1992) 143-181
5. Timkovsky, V.: Complexity of common subsequence and supersequence problems and related problems. Cybernetics 25 (1990) 565-580
6. Hallet, M.: An integrated complexity analysis of problems from computational biology. PhD thesis, University of Victoria (1996)
7. Branke, J., Middendorf, M., Schneider, F.: Improved heuristics and a genetic algorithm for finding short super sequences. OR-Spektrum 20 (1998) 39-45
8. Rahmann, S.: The shortest common supersequence problem in a microarray production setting. Bioinformatics 19 (2003) ii156-ii161
9. Branke, J., Middendorf, M.: Searching for shortest common supersequences by means of a heuristic based genetic algorithm. In: Proceedings of the Second Nordic Workshop on Genetic Algorithms and their Applications, Finnish Artificial Intel-ligence Society (1996) 105-114
10. Downey, R., Fellows, M.: Parameterized Complexity. Springer-Verlag (1998)
11. Chen, J., Kanj, I., Jia, W.: Vertex cover: further observations and further improvements. In: Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science. Number 1665 in Lecture Notes in Computer Science, Berlin Heidelberg, Springer-Verlag (1999) 313-324
12. Niedermeier, R., Rossmanith, P.: A general method to speed up fixed-parameter-tractable algorithms. Information Processing Letters 73 (2000) 125-129
13. Feo, T., Resende, M.: Greedy randomized adaptive search procedures. Journal of Global Optimization 6 (1995) 109-133
14. Cotta, G., Fernández, A.: A hybrid GRASP-evolutionary algorithm approach to golomb ruler search. In Yao, X., et al., eds.: Parallel Problem Solving From Nature VIII. Volume 3242 of Lecture Notes in Computer Science., Berlin, Springer-Verlag (2004) 481-490
15. Lehmann, E.: Nonparametric Statistical Methods Based on Ranks. McGraw-Hill, New York NY (1975)