Browsing Theses and Dissertations (MU) by Title "A fast multiple longest common subsequence (MLCS) algorithm"
Now showing items 1-1 of 1
-
A fast multiple longest common subsequence (MLCS) algorithm
(University of Missouri--Columbia, 2010)[ACCESS RESTRICTED TO THE UNIVERSITY OF MISSOURI AT REQUEST OF AUTHOR.] Finding the longest common subsequence (LCS) of multiple strings is an NP-hard problem, with many applications in the areas of bioinformatics and ...