• A fast multiple longest common subsequence (MLCS) algorithm 

    Wang, Qingguo (University of Missouri--Columbia, 2010)
    [ACCESS RESTRICTED TO THE UNIVERSITY OF MISSOURI AT AUTHOR'S REQUEST.] Finding the longest common subsequence (LCS) of multiple strings is an NP-hard problem, with many applications in the areas of bioinformatics and ...