AN IMPROVED ALGORITHM FOR COMPUTING THE EDIT DISTANCE OF RUN-LENGTH CODED STRINGS

被引：35

作者：

BUNKE, H ^{[1
]}

CSIRIK, J ^{[1
]}

机构：

[1] UNIV SZEGED,DEPT APPL COMP SCI,H-6720 SZEGED,HUNGARY

来源：

INFORMATION PROCESSING LETTERS | 1995年 / 54卷 / 02期

关键词：

ALGORITHMS; APPROXIMATE STRING MATCHING; STRING EDIT DISTANCE;

D O I：

10.1016/0020-0190(95)00005-W

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

[No abstract available]

引用

页码：93 / 96

页数：4

共 10 条

[1] AN ALGORITHM FOR MATCHING RUN-LENGTH CODED STRINGS [J].

BUNKE, H ;

CSIRIK, J .

COMPUTING, 1993, 50 (04) :297-314

[2] AN IMPROVED ALGORITHM FOR APPROXIMATE STRING MATCHING [J].

GALIL, Z ;

PARK, K .

SIAM JOURNAL ON COMPUTING, 1990, 19 (06) :989-999

[3]

Galil Z., 1988, Journal of Complexity, V4, P33, DOI 10.1016/0885-064X(88)90008-8

[4] A FASTER ALGORITHM COMPUTING STRING EDIT DISTANCES [J].

MASEK, WJ ;

PATERSON, MS .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1980, 20 (01) :18-31

[5]

Sankoff D, 1983, TIME WARPS STRING ED

[6] APPROXIMATE BOYER-MOORE STRING MATCHING [J].

TARHIO, J ;

UKKONEN, E .

SIAM JOURNAL ON COMPUTING, 1993, 22 (02) :243-260

[7] ALGORITHMS FOR APPROXIMATE STRING MATCHING [J].

UKKONEN, E .

INFORMATION AND CONTROL, 1985, 64 (1-3) :100-118

[8] STRING-TO-STRING CORRECTION PROBLEM [J].

WAGNER, RA ;

FISCHER, MJ .

JOURNAL OF THE ACM, 1974, 21 (01) :168-173

[9]

WANG BF, 1953, J ALGORITHM, V14, P466

[10] FAST TEXT SEARCHING ALLOWING ERRORS [J].

WU, S ;

MANBER, U .

COMMUNICATIONS OF THE ACM, 1992, 35 (10) :83-91

← 1 →