Solving Longest Common Subsequence Problems via a Transformation to the Maximum Clique Problem (bibtex)
by , , , , , ,
Reference:
Solving Longest Common Subsequence Problems via a Transformation to the Maximum Clique ProblemChristian Blum, Marko Djukanovic, Alberto Santini, Hua Jiang, Chu-Min Li, Felipe Manya, Günter R. RaidlComputers & Operations Research, volume 125, number 105089, 2021.Note: previous technical report version at https://www.ac.tuwien.ac.at/files/tr/ac-tr-20-003.pdf
Bibtex Entry:
@article{blum-21,
author = {Christian Blum and Marko Djukanovic and Alberto Santini and
Hua Jiang and Chu-Min Li and Felipe Manya and Günter R. Raidl},
title = {Solving Longest Common Subsequence Problems via a Transformation to the Maximum Clique Problem},
journal = {Computers \& Operations Research},
year = {2021},
volume = {125},
number = {105089},
doi = {10.1016/j.cor.2020.105089},
url = {https://www.sciencedirect.com/science/article/abs/pii/S0305054820302069},
note = {previous technical report version at \url{https://www.ac.tuwien.ac.at/files/tr/ac-tr-20-003.pdf}},
}
Powered by bibtexbrowser