Improved greedy algorithm for computing approximate median strings
The distance of a string from a set of strings is defined by the sum of distances to the strings of the given set. A string that is closest to the set is called the median of the set. To find a median string is an NP-Hard problem in general, so it is useful to develop fast heuristic algorithms that...
Saved in:
| Main Author: | |
|---|---|
| Corporate Author: | |
| Format: | Article |
| Published: |
1999
|
| Series: | Acta cybernetica
14 No. 2 |
| Kulcsszavak: | Számítástechnika, Kibernetika, Algoritmus |
| Subjects: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12630 |
| Summary: | The distance of a string from a set of strings is defined by the sum of distances to the strings of the given set. A string that is closest to the set is called the median of the set. To find a median string is an NP-Hard problem in general, so it is useful to develop fast heuristic algorithms that give a good approximation of the median string. These methods significally depend on the type of distance used to measure the dissimilarity between strings. The present algorithm is based on edit distance of strings, and constructing the approximate median in a letter by letter manner. |
|---|---|
| Physical Description: | 331-339 |
| ISSN: | 0324-721X |