Title :
A new systolic algorithm for computing longest common subsequences
Author_Institution :
Dept. of Electron. Eng., Nat. Taiwan Inst. of Technol., Taipei, Taiwan
Abstract :
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 presented. Compared with previous algorithms, it requires simpler operations as well as fewer I/O ports and data transfers between neighboring processing elements. The systolic algorithm requires fewer steps when recovering an LCS
Keywords :
mathematics computing; parallel algorithms; series (mathematics); systolic arrays; I/O ports; data transfers; longest common subsequences; processing elements; systolic algorithm; systolic array; CADCAM; Computer aided manufacturing; Content based retrieval; Data compression; Genetics; Pattern recognition; Text processing;
Conference_Titel :
TENCON '92. ''Technology Enabling Tomorrow : Computers, Communications and Automation towards the 21st Century.' 1992 IEEE Region 10 International Conference.
Conference_Location :
Melbourne, Vic.
Print_ISBN :
0-7803-0849-2
DOI :
10.1109/TENCON.1992.271970
