Algorithms for computing variants of the longest common subsequence problem

Iliopoulos, Costas S.; Rahman, M. Sohel

by Costas S. Iliopoulos, M. Sohel Rahman

Reference:

Algorithms for computing variants of the longest common subsequence problem (Costas S. Iliopoulos, M. Sohel Rahman), In Theoretical Computer Science, volume 395, 2008.

Bibtex Entry:

@ARTICLE{IR07AlgoVarLCSJ,
  author    = "Costas S. Iliopoulos and M. Sohel Rahman",
  title     = "Algorithms for computing variants of the longest common subsequence problem",
  journal   = "Theoretical Computer Science",
  volume    = "395",
  number    = "2-3",
  year      = "2008",
  pages     = "255--267"
}