Improved greedy algorithm for computing approximate median strings

Kruzslicz Ferenc: Improved greedy algorithm for computing approximate median strings. In: Acta cybernetica, (14) 2. pp. 331-339. (1999)

[thumbnail of cybernetica_014_numb_002_331-339.pdf]
Cikk, tanulmány, mű

Download (1MB) | Preview


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.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 1999
Volume: 14
Number: 2
ISSN: 0324-721X
Page Range: pp. 331-339
Language: English
Place of Publication: Szeged
Event Title: Conference for PhD Students in Computer Science (1.) (1998) (Szeged)
Related URLs:
Uncontrolled Keywords: Számítástechnika, Kibernetika, Algoritmus
Additional Information: Bibliogr.: 339. p. ; összefoglalás angol nyelven
Subjects: 01. Natural sciences
01. Natural sciences > 01.02. Computer and information sciences
Date Deposited: 2016. Oct. 15. 12:26
Last Modified: 2022. Jun. 14. 09:34

Actions (login required)

View Item View Item