THE COMPLEXITY OF THE OVERLAP METHOD FOR SEQUENCING BIO-POLYMERS

被引：9

作者：

GALLANT, JK ^{[1
]}

机构：

[1] PRINCETON UNIV,DEPT EECS,PRINCETON,NJ 08540

来源：

关键词：

D O I：

10.1016/0022-5193(83)90270-9

中图分类号：

Q [生物科学];

学科分类号：

07 ; 0710 ; 09 ;

摘要：

引用

页码：1 / 17

页数：17

共 9 条

[1]

Berge C., 1973, GRAPHS HYPERGRAPHS, V7

[2] ON FINDING MINIMAL LENGTH SUPERSTRINGS [J].

GALLANT, J ;

MAIER, D ;

STORER, JA .

[3]

Garey Michael R., 1979, COMPUTERS INTRACTABI

[4] COMPUTER-PROGRAMS FOR THE ASSEMBLY OF DNA SEQUENCES [J].

GINGERAS, TR ;

MILAZZO, JP ;

SCIAKY, D ;

ROBERTS, RJ .

[5] EVALUATION OF POLYMER SEQUENCE FRAGMENT DATA USING GRAPH THEORY [J].

HUTCHINSON, G .

BULLETIN OF MATHEMATICAL BIOPHYSICS, 1969, 31 (03) :541-+

[6] AN ALGORITHM FOR RECONSTRUCTING PROTEIN AND RNA SEQUENCES [J].

SHAPIRO, MB .

[7]

SMETANIC YS, 1979, B MATH BIOL, V41, P1

[8] STRATEGY OF DNA SEQUENCING EMPLOYING COMPUTER-PROGRAMS [J].

STADEN, R .

[9]

Wirth Niklaus., 1976, ALGORITHMS DATA STRU