SCOPUS 정보 검색 플랫폼

Volumn 3503, Issue , 2005, Pages 4-15

Using an adaptive memory strategy to improve a multist art heuristic for sequencing by hybridization

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; HEURISTIC METHODS; PROBLEM SOLVING; QUALITY CONTROL; STRATEGIC PLANNING;

ADAPTIVE MEMORY STRATEGY; CONSTRUCTION PROCEDURES; PROBLEM SEQUENCING; TIME CONSUMING TECHNIQUES;

ADAPTIVE SYSTEMS;

EID: 24944590986 PISSN: 03029743 EISSN: None Source Type: Conference Proceeding
DOI: 10.1007/11427186_2 Document Type: Conference Paper

Times cited : (7)

References (9)

1
- 0036566527
- Probability distribution of solution time in GRASP: An experimental investigation
- R.M. Alex, M.G.C. Resende, and C.C. Ribeiro. Probability distribution of solution time in GRASP: An experimental investigation. Journal of Heuristics, 8:343-373, 2002.
- (2002) Journal of Heuristics , vol.8 , pp. 343-373
- Alex, R.M.¹ Resende, M.G.C.² Ribeiro, C.C.³

2
- 0345865009
- Genbank: Update
- D.A. Benson, I. Karsch-Mizrachi, D.J. Lipman, J. Ostell, and D.L. Wheeler. Genbank: Update. Nucleic Acids Research, 32:D23-D26, 2004.
- (2004) Nucleic Acids Research , vol.32
- Benson, D.A.¹ Karsch-Mizrachi, I.² Lipman, D.J.³ Ostell, J.⁴ Wheeler, D.L.⁵

3
- 0036088375
- A heuristic managing errors for DNA sequencing
- J. Blazewicz, P. Formanowicz, F. Guinand, and M. Kasprzak. A heuristic managing errors for DNA sequencing. Bioinformatics, 18:652-660, 2002.
- (2002) Bioinformatics , vol.18 , pp. 652-660
- Blazewicz, J.¹ Formanowicz, P.² Guinand, F.³ Kasprzak, M.⁴

4
- 0033705735
- Tabu search for DNA sequencing with false negatives and false positives
- J. Blazewicz, P. Formanowicz, M. Kasprzak, W. T. Markiewicz, and T. Weglarz. Tabu search for DNA sequencing with false negatives and false positives. European Journal of Operational Research, 125:257-265, 2000.
- (2000) European Journal of Operational Research , vol.125 , pp. 257-265
- Blazewicz, J.¹ Formanowicz, P.² Kasprzak, M.³ Markiewicz, W.T.⁴ Weglarz, T.⁵

5
- 85009230331
- Complexity of DNA sequencing by hybridization
- J. Blazewicz and M. Kasprzak. Complexity of DNA sequencing by hybridization. Theoretical Computer Science, 290:1459-1473, 2003.
- (2003) Theoretical Computer Science , vol.290 , pp. 1459-1473
- Blazewicz, J.¹ Kasprzak, M.²

6
- 5044243168
- Probabilistic nucleotide assembling method for sequencing by hybridization
- T. A. Endo. Probabilistic nucleotide assembling method for sequencing by hybridization. Bioinformatics, 20:2181-2188, 2004.
- (2004) Bioinformatics , vol.20 , pp. 2181-2188
- Endo, T.A.¹

7
- 0001245363
- Improved constructive multistart strategies for the quadratic assignment problem using adaptive memory
- G. Fleurent and F. Glover. Improved constructive multistart strategies for the quadratic assignment problem using adaptive memory. INFORMS Journal on Computing, 11:198-204, 1999.
- (1999) INFORMS Journal on Computing , vol.11 , pp. 198-204
- Fleurent, G.¹ Glover, F.²

8
- 0003921505
- MIT Press
- P.A. Pevzner. Computational molecular biology: An algorithmic approach. MIT Press, 2000.
- (2000) Computational Molecular Biology: An Algorithmic Approach
- Pevzner, P.A.¹

9
- 0003512471
- Chapman & Hall
- M.S. Waterman. Introduction to computational biology: Maps, sequences and genomes. Chapman & Hall, 1995.
- (1995) Introduction to Computational Biology: Maps, Sequences and Genomes
- Waterman, M.S.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.