Solving longest common subsequence problems via a...

Computers & Operations Research 2021 / 01 Vol. 125

Solving longest common subsequence problems via a transformation to the maximum clique problem

Blum, Christian, Djukanovic, Marko, Santini, Alberto, Jiang, Hua, Li, Chu-Min, Manyà, Felip, Raidl, Günter R.
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
125
Journal:
Computers & Operations Research
DOI:
10.1016/j.cor.2020.105089
Date:
January, 2021
File:
PDF, 3.60 MB
2021
Conversion to is in progress
Conversion to is failed