Solving longest common subsequence problems via a transformation to the maximum clique problem
Naslov
Solving longest common subsequence problems via a transformation to the maximum clique problem
Identifikator
/unibl/sci/idNaucniRad:28189
Tip
Pronađite slične unoseAcademic Article
Datum
Pronađite slične unose2021-01
Bibliografski citat
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
Početna stranica
Article
Krajnja stranica
105089
Je dio
COMPUTERS & OPERATIONS RESEARCH
0305-0548
Lista autora
Position: 2024 (57 views)