SYSTOLIC SYSTEMS FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM

被引：0

作者：

ANDREJKOVA, G ^{[1
]}

机构：

[1] UNIV PAVLA JOZEFA SAFARIKA, FAC NAT SCI, DEPT THEORET CYBERNET & MATH INFORMAT, CS-04154 KOSICE, CZECHOSLOVAKIA

来源：

COMPUTERS AND ARTIFICIAL INTELLIGENCE | 1986年 / 5卷 / 03期

关键词：

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

引用

页码：199 / 212

页数：14

共 50 条

[1] A SYSTOLIC ARRAY FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM
ROBERT, Y
TCHUENTE, M
INFORMATION PROCESSING LETTERS, 1985, 21 (04) : 191 - 198
[2] NEW SYSTOLIC ARRAYS FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM
LIN, YC
PARALLEL COMPUTING, 1994, 20 (09) : 1323 - 1334
[3] An efficient systolic algorithm for the longest common subsequence problem
Lin, YC
Chen, JC
JOURNAL OF SUPERCOMPUTING, 1998, 12 (04): : 373 - 385
[4] An Efficient Systolic Algorithm for the Longest Common Subsequence Problem
Yen-Chun Lin
Jyh-Chian Chen
The Journal of Supercomputing, 1998, 12 : 373 - 385
[5] Another efficient systolic algorithm for the longest common subsequence problem
Lin, YC
Chen, JC
JOURNAL OF THE CHINESE INSTITUTE OF ENGINEERS, 2000, 23 (05) : 607 - 613
[6] A scalable and efficient systolic algorithm for the longest common subsequence problem
Lin, YC
Yeh, JW
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 2002, 18 (04) : 519 - 532
[7] A Systolic Architecture with Linear Space Complexity for Longest Common Subsequence Problem
Chen, Chuanpeng
Qin, Zhongping
2009 IEEE 8TH INTERNATIONAL CONFERENCE ON ASIC, VOLS 1 AND 2, PROCEEDINGS, 2009, : 33 - 36
[8] ALGORITHMS FOR LONGEST COMMON SUBSEQUENCE PROBLEM
HIRSCHBERG, DS
JOURNAL OF THE ACM, 1977, 24 (04) : 664 - 675
[9] THE LONGEST COMMON SUBSEQUENCE PROBLEM REVISITED
APOSTOLICO, A
GUERRA, C
ALGORITHMICA, 1987, 2 (03) : 315 - 336
[10] On the constrained longest common subsequence problem
Gorbenko, A. (gorbenko.aa@gmail.com), 1600, International Association of Engineers (40):

← 1 2 3 4 5 →