A Space-Bounded Anytime Algorithm for the Multiple Longest Common Subsequence Problem

Jiaoyun Yang, Yun Xu, Yi Shang, Guoliang Chen. A Space-Bounded Anytime Algorithm for the Multiple Longest Common Subsequence Problem. IEEE Trans. Knowl. Data Eng., 26(11):2599-2609, 2014. [doi]

@article{YangXSC14,
  title = {A Space-Bounded Anytime Algorithm for the Multiple Longest Common Subsequence Problem},
  author = {Jiaoyun Yang and Yun Xu and Yi Shang and Guoliang Chen},
  year = {2014},
  doi = {10.1109/TKDE.2014.2304464},
  url = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2014.2304464},
  researchr = {https://researchr.org/publication/YangXSC14},
  cites = {0},
  citedby = {0},
  journal = {IEEE Trans. Knowl. Data Eng.},
  volume = {26},
  number = {11},
  pages = {2599-2609},
}