A genetic algorithm for the longest common subsequence problem

GECCO 2006 - Genetic and Evolutionary Computation Conference

Volumn 1, Issue , 2006, Pages 609-610

  Hinkemeyer, Brenda ^a   Julstrom, Bryant A ^a  

^a ST CLOUD STATE UNIVERSITY   (United States)

Author keywords

Genetic algorithm; Longest common subsequence; Strings

Indexed keywords

BINARY CODES; COMPUTATIONAL METHODS; DYNAMIC PROGRAMMING; ENCODING (SYMBOLS); OPTIMIZATION; PROBLEM SOLVING;

BINARY STRINGS; LONGEST COMMON SUBSEQUENCE PROBLEMS;

GENETIC ALGORITHMS;

EID: 33750260590     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1143997.1144105     Document Type: Conference Paper

References (1)

1. R. Iiving and C. Fraser. Two algorithms for the longest common subsequence of three (or more) strings. In Proceedings of the 3rd Annual Symposium on Combinatorial Pattern Matching, pages 214-229, New York, 1992. Springer-Verlag.