Stochastic local search algorithms for DNA word design

被引：0

作者：

Tulpan, DC ^{[1
]}

Hoos, HH ^{[1
]}

Condon, AE ^{[1
]}

机构：

[1] Univ British Columbia, Dept Comp Sci, Vancouver, BC V6T 1Z4, Canada

来源：

DNA COMPUTING | 2003年 / 2568卷

关键词：

DNA word design; combinatorics; stochastic local search; coding theory; hamming distance; GC content;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We present results on the performance of a stochastic local search algorithm for the design of DNA codes, namely sets of equal-length words over the nucleotides alphabet {A, C, G, T} that satisfy certain combinatorial constraints. Using empirical analysis of the algorithm, we gain insight on good design principles. We report several cases in which our algorithm finds word sets that match or exceed the best previously known constructions.(1)

引用

页码：229 / 241

页数：13

共 21 条

[1]

BENDOR A, 2000, P 4 ANN INT C COMP M, P65

[2]

BRAICH RS, 2000, P 6 INT M DNA BAS CO

[3] ENCODED COMBINATORIAL CHEMISTRY [J].

BRENNER, S ;

LERNER, RA .

PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 1992, 89 (12) :5381-5383

[4]

DEATON R, 1996, P 1 ANN C GEN PROGR

[5]

DEATON R, 1999, DIMACS SERIES DISCRE, V44, P247

[6]

ELGAMAL AA, 1987, IEEE T INFORMATION T, V33

[7] Molecular computation: RNA solutions to chess problems [J].

Faulhammer, D ;

Cukras, AR ;

Lipton, RJ ;

Landweber, LF .

PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2000, 97 (04) :1385-1389

[8]

Feldkamp U., 2000, 6 INT M DNA BAS COMP

[9] Demonstration of a word design strategy for DNA computing on surfaces [J].

Frutos, AG ;

Liu, QH ;

Thiel, AJ ;

Sanner, AMW ;

Condon, AE ;

Smith, LM ;

Corn, RM .

NUCLEIC ACIDS RESEARCH, 1997, 25 (23) :4748-4757

[10]

GALINA T, ERROR CORRECTING COD

← 1 2 3 →