9 citations · 12 across the 2 of their papers we have counts for
2 papers
cs.DS2020★ 3 cited
Pivot Selection for Median String Problem
Pedro Mirabal, José Abreu, Oscar Pedreira
The Median String Problem is W[1]-Hard under the Levenshtein distance, thus, approximation heuristics are used. Perturbation-based heuristics have been proved to be very competitiv…
cs.DS2019★ 9 cited
Assessing the best edit in perturbation-based iterative refinement algorithms to compute the median string
P. Mirabal, J. Abreu, D. Seco
Strings are a natural representation of biological data such as DNA, RNA and protein sequences. The problem of finding a string that summarizes a set of sequences has direct applic…