Starting from scratch: Growing longest common subsequences with evolution

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4193 LNCS, Issue , 2006, Pages 930-938

  Julstrom, Bryant A ^a   Hinkemeyer, Brenda ^a  

^a ST CLOUD STATE UNIVERSITY   (United States)

Author keywords

Genetic algorithm; Initially empty solutions; Longest common subsequence

Indexed keywords

ENCODING (SYMBOLS); GENETIC ALGORITHMS; PROBLEM SOLVING; RANDOM PROCESSES;

INITIALLY EMPTY SOLUTIONS; LONGEST COMMON SUBSEQUENCE; RANDOM GENOTYPES; RANDOM SEQUENCES;

EVOLUTIONARY ALGORITHMS;

EID: 33750238434     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11844297_94     Document Type: Conference Paper

References (19)

1. Hinkemeyer, B., Julstrom, B.A.: A genetic algorithm for the longest common subsequence problem. In: Proceedings of the 2006 Genetic and Evolutionary Computation Conference, New York, The ACM Press (2006)
2. Maier, D.: The complexity of some problems on subsequences and supersequences. Journal of the ACM 25 (1978) 322-336
3. Irving, R., Fraser, C.: Two algorithms for the longest common subsequence of three (or more) strings. In: Proceedings of the 3rd Annual Symposium on Combinatorial Pattern Matching, New York, Springer-Verlag (1992) 214-229
4. Fogel, G., Chellapilla, K., Fogel, D.: Identification of coding regions in DNA sequences using evolved neural networks. In: Evolutionary Computation in Bioinformatics. Morgan Kaufmann, San Francisco, CA (2003)
5. Forrest, S., Javornik, B., Smith, R., Perelson, A.: Using genetic algorithms to explore pattern recognition in the immune system. Evolutionary Computation 1 (1993) 191-211
6. Pei, M., Goodman, E.D., Punch, W.F.: Pattern discovery from data using genetic algorithms. In: Proceedings of 1st Pacific-Asia Conference on Knowledge Discovery & Data Mining (PAKDD-97). (1997)
7. Shankar, P.: V Diff - A file comparer with visual output. On-line at http://www.codeproject.com/cpp/vdiff.asp?df=100&forumid=14638&exp= 0&select=825191 (2003) Retrieved October 25, 2004.
8. Clough, P.: Plagiarism in natural and programming languages: an overview of current tools and technologies. On-line at http://www.dcs.shef.ac.uk/ ~cloughie/papers/Plagiarism.pdf (2000) Retrieved October 13, 2004.
9. Grant, T., Baker, K.: Identifying reliable, valid markers of authorship: A response to Chaski. Forensic Linguistics 8 (2001) 66-79
10. Lovis, C., Baud, R.H.: Fast exact string pattern-matching algorithms adapted to the characteristics of the medical language. Journal of the American Medical Informatics Association 7 (2000) 378-391
11. Losee, R.: Learning syntactic rules and tags with genetic algorithms. Information Processing & Management 32 (1996) 185-197
12. Louis, S.: Learning to improve genetic algorithm performance on job shop scheduling. On-line at http://www.cs.utir.edu/~sushil/papers/conference/ newpapers/2002/gecco2002/cigarScheduling/cigarScheduling/cigarScheduling.html (2002) Retrieved October 21, 2004.
13. Navarro, G., Raffinot, M.: Flexible Pattern Matching in Strings. Cambridge University Press, New York (2002)
14. Bergroth, L., Hakonen, H., Raita, T.: A survey of longest common subsequence algorithms. In: Proceedings of the Seventh International Symposium on String Processing and Information Retrieval. (2000)
15. Koza, J.R.: Genetic Programming: On the programming of computers by means of natural selection. The MIT Press, Cambridge, MA (1992)
16. Banzhaf, W., Nordin, P., Keller, R.E., Francone, F.D.: Genetic programming: An introduction. Morgan Kaufmann, San Francisco (1998)
17. Koza, J.R., Bennett, F.H., Andre, D., Keane, M.A.: Evolution using genetic programming of a low-distortion 96 decibel operational amplifier. In Bryant, B., Carroll, J., Oppenheim, D., Hightower, J., George, K.M., eds.: Applied Computing 1997: Proceedings of the 1997 ACM Symposium on Applied Computing, New York, ACM Press (1997) 207-216
18. Koza, J.R., Bennett, F.H., Andre, D., Keane, M.A., Dunlap, F.: Automated systhesis of analog electrical circuits by means of genetic programming. IEEE Transactions on Evolutionary Computation 1 (1997) 109-128
19. Koza, J.R., Bennett, F.H., Andre, D., Keane, M.A.: Genetic Programming III: Darwinian Invention and Problem Solving. Morgan Kaufmann, San Francisco (1999)