메뉴 건너뛰기




Volumn 2, Issue 4, 2005, Pages 499-505

A genetic algorithm approach to solving DNA fragment assembly problem

Author keywords

Bioinformatics; DNA sequencing; Fragment assembly; Genetic algorithm

Indexed keywords

DNA SEQUENCES; GENETIC ALGORITHMS; MATHEMATICAL MODELS; MOLECULAR BIOLOGY;

EID: 30744437644     PISSN: 15461955     EISSN: None     Source Type: Journal    
DOI: 10.1166/jctn.2005.004     Document Type: Article
Times cited : (24)

References (33)
  • 2
    • 27144445163 scopus 로고    scopus 로고
    • Computational methods for fast and accurate DNA fragment assembly
    • Ph.D. dissertation, University of Wisconsin-Madison, Madison, WI
    • C. F. Allex, Computational methods for fast and accurate DNA fragment assembly. Ph.D. dissertation, University of Wisconsin-Madison, Madison, WI (1999).
    • (1999)
    • Allex, C.F.1
  • 9
    • 0012826304 scopus 로고
    • Assembling DNA sequence fragments by shuffling and simulated annealing
    • Tech. Rep. LAUR 93-2287, Los Alamos National Laboratory, Los Alamos, NM
    • G. Churchill, C. Burks, M. Eggert, M. Engle, and M. Waterman, Assembling DNA sequence fragments by shuffling and simulated annealing. Tech. Rep. LAUR 93-2287, Los Alamos National Laboratory, Los Alamos, NM (1993).
    • (1993)
    • Churchill, G.1    Burks, C.2    Eggert, M.3    Engle, M.4    Waterman, M.5


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