FAST ALGORITHM FOR COMPUTING LONGEST COMMON SUBSEQUENCES

被引：416
作者：
HUNT, JW
SZYMANSKI, TG
机构：
[1] STANFORD UNIV,DEPT ELECT ENGN,STANFORD,CA 94305
[2] PRINCETON UNIV,DEPT ELECT ENGN & COMP SCI,PRINCETON,NJ 08540
来源：
COMMUNICATIONS OF THE ACM | 1977年 / 20卷 / 05期
关键词：
D O I：
10.1145/359581.359603
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：350 / 353
页数：4
相关论文
共 7 条
[1]  
CHVATAL V, 1972, STANCS72292 STANF U
[2]   COMPUTING LENGTH OF LONGEST INCREASING SUBSEQUENCES [J].
FREDMAN, ML .
DISCRETE MATHEMATICS, 1975, 11 (01) :29-35
[3]   LINEAR SPACE ALGORITHM FOR COMPUTING MAXIMAL COMMON SUBSEQUENCES [J].
HIRSCHBERG, DS .
COMMUNICATIONS OF THE ACM, 1975, 18 (06) :341-343
[4]  
SZYMANSKI TG, 1975, TR170 PRINC U DEP EL
[5]  
VANEMDEBOAS P, 1975, 16TH P ANN S F COMP, P75
[6]   STRING-TO-STRING CORRECTION PROBLEM [J].
WAGNER, RA ;
FISCHER, MJ .
JOURNAL OF THE ACM, 1974, 21 (01) :168-173
[7]  
YAO AC, 1975, UIUCDCSR75699 U ILL
1