An Efficient Parallel Algorithm for the Multiple Longest Common Subsequence (MLCS) Problem | IEEE Conference Publication | IEEE Xplore