Please use this identifier to cite or link to this item:
Title: Automata technique for the LCS problem
Authors: Nguyen, Huy Truong
Keywords: Automata
Dynamic programing
Knapsack shaking approach
Longest common sub-sequence
Parallel LCS
Issue Date: 2019
Series/Report no.: Journal of Computer Science and Cybernetics;Vol.35 (01) .- P.21–37
Abstract: In this paper, we introduce two efficient algorithms in practice for computing the length of a longest common subsequence of two strings, using automata technique, in sequential and parallel ways. For two input strings of lengths m and n with m ≤ n, the parallel algorithm uses k processors (k ≤ m) and costs time complexity O(n) in the worst case, where k is an upper estimate of the length of a longest common subsequence of the two strings. These results are based on the Knapsack Shaking approach proposed by P.T.Huy et al. in 2002. Experimental result show that for the alphabet of size 256, our sequential and parallel algorithms are about 65.85 and 3,41m times faster than the classical dynamic programming algorithm proposed by Wagner and Fisher in 1974, respectively.
ISSN: 1813-9663
Appears in Collections:Tin học và Điều khiển học (Journal of Computer Science and Cybernetics)

Files in This Item:
File Description SizeFormat 
_file_5.31 MBAdobe PDFView/Open
Your IP:

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.