Parallel Implementation of Median String Algorithms

Among the different heuristics proposed to solve the median string problem, only a few algorithms achieve bounded approximations to the theoretical median string. This family of algorithms is relatively slow. For datasets that exceed hundreds of strings, it takes tens of hours to achieve a result. T...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Proceedings - International Conference of the Chilean Computer Science Society s. 1 - 6
Hlavní autori: Mirabal, Pedro, Lincolao-Venegas, Ignacio, Castillo-Sanhueza, Mario, Abreu, Jose
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 15.11.2021
Predmet:
Approximation algorithms
Computer science
edit distance
Heuristic algorithms
median string
paralell algorithms
Parallel processing
perturbation-based algorithms
ISSN:2691-0632
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Among the different heuristics proposed to solve the median string problem, only a few algorithms achieve bounded approximations to the theoretical median string. This family of algorithms is relatively slow. For datasets that exceed hundreds of strings, it takes tens of hours to achieve a result. This behavior limits the applications of these algorithms to real problems where the volume of data is increasing. In this paper, we present a parallelized implementation of a Perturbation-based heuristic to solve the median string problem. A set of experiments is developed that allows us to compare the parallel implementation with its sequential equivalent. Results show that while data increases, the advantage of using parallelism for this problem becomes more evident.
ISSN:2691-0632
DOI:10.1109/SCCC54552.2021.9650389