Solving the Multiple Sequence Alignment Problem Using Prototype Optimization with Evolved Improvement Steps

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F09%3A00158726" target="_blank" >RIV/68407700:21230/09:00158726 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Solving the Multiple Sequence Alignment Problem Using Prototype Optimization with Evolved Improvement Steps

Original language description

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 signifficantly better than the other two compared algorithms, which rely on random hypermutations only. Based on the carried out analyses we proposed two modifications of the POEMS algorithm that might further improve its performance.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

JC - Computer hardware and software

OECD FORD branch

—

Project

—

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2009

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

Adaptive and Natural Computing Algorithms

ISBN

978-3-642-04920-0

ISSN

0302-9743

e-ISSN

—

Number of pages

10

Pages from-to

—

Publisher name

Springer

Place of publication

Heidelberg

Event location

Kuopio

Event date

Apr 23, 2009

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—