Loughborough University
Browse
LHS05.pdf (176.25 kB)

Parallel genetic algorithm and parallel simulated annealing algorithm for the closest string problem

Download (176.25 kB)
online resource
posted on 2006-09-25, 16:44 authored by Xuan Liu, Hongmei He, Ondrej Sykora
In this paper, we design genetic algorithm and simulated annealing algorithm and their parallel versions to solve the Closest String problem. Our implementation and experiments show usefulness of the parallel GA and SA algorithms.

History

School

  • Science

Department

  • Computer Science

Pages

158114 bytes

Citation

LIU, HE and SÝKORA, 2005. Parallel genetic algorithm and parallel simulated annealing algorithm for the closest string problem. IN: First International Conference on Advanced Data Mining and Applications (ADMA), Wuhan, China, 22-24 July, Proceedings. Lecture Notes in Computer Science, 3584. Berlin : Springer Verlag, pp. 591-597

Publisher

© Springer Verlag

Publication date

2005

Notes

This is a conference paper

ISBN

9783540278948

ISSN

0302-9743

Language

  • en

Administrator link

Usage metrics

    Loughborough Publications

    Categories

    Keywords

    untaggedInformation and Computing Sciences not elsewhere classified

    Licence

    CC BY-NC-ND 4.0

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC