Solving longest common subsequence problems via a transformation to the maximum clique problem
Title
Solving longest common subsequence problems via a transformation to the maximum clique problem
Identifier
/unibl/sci/idNaucniRad:28189
Type
See all items with this valueAcademic Article
Date
Bibliographic Citation
C. Blum, M. Đukanović, A. Santini, H. Jiang, C. Li, F. Manya, G. Raidl, Solving longest common subsequence problems via a transformation to the maximum clique problem, COMPUTERS & OPERATIONS RESEARCH, Vol. 125, pp. Article - 105089, Jan, 2021
page start
Article
page end
105089
Is Part Of
See all items with this valueCOMPUTERS & OPERATIONS RESEARCH
See all items with this value0305-0548
list of authors
Position: 2936 (174 views)