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

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!