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...
Elmentve itt :
| Szerző: | |
|---|---|
| Testületi szerző: | |
| Dokumentumtípus: | Cikk |
| Megjelent: |
1999
|
| Sorozat: | Acta cybernetica
14 No. 2 |
| Kulcsszavak: | Számítástechnika, Kibernetika, Algoritmus |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12630 |
| LEADER | 01443nab a2200229 i 4500 | ||
|---|---|---|---|
| 001 | acta12630 | ||
| 005 | 20220614093455.0 | ||
| 008 | 161015s1999 hu o 0|| eng d | ||
| 022 | |a 0324-721X | ||
| 040 | |a SZTE Egyetemi Kiadványok Repozitórium |b hun | ||
| 041 | |a eng | ||
| 100 | 1 | |a Kruzslicz Ferenc | |
| 245 | 1 | 0 | |a Improved greedy algorithm for computing approximate median strings |h [elektronikus dokumentum] / |c Kruzslicz Ferenc |
| 260 | |c 1999 | ||
| 300 | |a 331-339 | ||
| 490 | 0 | |a Acta cybernetica |v 14 No. 2 | |
| 520 | 3 | |a 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. | |
| 650 | 4 | |a Természettudományok | |
| 650 | 4 | |a Számítás- és információtudomány | |
| 695 | |a Számítástechnika, Kibernetika, Algoritmus | ||
| 710 | |a Conference for PhD Students in Computer Science (1.) (1998) (Szeged) | ||
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/12630/1/cybernetica_014_numb_002_331-339.pdf |z Dokumentum-elérés |