Browsing 2010 MU theses - Access restricted to UM by Identifier "https://hdl.handle.net/10355/8135"
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 ...