کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
5520678 1544956 2016 11 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Restarting and recentering genetic algorithm variations for DNA fragment assembly: The necessity of a multi-strategy approach
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات مدل‌سازی و شبیه سازی
پیش نمایش صفحه اول مقاله
Restarting and recentering genetic algorithm variations for DNA fragment assembly: The necessity of a multi-strategy approach
چکیده انگلیسی

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.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Biosystems - Volume 150, December 2016, Pages 35-45
نویسندگان
, , ,