Quick-MLCS: a new algorithm for the multiple longest common subsequence problem

Authors:
Majid Sazvar;Mahmoud Naghibzadeh;Nayyereh Saadati
Affiliations:
Ferdowsi University of Mashhad, Mashhad, Iran;Ferdowsi University of Mashhad, Mashhad, Iran;Mashhad University of Medical Sciences, Mashhad, Iran
Venue:
Proceedings of the Fifth International C* Conference on Computer Science and Software Engineering
Year:
2012

Citing 10
Cited 0

A fast algorithm for computing longest common subsequences of small alphabet size

Journal of Information Processing
Fast linear-space computations of longest common subsequences

Theoretical Computer Science - Selected papers of the Combinatorial Pattern Matching School
Algorithms for the Longest Common Subsequence Problem

Journal of the ACM (JACM)
The Complexity of Some Problems on Subsequences and Supersequences

Journal of the ACM (JACM)
A fast algorithm for computing longest common subsequences

Communications of the ACM
Data Structures and Algorithms

Data Structures and Algorithms
A Survey of Longest Common Subsequence Algorithms

SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)
New Algorithms for the Longest Common Subsequence Problem

New Algorithms for the Longest Common Subsequence Problem
An Efficient Parallel Algorithm for the Multiple Longest Common Subsequence (MLCS) Problem

ICPP '08 Proceedings of the 2008 37th International Conference on Parallel Processing
A Fast Multiple Longest Common Subsequence (MLCS) Algorithm

IEEE Transactions on Knowledge and Data Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Finding the longest common subsequence (LCS) of multiple strings is a well-known problem that has many applications in various fields, such as computational biology and computational genomics. This problem has been studied by a number of researchers and over the years, its complexity has been improved from various aspects. This paper presents a new algorithm for the general case of multiple LCS (MLCS) which is based on one of the fastest existing algorithms. The proposed algorithm is founded on the dominant point approach and uses a linear sorting technique to minimize the dominant points set. The main idea is that, after linearly sorting dominant points, a one-pass linear algorithm can minimize the dominant points set. The results of theoretical and experimental evaluations indicate that the efficiency of the newly proposed algorithm in different scenarios is better than the fastest existing algorithm.