Solving the DNA Fragment Assembly Problem Efficiently Using Iterative Optimization with Evolved Hypermutations

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F10%3A00171004" target="_blank" >RIV/68407700:21230/10:00171004 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Solving the DNA Fragment Assembly Problem Efficiently Using Iterative Optimization with Evolved Hypermutations
Original language description
The paper presents a successful application of an evolutionary based iterative optimization method called Prototype Optimization with Evolved Improvement Steps (POEMS) to the DNA fragment assembly problem. The DNA fragment assembly problem, known to be NP-hard, is of great importance as it constitutes an important step in the genome project. The POEMS is an iterative algorithm that employs an evolutionary algorithm for exploration of the current solution's neighborhood in each iteration of the optimization process. Experiments show that the proposed POEMS approach performs very well and generates better results than those generated by other state-of-the-art methods.
Czech name
—
Czech description
—

Publication year
2010
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Proceedings of the 12th annual conference comp on Genetic and evolutionary computation
ISBN
978-1-4503-0073-5
ISSN
—
e-ISSN
—
Number of pages
2
Pages from-to
—
Publisher name
ACM
Place of publication
New York
Event location
Portland, Oregon
Event date
Jul 7, 2010
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)