Abstract This paper presents a new algorithm that can be used to compute an approximation to the median of a set of strings. The approximate median is obtained through the successive improvements of a partial solution. The edit distance from the partial solution to all the strings in the set is computed in each iteration, thus accounting for the fre- Comparative experiments involving Freeman chain codes encoding 2D shapes and the Copenhagen chromosome database show that the quality of the approximate median string is similar to benchmark approaches but achieves a much faster convergence.
Results in REF suggest that this approach has a fastest convergence but the quality of the approximated median is worst.
A new iterative algorithm for computing a quality approximate median of strings based on edit operations
Pattern Recognit. Lett.
Pattern Recognit. Lett.
Mathematics Computer Science