Genetic algorithms for DNA sequence assembly.

R. Parsons, S. Forrest, C. Burks

Research output: Contribution to journalArticle

27 Scopus citations

Abstract

This paper describes a genetic algorithm application to the DNA sequence assembly problem. The genetic algorithm uses a sorted order representation for representing the orderings of fragments. Two different fitness functions, both based on pairwise overlap strengths between fragments, are tested. The paper concludes that the genetic algorithm is a promising method for fragment assembly problems, achieving usable solutions quickly, but that the current fitness functions are flawed and that other representations might be more appropriate.

Original languageEnglish (US)
Pages (from-to)310-318
Number of pages9
JournalProceedings / ... International Conference on Intelligent Systems for Molecular Biology ; ISMB. International Conference on Intelligent Systems for Molecular Biology
Volume1
StatePublished - 1993
Externally publishedYes

ASJC Scopus subject areas

  • Medicine(all)

Cite this