A heuristic managing errors for DNA sequencing

被引：31

作者：

Blazewicz, J ^{[1
]}

Formanowicz, P

Guinand, F

Kasprzak, M

机构：

[1] Poznan Univ Technol, Inst Comp Sci, PL-60965 Poznan, Poland

[2] Polish Acad Sci, Inst Bioorgan Chem, PL-61704 Poznan, Poland

[3] Le Havre Univ, LIH, F-76058 Le Havre, France

来源：

BIOINFORMATICS | 2002年 / 18卷 / 05期

关键词：

D O I：

10.1093/bioinformatics/18.5.652

中图分类号：

Q5 [生物化学];

学科分类号：

071010 ; 081704 ;

摘要：

Motivation: A new heuristic algorithm for solving DNA sequencing by hybridization problem with positive and negative errors. Results: A heuristic algorithm providing better solutions than algorithms known from the literature based on tabu search method.

引用

页码：652 / 660

页数：9

共 22 条

[1]

[Anonymous], [No title captured], Patent No. 8810400

[2]

APOSTOLICO A, 1997, MATH SUPPORT MOL BIO

[3] A NOVEL METHOD FOR NUCLEIC-ACID SEQUENCE DETERMINATION [J].

BAINS, W ;

SMITH, GC .

JOURNAL OF THEORETICAL BIOLOGY, 1988, 135 (03) :303-307

[4] DNA sequencing with positive and negative errors [J].

Blazewicz, J ;

Formanowicz, P ;

Kasprzak, M ;

Markiewicz, WT ;

Weglarz, J .

JOURNAL OF COMPUTATIONAL BIOLOGY, 1999, 6 (01) :113-123

[5]

Blazewicz J, 1997, COMPUT APPL BIOSCI, V13, P151

[6] Tabu search for DNA sequencing with false negatives and false positives [J].

Blazewicz, J ;

Formanowicz, P ;

Kasprzak, M ;

Markiewicz, WT ;

Weglarz, J .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 125 (02) :257-265

[7]

BLAZEWICZ J, 2002, IN PRESS THEORETICAL

[8]

BLAZEWICZ J, 1999, P 3 MET INT C MIC 99, P69

[9]

CAVIANIPEASE AC, 1994, P NATL ACAD SCI USA, V91, P5022

[10] AN ALGORITHM FOR THE DNA-SEQUENCE GENERATION FROM K-TUPLE WORD CONTENTS OF THE MINIMAL NUMBER OF RANDOM FRAGMENTS [J].

DRMANAC, R ;

LABAT, I ;

CRKVENJAKOV, R .

JOURNAL OF BIOMOLECULAR STRUCTURE & DYNAMICS, 1991, 8 (05) :1085-1102

← 1 2 3 →