Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Journal Article
%1 journals/cor/BlumDSJLMR21
%A Blum, Christian
%A Djukanovic, Marko
%A Santini, Alberto
%A Jiang, Hua
%A Li, Chu-Min
%A Manyà, Felip
%A Raidl, Günther R.
%D 2021
%J Comput. Oper. Res.
%K dblp
%P 105089
%T Solving longest common subsequence problems via a transformation to the maximum clique problem.
%U http://dblp.uni-trier.de/db/journals/cor/cor125.html#BlumDSJLMR21
%V 125
@article{journals/cor/BlumDSJLMR21,
added-at = {2023-08-28T00:00:00.000+0200},
author = {Blum, Christian and Djukanovic, Marko and Santini, Alberto and Jiang, Hua and Li, Chu-Min and Manyà, Felip and Raidl, Günther R.},
biburl = {https://www.bibsonomy.org/bibtex/29645a9edf1a7f2b2c4942a97569ab434/dblp},
ee = {https://www.wikidata.org/entity/Q115926632},
interhash = {fda2d99fc5a5923592041dad42e7b9d1},
intrahash = {9645a9edf1a7f2b2c4942a97569ab434},
journal = {Comput. Oper. Res.},
keywords = {dblp},
pages = 105089,
timestamp = {2024-04-08T14:28:11.000+0200},
title = {Solving longest common subsequence problems via a transformation to the maximum clique problem.},
url = {http://dblp.uni-trier.de/db/journals/cor/cor125.html#BlumDSJLMR21},
volume = 125,
year = 2021
}