A DYNAMIC-PROGRAMMING ALGORITHM TO FIND ALL SOLUTIONS IN A NEIGHBORHOOD OF THE OPTIMUM

被引：45

作者：

WATERMAN, MS ^{[1
]}

BYERS, TH ^{[1
]}

机构：

[1] DIGITAL RES INC,PACIFIC GROVE,CA 93950

来源：

MATHEMATICAL BIOSCIENCES | 1985年 / 77卷 / 1-2期

关键词：

D O I：

10.1016/0025-5564(85)90096-3

中图分类号：

Q [生物科学];

学科分类号：

07 ; 0710 ; 09 ;

摘要：

引用

页码：179 / 188

页数：10

共 23 条

[11] DATA-STRUCTURES AND COMPUTER SCIENCE TECHNIQUES IN OPERATIONS-RESEARCH [J].

FOX, BL .

OPERATIONS RESEARCH, 1978, 26 (05) :686-717

[12] A METHOD FOR THE SOLUTION OF THE NTH BEST PATH PROBLEM [J].

HOFFMAN, W ;

PAVLEY, R .

JOURNAL OF THE ACM, 1959, 6 (04) :506-514

[13]

Lawler E.L., 1976, COMBINATORIAL OPTIMI

[14]

Minieka E., 1973, Journal of the Institute of Mathematics and Its Applications, V11, P145

[15]

NEEDLEMAN SB, 1970, J MOL BIOL, V48, P444

[16] THE KTH BEST ROUTE THROUGH A NETWORK [J].

POLLACK, M .

OPERATIONS RESEARCH, 1961, 9 (04) :578-580

[17]

Shier D. R., 1976, Networks, V6, P205, DOI 10.1002/net.3230060303

[18] COMPUTATIONAL EXPERIENCE WITH AN ALGORITHM FOR FINDING K-SHORTEST PATHS IN A NETWORK [J].

SHIER, DR .

JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICAL SCIENCES, 1974, B 78 (03) :139-165

[19] COMPARATIVE BIOSEQUENCE METRICS [J].

SMITH, TF ;

WATERMAN, MS ;

FITCH, WM .

JOURNAL OF MOLECULAR EVOLUTION, 1981, 18 (01) :38-46

[20] GENERAL-METHODS OF SEQUENCE COMPARISON [J].

WATERMAN, MS .

BULLETIN OF MATHEMATICAL BIOLOGY, 1984, 46 (04) :473-500

← 1 2 3 →