Paper Info
Title
Solving the multiple sequence alignment problem using prototype optimization with evolved improvement steps
Abstract
This paper deals with a Multiple Sequence Alignment problem, for which an implementation of the Prototype Optimization with Evolved Improvement Steps (POEMS) algorithm has been proposed. The key feature of the POEMS is that it takes some initial solution, which is then iteratively improved by means of what we call evolved hypermutations. In this work, the POEMS is seeded with a solution provided by the Clustal X algorithm. Major result of the presented experiments was that the proposed POEMS implementation performs significantly better than the other two compared algorithms, which rely on randomhypermutations only. Based on the carried out analyses we proposed two modifications of the POEMS algorithm that might further improve its performance.
Year
DOI
Venue
2009
10.1007/978-3-642-04921-7_19
ICANNGA
Keywords
Field
DocType
poems algorithm,key feature,paper deal,initial solution,prototype optimization,multiple sequence alignment problem,improvement step,major result,proposed poems implementation,clustal x algorithm,evolved improvement,sequence alignment,multiple sequence alignment,evolutionary algorithm
Sequence alignment,Evolutionary algorithm,Computer science,Artificial intelligence,Multiple sequence alignment
Conference
Volume
ISSN
ISBN
5495.0
0302-9743
3-642-04920-6
Citations 
PageRank 
References 
6
0.75
7
Authors
1
Name
Order
Citations
PageRank
Jiří Kubalík1556.42