A SPACE-EFFICIENT PARALLEL SEQUENCE COMPARISON ALGORITHM FOR A MESSAGE-PASSING MULTIPROCESSOR

被引：27

作者：

HUANG, XQ ^{[1
]}

机构：

[1] PENN STATE UNIV,DEPT COMP SCI,UNIVERSITY PK,PA 16802

来源：

INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING | 1989年 / 18卷 / 03期

关键词：

D O I：

10.1007/BF01407900

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：223 / 239

页数：17

共 13 条

[1] OPTIMAL SEQUENCE ALIGNMENT USING AFFINE GAP COSTS [J].

ALTSCHUL, SF ;

ERICKSON, BW .

BULLETIN OF MATHEMATICAL BIOLOGY, 1986, 48 (5-6) :603-616

[2] PARALLEL PROCESSING OF BIOLOGICAL SEQUENCE COMPARISON ALGORITHMS [J].

EDMISTON, EW ;

CORE, NG ;

SALTZ, JH ;

SMITH, RM .

INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING, 1988, 17 (03) :259-275

[3]

EDMISTON EW, 1987, 1987 P INT C PAR PRO, P78

[4] AN IMPROVED ALGORITHM FOR MATCHING BIOLOGICAL SEQUENCES [J].

GOTOH, O .

JOURNAL OF MOLECULAR BIOLOGY, 1982, 162 (03) :705-708

[5] LINEAR SPACE ALGORITHM FOR COMPUTING MAXIMAL COMMON SUBSEQUENCES [J].

HIRSCHBERG, DS .

COMMUNICATIONS OF THE ACM, 1975, 18 (06) :341-343

[6]

LANDER E, 1988, 1988 P ICPP, V3, P257

[7]

Lipton R. J., 1985, 1985 Chapel Hill Conference on Very Large Scale Integration, P363

[8]

LIPTON RJ, 1986, 1986 INT WORKSH SYST

[9]

LIPTON RJ, 1986, CSTR02686 PRINC U TE

[10] OPTIMAL ALIGNMENTS IN LINEAR-SPACE [J].

MYERS, EW ;

MILLER, W .

COMPUTER APPLICATIONS IN THE BIOSCIENCES, 1988, 4 (01) :11-17

← 1 2 →