Genetic algorithms for DNA sequence assembly
Description:
This paper describes a genetic algorithm application to the DNA fragment assembly problems. The genetic algorithm uses a random key representation for representing the orderings of fragments. Two different fitness functions, both based on pairwise overlap strengths between fragments, were 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…
more
Date:
April 13, 1993
Creator:
Parsons, R.; Burks, C. (Los Alamos National Lab., NM (United States)) & Forrest, S. (New Mexico Univ., Albuquerque, NM (United States). Dept. of Computer Science)
Item Type:
Refine your search to only
Article
Partner:
UNT Libraries Government Documents Department