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...
Saved in:
| Published in: | Proceedings - International Conference of the Chilean Computer Science Society pp. 1 - 6 |
|---|---|
| Main Authors: | , , , |
| Format: | Conference Proceeding |
| Language: | English |
| Published: |
IEEE
15.11.2021
|
| Subjects: | |
| ISSN: | 2691-0632 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!