Name
Title | ||
|---|---|---|
Solving the DNA fragment assembly problem efficiently using iterative optimization with evolved hypermutations |
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1145/1830483.1830522 | GECCO |
Keywords | Field | DocType |
iterative optimization method,better result,dna fragment assembly problem,proposed poems approach,iterative algorithm,evolutionary algorithm,prototype optimization,evolved improvement,current solution,optimization process,dna fragmentation,evolutionary algorithms | Mathematical optimization,Genome project,Evolutionary algorithm,Iterative method,Computer science,Algorithm | Conference |
Citations | PageRank | References |
7 | 0.53 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jiří Kubalik | 1 | 14 | 2.57 |
| Petr Buryan | 2 | 9 | 2.18 |
| Libor Wagner | 3 | 7 | 0.53 |