2026-04-07T05:59:24Z
https://pub.unibl.org/oai
oai:pub.unibl.org:37720
2024-06-12T15:38:17Z
Solving longest common subsequence problems via a transformation to the maximum clique problem
/unibl/author/Christian Blum
https://www.unibl.org/sr-lat/fis/zaposlen/5218-marko-djukanovic
/unibl/author/Alberto Santini
/unibl/author/Hua Jiang
/unibl/author/Chu-Min Li
/unibl/author/Felip Manya
/unibl/author/Guenther Raidl
2021-01
Academic Article
text
105089
Article
/unibl/sci/idNaucniRad:28189
https://pmf.unibl.org
COMPUTERS & OPERATIONS RESEARCH
0305-0548
COMPUTERS & OPERATIONS RESEARCH
0305-0548
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