IEEE - Institute of Electrical and Electronics Engineers, Inc. - A new systolic algorithm for computing longest common subsequences

Author(s): Lin, Y.-C.
Publisher: IEEE - Institute of Electrical and Electronics Engineers, Inc.
Publication Date: 1 January 1992
Conference Location: Melbourne, Vic., Australia
Conference Date: 11 November 1992
ISBN (Paper): 0-7803-0849-2
DOI: 10.1109/TENCON.1992.271970
Regular:

On the various algorithms proposed for the longest common subsequence (LCS) problem, systolic algorithms are the fastest. A new systolic algorithm that improves on previous systolic algorithms is... View More

Advertisement