Related Experiment Video
Updated: Mar 16, 2026

Improving Student Outcomes with an Adaptable Molecular Cloning Course-Based Undergraduate Research Experience
Published on: November 15, 2024
Restarting and recentering genetic algorithm variations for DNA fragment assembly: The necessity of a multi-strategy
James Alexander Hughes1, Sheridan Houghten1, Daniel Ashlock2
1Computer Science Department, Brock University, 500 Glenridge Ave., St. Catharines, Ontario L2S 3A1, Canada.
Abstract:
DNA Fragment assembly - an NP-Hard problem - is one of the major steps in of DNA sequencing. Multiple strategies have been used for this problem, including greedy graph-based algorithms, deBruijn graphs, and the overlap-layout-consensus approach. This study focuses on the overlap-layout-consensus approach. Heuristics and computational intelligence methods are combined to exploit their respective benefits. These algorithm combinations were able to produce high quality results surpassing the best results obtained by a number of competitive algorithms specially designed and tuned for this problem on thirteen of sixteen popular benchmarks. This work also reinforces the necessity of using multiple search strategies as it is clearly observed that algorithm performance is dependent on problem instance; without a deeper look into many searches, top solutions could be missed entirely.
Related Concept Videos
Restarting Stalled Replication Forks
Restarting Stalled Replication Forks
Genome Annotation and Assembly
Next-generation Sequencing
Next-Generation Sequencing Methods
Although all next-generation methods use different technologies, they all share a set of standard features....
Homologous Recombination
Sanger Sequencing

