메뉴 건너뛰기




Volumn 4446 LNCS, Issue , 2007, Pages 1-12

A new local search algorithm for the DNA fragment assembly problem

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; GENETIC ALGORITHMS; HEURISTIC ALGORITHMS; OPTIMIZATION; PROBLEM SOLVING; SEARCH ENGINES;

EID: 38049086719     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71615-0_1     Document Type: Conference Paper
Times cited : (54)

References (13)
  • 1
    • 0004096390 scopus 로고    scopus 로고
    • Introduction to Computational Molecular Biology
    • chapter 4, University of Campinas, Brazil
    • J. Setubal and J. Meidanis. Introduction to Computational Molecular Biology, chapter 4 - Fragment Assembly of DNA, pages 105-139. University of Campinas, Brazil, 1997.
    • (1997) Fragment Assembly of DNA , pp. 105-139
    • Setubal, J.1    Meidanis, J.2
  • 2
    • 84864719287 scopus 로고    scopus 로고
    • P. Green. Phrap. http://www.mbt.washington.edu/phrap.docs/phrap.html.
    • Phrap
    • Green, P.1
  • 5
    • 0032849859 scopus 로고    scopus 로고
    • CAP3: A DNA sequence assembly program
    • X. Huang and A. Madan. CAP3: A DNA sequence assembly program. Genome Research, 9:868-877, 1999.
    • (1999) Genome Research , vol.9 , pp. 868-877
    • Huang, X.1    Madan, A.2
  • 6
    • 0029312158 scopus 로고    scopus 로고
    • Towards simplifying and accurately formulating fragment assembly
    • E. W. Myers. Towards simplifying and accurately formulating fragment assembly. Journal of Computational Biology, 2(2):275-290, 2000.
    • (2000) Journal of Computational Biology , vol.2 , Issue.2 , pp. 275-290
    • Myers, E.W.1
  • 9
    • 0029387798 scopus 로고
    • Genetic algorithms, operators, and DNA fragment assembly
    • R. Parsons, S. Forrest, and C. Burks. Genetic algorithms, operators, and DNA fragment assembly. Machine Learning, 21:11-33, 1995.
    • (1995) Machine Learning , vol.21 , pp. 11-33
    • Parsons, R.1    Forrest, S.2    Burks, C.3
  • 11
    • 0015604699 scopus 로고
    • An effective heuristic algorithm for TSP
    • S. Lin and B.W. Kernighan. An effective heuristic algorithm for TSP. Operations Research, 21:498-516, 1973.
    • (1973) Operations Research , vol.21 , pp. 498-516
    • Lin, S.1    Kernighan, B.W.2
  • 12
    • 0027252551 scopus 로고
    • Artificially generated data sets for testing DNA fragment assembly algorithms
    • M. L. Engle and C. Burks. Artificially generated data sets for testing DNA fragment assembly algorithms. Genomics, 16, 1993.
    • (1993) Genomics , vol.16
    • Engle, M.L.1    Burks, C.2
  • 13
    • 51549099375 scopus 로고    scopus 로고
    • Exact and heuristic algorithms for the DNA fragment assembly problem
    • Stanford Univeristy, August, IEEE Press
    • Y. Jing and S. Khuri. Exact and heuristic algorithms for the DNA fragment assembly problem. In Proceedings of the IEEE Computer Society Bioinformatics Conference, pages 581-2, Stanford Univeristy, August 2003. IEEE Press.
    • (2003) Proceedings of the IEEE Computer Society Bioinformatics Conference , pp. 581-582
    • Jing, Y.1    Khuri, S.2


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