par Cao, Zhengjun 
;Liu, Lihua;Markowitch, Olivier
Référence Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, 5, page (1526-1531)
Publication Publié, 2009-02
;Liu, Lihua;Markowitch, Olivier Référence Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, 5, page (1526-1531)
Publication Publié, 2009-02
Article révisé par les pairs
| Résumé : | In the primitive greedy algorithm for shortest superstring, if a pair of strings with maximum overlap picked out, they are subsequently merged. In this paper, we introduce the concept of optimal set and generalize the primitive greedy algorithm. The generalized algorithm can be reduced to the primitive greedy algorithm if the relative optimal set is empty. Consequently, the new algorithm achieves a better bound at the expense of cost. But the cost is acceptable in practice. © 2009 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering. |
