@article{journals/cor/BlumDSJLMR21,
  added-at = {2020-11-17T00:00:00.000+0100},
  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://doi.org/10.1016/j.cor.2020.105089},
  interhash = {fda2d99fc5a5923592041dad42e7b9d1},
  intrahash = {9645a9edf1a7f2b2c4942a97569ab434},
  journal = {Comput. Oper. Res.},
  keywords = {dblp},
  pages = 105089,
  timestamp = {2020-11-19T11:35:13.000+0100},
  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
}

{"_id":"uLMX675K8XWbGEmZg","bibbaseid":"blum-djukanovic-santini-jiang-li-many-raidl-solvinglongestcommonsubsequenceproblemsviaatransformationtothemaximumcliqueproblem-2021","authorIDs":[],"author_short":["Blum, C.","Djukanovic, M.","Santini, A.","Jiang, H.","Li, C.","Manyà, F.","Raidl, G. R."],"bibdata":{"bibtype":"article","type":"article","added-at":"2020-11-17T00:00:00.000+0100","author":[{"propositions":[],"lastnames":["Blum"],"firstnames":["Christian"],"suffixes":[]},{"propositions":[],"lastnames":["Djukanovic"],"firstnames":["Marko"],"suffixes":[]},{"propositions":[],"lastnames":["Santini"],"firstnames":["Alberto"],"suffixes":[]},{"propositions":[],"lastnames":["Jiang"],"firstnames":["Hua"],"suffixes":[]},{"propositions":[],"lastnames":["Li"],"firstnames":["Chu-Min"],"suffixes":[]},{"propositions":[],"lastnames":["Manyà"],"firstnames":["Felip"],"suffixes":[]},{"propositions":[],"lastnames":["Raidl"],"firstnames":["Günther","R."],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/29645a9edf1a7f2b2c4942a97569ab434/dblp","ee":"https://doi.org/10.1016/j.cor.2020.105089","interhash":"fda2d99fc5a5923592041dad42e7b9d1","intrahash":"9645a9edf1a7f2b2c4942a97569ab434","journal":"Comput. Oper. Res.","keywords":"dblp","pages":"105089","timestamp":"2020-11-19T11:35:13.000+0100","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","bibtex":"@article{journals/cor/BlumDSJLMR21,\n added-at = {2020-11-17T00:00:00.000+0100},\n author = {Blum, Christian and Djukanovic, Marko and Santini, Alberto and Jiang, Hua and Li, Chu-Min and Manyà, Felip and Raidl, Günther R.},\n biburl = {https://www.bibsonomy.org/bibtex/29645a9edf1a7f2b2c4942a97569ab434/dblp},\n ee = {https://doi.org/10.1016/j.cor.2020.105089},\n interhash = {fda2d99fc5a5923592041dad42e7b9d1},\n intrahash = {9645a9edf1a7f2b2c4942a97569ab434},\n journal = {Comput. Oper. Res.},\n keywords = {dblp},\n pages = 105089,\n timestamp = {2020-11-19T11:35:13.000+0100},\n title = {Solving longest common subsequence problems via a transformation to the maximum clique problem.},\n url = {http://dblp.uni-trier.de/db/journals/cor/cor125.html#BlumDSJLMR21},\n volume = 125,\n year = 2021\n}\n\n","author_short":["Blum, C.","Djukanovic, M.","Santini, A.","Jiang, H.","Li, C.","Manyà, F.","Raidl, G. R."],"key":"journals/cor/BlumDSJLMR21","id":"journals/cor/BlumDSJLMR21","bibbaseid":"blum-djukanovic-santini-jiang-li-many-raidl-solvinglongestcommonsubsequenceproblemsviaatransformationtothemaximumcliqueproblem-2021","role":"author","urls":{"Link":"https://doi.org/10.1016/j.cor.2020.105089","Paper":"http://dblp.uni-trier.de/db/journals/cor/cor125.html#BlumDSJLMR21"},"keyword":["dblp"],"downloads":0},"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/Gunther?items=1000","creationDate":"2020-11-19T14:18:48.062Z","downloads":0,"keywords":["dblp"],"search_terms":["solving","longest","common","subsequence","problems","via","transformation","maximum","clique","problem","blum","djukanovic","santini","jiang","li","manyà","raidl"],"title":"Solving longest common subsequence problems via a transformation to the maximum clique problem.","year":2021,"dataSources":["vx3tQbZepny2tNB7k"]}