Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Entire DC Network
A Genetic Algorithm For The Longest Common Subsequence Problem, Brenda Hinkemeyer
A Genetic Algorithm For The Longest Common Subsequence Problem, Brenda Hinkemeyer
Culminating Projects in Computer Science and Information Technology
The Longest Common Subsequence problem (LCS) is a known NP-complete problem that computes the longest subsequence (series of characters occurring in the same order, although not necessarily consecutively) that any number of strings share. An LCS is not necessarily unique for any combination of strings; however, the length will be. The computationally difficult version of this problem occurs when the number of strings and the LCS length are not fixed. The problem has a number of applications: anything from searching content to file difference listings. There is no single solution that fits all situations, and the deterministic solutions available are …